Submission #4283634


Source Code Expand

Copy
#include <iostream>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <numeric>
using namespace std;
#define mod (long)(100000)
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl(long(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
template<class T> inline void YES(T condition){ if(condition) cout << "YES" << endl; else cout << "NO" << endl; }
template<class T> inline void Yes(T condition){ if(condition) cout << "Yes" << endl; else cout << "No" << endl; }
template<class T> inline void POSS(T condition){ if(condition) cout << "POSSIBLE" << endl; else cout << "IMPOSSIBLE" << endl; }
template<class T> inline void Poss(T condition){ if(condition) cout << "Possible" << endl; else cout << "Impossible" << endl; }
template<class T> inline void First(T condition){ if(condition) cout << "First" << endl; else cout << "Second" << endl; }
template<class T = string, class U = char>int character_count(T text, U character){ int ans = 0; for(U i: text){ ans += (i == character); } return ans; }
long power(long base, long exponent, long module){ if(exponent % 2){ return power(base, exponent - 1, module) * base % module; }else if(exponent){ long root_ans = power(base, exponent / 2, module); return root_ans * root_ans % module; }else{ return 1; }}
struct position{ int y, x; }; position mv[4] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // double euclidean(position first, position second){ return sqrt((second.x - first.x) * (second.x - first.x) + (second.y - first.y) * (second.y - first.y)); }
template<class T, class U> string to_string(pair<T, U> x){ return to_string(x.first) + "," + to_string(x.second); }
template<class itr> void array_output(itr start, itr goal){ string ans; for(auto i = start; i != goal; i++){ ans += to_string(*i) + " "; } ans.pop_back(); cout << ans << endl; }
template<class itr> void cins(itr start, itr goal){ for(auto i = start; i != goal; i++){ cin >> (*i); } }
template<class T> T gcd(T a, T b){ if(a && b){ return gcd(min(a, b), max(a, b) % min(a, b)); }else{ return a; }} template<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }
struct combination{ vector<long> fact, inv; combination(int sz) : fact(sz + 1), inv(sz + 1){ fact[0] = 1; for(int i = 1; i <= sz; i++){ fact[i] = fact[i - 1] * i % mod; } inv[sz] = power(fact[sz], mod - 2, mod); for(int i = sz - 1; i >= 0; i--){ inv[i] = inv[i + 1] * (i + 1) % mod; } } long C(int p, int q) const{ if(q < 0 || p < q) return 0; return (fact[p] * inv[q] % mod * inv[p - q] % mod); } };

string max2(string a, string b){
    if(a[0] == '/' || b[0] == '/'){
        return max(a, b);
    }else if(a.size() > b.size()){
        return a;
    }else if(a.size() < b.size()){
        return b;
    }else{
        return max(a, b);
    }
}

vector<int> A;
int need[10] = {0,2,5,5,4,5,6,3,7,6};

string dp[10010];

string make(int remaining){
    if(remaining == 0){
        return "0";
    }else if(remaining < 0){
        return "/";
    }else if(dp[remaining] != "no"){
        return dp[remaining];
    }
    string ans = "/";
    for(int i: A){
        ans = max2(ans, make(remaining - need[i]) + string(1, i + '0'));
    }
    return dp[remaining] = ans;
}

int main(){
    int N;
    cin >> N;
    int M;
    cin >> M;
    A.resize(M);
    cins(all(A));
    for(int i = 0; i < 10010; i++){
        dp[i] = "no";
    }
    cout << make(N).substr(1) << endl;
}

Submission Info

Submission Time
Task D - Match Matching
User June_boy
Language C++14 (GCC 5.4.1)
Score 400
Code Size 3517 Byte
Status AC
Exec Time 60 ms
Memory 29184 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 29
AC × 3
Set Name Test Cases
All 0_random_1, 0_random_2, 0_random_3, 0_random_4, 0_random_5, 0_random_6, 0_random_7, 0_random_8, 1_normal_1, 1_normal_2, 1_normal_3, 1_normal_4, 1_normal_5, 1_normal_6, 2_corner_1, 2_corner_2, 2_corner_3, 2_corner_4, 2_corner_5, 2_corner_6, 3_hand_1, 3_hand_2, 3_hand_3, 3_hand_4, 3_hand_5, 3_hand_6, sample_01, sample_02, sample_03
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
0_random_1 AC 2 ms 768 KB
0_random_2 AC 2 ms 768 KB
0_random_3 AC 7 ms 1664 KB
0_random_4 AC 33 ms 29184 KB
0_random_5 AC 47 ms 19968 KB
0_random_6 AC 32 ms 16768 KB
0_random_7 AC 4 ms 2560 KB
0_random_8 AC 2 ms 896 KB
1_normal_1 AC 9 ms 3968 KB
1_normal_2 AC 30 ms 11520 KB
1_normal_3 AC 13 ms 4352 KB
1_normal_4 AC 32 ms 18432 KB
1_normal_5 AC 24 ms 26496 KB
1_normal_6 AC 19 ms 4736 KB
2_corner_1 AC 9 ms 2304 KB
2_corner_2 AC 3 ms 896 KB
2_corner_3 AC 20 ms 8064 KB
2_corner_4 AC 4 ms 1280 KB
2_corner_5 AC 3 ms 896 KB
2_corner_6 AC 8 ms 3200 KB
3_hand_1 AC 19 ms 14208 KB
3_hand_2 AC 2 ms 768 KB
3_hand_3 AC 2 ms 768 KB
3_hand_4 AC 2 ms 768 KB
3_hand_5 AC 2 ms 768 KB
3_hand_6 AC 60 ms 26624 KB
sample_01 AC 2 ms 768 KB
sample_02 AC 2 ms 768 KB
sample_03 AC 2 ms 768 KB