# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
336229 | 2020-12-15T03:11:40 Z | beksultan04 | Bigger segments (IZhO19_segments) | C++14 | 1500 ms | 26604 KB |
#include <bits/stdc++.h> using namespace std; #define int long long #define pii pair<int,int> #define OK puts("OK"); #define fr first #define sc second #define ret return #define scan1(a) scanf("%lld",&a); #define scan2(a,b) scanf("%lld %lld",&a, &b); #define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c); #define all(s) s.begin(),s.end() #define pb push_back #define sz(v) (int)v.size() #define endi puts(""); const int N = 1e6+12,INF=1e9+7; int q[N],ct[N],der[4*N],ans,n; vector <pii > v[N]; void rec(int j,int sum,int cnt){ int i; if (j > n){ ans = max(ans,cnt); ret ; } for (i=0;i<v[j].size();++i){ if (v[j][i].fr >= sum){ rec(v[j][i].sc+1,v[j][i].fr,cnt+1); } } } main(){ int i,j; scan1(n) for (i=1;i<=n;++i){ scan1(q[i]) } for (i=1;i<=n;++i){ int sum=0; for (j=i;j<=n;++j){ sum+=q[j]; v[i].pb({sum,j}); } } rec(1,0,0); cout <<ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23788 KB | Output is correct |
2 | Correct | 15 ms | 23788 KB | Output is correct |
3 | Correct | 14 ms | 23788 KB | Output is correct |
4 | Correct | 14 ms | 23788 KB | Output is correct |
5 | Correct | 17 ms | 23788 KB | Output is correct |
6 | Correct | 15 ms | 23788 KB | Output is correct |
7 | Correct | 15 ms | 23936 KB | Output is correct |
8 | Correct | 15 ms | 23788 KB | Output is correct |
9 | Correct | 14 ms | 23916 KB | Output is correct |
10 | Correct | 15 ms | 23788 KB | Output is correct |
11 | Correct | 15 ms | 23788 KB | Output is correct |
12 | Correct | 15 ms | 23788 KB | Output is correct |
13 | Correct | 16 ms | 23788 KB | Output is correct |
14 | Correct | 15 ms | 23788 KB | Output is correct |
15 | Correct | 15 ms | 23936 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23788 KB | Output is correct |
2 | Correct | 15 ms | 23788 KB | Output is correct |
3 | Correct | 14 ms | 23788 KB | Output is correct |
4 | Correct | 14 ms | 23788 KB | Output is correct |
5 | Correct | 17 ms | 23788 KB | Output is correct |
6 | Correct | 15 ms | 23788 KB | Output is correct |
7 | Correct | 15 ms | 23936 KB | Output is correct |
8 | Correct | 15 ms | 23788 KB | Output is correct |
9 | Correct | 14 ms | 23916 KB | Output is correct |
10 | Correct | 15 ms | 23788 KB | Output is correct |
11 | Correct | 15 ms | 23788 KB | Output is correct |
12 | Correct | 15 ms | 23788 KB | Output is correct |
13 | Correct | 16 ms | 23788 KB | Output is correct |
14 | Correct | 15 ms | 23788 KB | Output is correct |
15 | Correct | 15 ms | 23936 KB | Output is correct |
16 | Correct | 17 ms | 26604 KB | Output is correct |
17 | Execution timed out | 1586 ms | 26476 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23788 KB | Output is correct |
2 | Correct | 15 ms | 23788 KB | Output is correct |
3 | Correct | 14 ms | 23788 KB | Output is correct |
4 | Correct | 14 ms | 23788 KB | Output is correct |
5 | Correct | 17 ms | 23788 KB | Output is correct |
6 | Correct | 15 ms | 23788 KB | Output is correct |
7 | Correct | 15 ms | 23936 KB | Output is correct |
8 | Correct | 15 ms | 23788 KB | Output is correct |
9 | Correct | 14 ms | 23916 KB | Output is correct |
10 | Correct | 15 ms | 23788 KB | Output is correct |
11 | Correct | 15 ms | 23788 KB | Output is correct |
12 | Correct | 15 ms | 23788 KB | Output is correct |
13 | Correct | 16 ms | 23788 KB | Output is correct |
14 | Correct | 15 ms | 23788 KB | Output is correct |
15 | Correct | 15 ms | 23936 KB | Output is correct |
16 | Correct | 17 ms | 26604 KB | Output is correct |
17 | Execution timed out | 1586 ms | 26476 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23788 KB | Output is correct |
2 | Correct | 15 ms | 23788 KB | Output is correct |
3 | Correct | 14 ms | 23788 KB | Output is correct |
4 | Correct | 14 ms | 23788 KB | Output is correct |
5 | Correct | 17 ms | 23788 KB | Output is correct |
6 | Correct | 15 ms | 23788 KB | Output is correct |
7 | Correct | 15 ms | 23936 KB | Output is correct |
8 | Correct | 15 ms | 23788 KB | Output is correct |
9 | Correct | 14 ms | 23916 KB | Output is correct |
10 | Correct | 15 ms | 23788 KB | Output is correct |
11 | Correct | 15 ms | 23788 KB | Output is correct |
12 | Correct | 15 ms | 23788 KB | Output is correct |
13 | Correct | 16 ms | 23788 KB | Output is correct |
14 | Correct | 15 ms | 23788 KB | Output is correct |
15 | Correct | 15 ms | 23936 KB | Output is correct |
16 | Correct | 17 ms | 26604 KB | Output is correct |
17 | Execution timed out | 1586 ms | 26476 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 17 ms | 23788 KB | Output is correct |
2 | Correct | 15 ms | 23788 KB | Output is correct |
3 | Correct | 14 ms | 23788 KB | Output is correct |
4 | Correct | 14 ms | 23788 KB | Output is correct |
5 | Correct | 17 ms | 23788 KB | Output is correct |
6 | Correct | 15 ms | 23788 KB | Output is correct |
7 | Correct | 15 ms | 23936 KB | Output is correct |
8 | Correct | 15 ms | 23788 KB | Output is correct |
9 | Correct | 14 ms | 23916 KB | Output is correct |
10 | Correct | 15 ms | 23788 KB | Output is correct |
11 | Correct | 15 ms | 23788 KB | Output is correct |
12 | Correct | 15 ms | 23788 KB | Output is correct |
13 | Correct | 16 ms | 23788 KB | Output is correct |
14 | Correct | 15 ms | 23788 KB | Output is correct |
15 | Correct | 15 ms | 23936 KB | Output is correct |
16 | Correct | 17 ms | 26604 KB | Output is correct |
17 | Execution timed out | 1586 ms | 26476 KB | Time limit exceeded |
18 | Halted | 0 ms | 0 KB | - |