Submission #5437969
Source Code Expand
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); //clear memory #define CLR(a) memset((a), 0 ,sizeof(a)) //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; //-------------------------------------------- int N, P[101]; //--------------------------------------------------------------------------------------------------- int main() { cin >> N; REP(i, N) cin >> P[i]; int count = 0; VI tmp; tmp.push_back(0); REP(i, N){ int len = tmp.size(); REP(j,len){ tmp.push_back(tmp[j]+P[i]); } } SORT(tmp); tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end()); cout << tmp.size() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - コンテスト |
User | sogaani |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 2399 Byte |
Status | TLE |
Exec Time | 2124 ms |
Memory | 512 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | TLE | 2124 ms | -2094900 KB |
02 | TLE | 2116 ms | -2095028 KB |
90 | AC | 5 ms | 512 KB |
91 | AC | 1 ms | 256 KB |