Submission #5869657
Source Code Expand
#include <bits/stdc++.h>
#include <vector>
#include <numeric>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD (1e9+7)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define ALL(v) v.begin(),v.end()
#define FIND(v,x) (binary_search(ALL(v),(x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(ALL(v));reverse(ALL(v))
#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define Yes(n) cout<<((n)?"Yes":"No")<<endl
#define YES(n) cout<<((n)?"YES":"NO")<<endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template<class A>void pr(A a){cout << (a) << endl;}
template<class A,class B>void pr(A a,B b){cout << a << " " ;pr(b);}
template<class A,class B,class C>void pr(A a,B b,C c){cout << a << " " ;pr(b,c);}
template<class A,class B,class C,class D>void pr(A a,B b,C c,D d){cout << a << " " ;pr(b,c,d);}
typedef long long ll;
typedef pair<int, int> pii;
int main(void)
{
int n;
cin >> n;
vector<int> p(n);
REP(i, n){
cin >> p[i];
}
vector<int> dp;
dp.pb(0);
dp.pb(p[0]);
Rep(i, 1, n){
vector<int> tmp = dp;
for(int a:tmp){
if(find(ALL(tmp), a+p[i]) == tmp.end()) dp.pb(a+p[i]);
}
}
pr(dp.size());
}
Submission Info
Submission Time |
|
Task |
A - コンテスト |
User |
Shun2019 |
Language |
C++14 (GCC 5.4.1) |
Score |
2 |
Code Size |
1497 Byte |
Status |
AC |
Exec Time |
192 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
2 / 2 |
Status |
|
Set Name |
Test Cases |
All |
00, 01, 02, 90, 91 |
Case Name |
Status |
Exec Time |
Memory |
00 |
AC |
1 ms |
256 KB |
01 |
AC |
26 ms |
256 KB |
02 |
AC |
192 ms |
256 KB |
90 |
AC |
1 ms |
256 KB |
91 |
AC |
1 ms |
256 KB |