Submission #4283838


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair

#define PQ(T) priority_queue<T>
#define RPQ(T) priority_queue<T,vector<T>,greater<T>>

template<class T> inline void amin(T & a, T const & b) { a = min(a, b); }
template<class T> inline void amax(T & a, T const & b) { a = max(a, b); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }



vi mts { 0, 2, 5, 5, 4, 5, 6, 3, 7, 6 };


void solve(int N, int M, vi& a) {
    vi u(8, -1);
    rep(i,M){
        int m = mts[ a[i] ];
        amax(u[m], a[i]);
    }

    vvi dp(N+10, vi(10, -1));
    dp[0] = vi(10, 0);

    rep(i,N){
        for (int m=2; m<=7; ++m) {
            if (u[m] == -1) continue;
            int p = 1 + (9 - u[m]);
            dp[i][0]++;
            dp[i][p]++;
            dp[i+m] = max(dp[i+m], dp[i]);
            dp[i][0]--;
            dp[i][p]--;
        }
    }
    for (int n=9; n>=1; --n) {
        rep(j, dp[N][1+9-n]) putchar('0'+n);
    }
    putchar('\n');
}

int main() {
    int N, M; cin >> N >> M;
    vi a(M);
    rep(i,M) cin >> a[i];
    solve(N,M,a);
    return 0;
}

Submission Info

Submission Time
Task D - Match Matching
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 2374 Byte
Status AC
Exec Time 2 ms
Memory 896 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 1 ms 256 KB
0_random_2 AC 1 ms 256 KB
0_random_3 AC 1 ms 384 KB
0_random_4 AC 2 ms 896 KB
0_random_5 AC 2 ms 896 KB
0_random_6 AC 2 ms 896 KB
0_random_7 AC 2 ms 768 KB
0_random_8 AC 1 ms 384 KB
1_normal_1 AC 2 ms 512 KB
1_normal_2 AC 2 ms 896 KB
1_normal_3 AC 2 ms 512 KB
1_normal_4 AC 2 ms 768 KB
1_normal_5 AC 2 ms 896 KB
1_normal_6 AC 2 ms 640 KB
2_corner_1 AC 2 ms 512 KB
2_corner_2 AC 1 ms 256 KB
2_corner_3 AC 2 ms 768 KB
2_corner_4 AC 1 ms 384 KB
2_corner_5 AC 1 ms 256 KB
2_corner_6 AC 2 ms 512 KB
3_hand_1 AC 2 ms 896 KB
3_hand_2 AC 1 ms 256 KB
3_hand_3 AC 1 ms 256 KB
3_hand_4 AC 1 ms 256 KB
3_hand_5 AC 1 ms 256 KB
3_hand_6 AC 2 ms 896 KB
sample_01 AC 1 ms 256 KB
sample_02 AC 1 ms 256 KB
sample_03 AC 1 ms 256 KB