Submission #2631893

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
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;

#define sz(a)  int((a).size())
#define pb  push_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))

int solve(int N, vi& s) {
    int maxscore = 0;
    rep(i,N) maxscore += s[i];

    vi possible(1+maxscore, 0);
    possible[0] = 1;
    for (int si: s) { // 100
        rep(i, 1+maxscore){
            if (possible[i] && i+si <= maxscore) {
                possible[i+si] = 1;
            }
        }
    }
    // cerr << possible << endl;
    int best = 0;
    for (int score=maxscore; score>=0; --score) {
        if (!possible[score]) continue;
        if (score % 10 == 0) continue;
        return score;
    }
    return best;
}

int main() {
    int N; cin >> N;
    vi s(N);
    rep(i,N) cin >> s[i];
    cout << solve(N,s) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Bugged
User naoya_t
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1761 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 a01, a02, a03
All 0 / 300 a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12
Case Name Status Exec Time Memory
a01 1 ms 256 KB
a02 1 ms 256 KB
a03 1 ms 256 KB
b04 1 ms 256 KB
b05 2 ms 256 KB
b06 1 ms 256 KB
b07 2 ms 256 KB
b08 2 ms 256 KB
b09 2 ms 256 KB
b10 1 ms 256 KB
b11 2 ms 256 KB
b12 2 ms 256 KB