# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334150 | 2020-12-08T12:49:22 Z | Kerim | Bigger segments (IZhO19_segments) | C++17 | 1 ms | 384 KB |
#include "bits/stdc++.h" #define MAXN 500009 #define INF 1000000007 #define mp(x,y) make_pair(x,y) #define all(v) v.begin(),v.end() #define pb(x) push_back(x) #define wr cout<<"----------------"<<endl; #define ppb() pop_back() #define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++) #define ff first #define ss second #define my_little_dodge 46 #define debug(x) cerr<< #x <<" = "<< x<<endl; using namespace std; typedef long long ll; typedef pair<int,int> PII; template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} int dp[MAXN],arr[MAXN],n; ll par[MAXN]; bool vis[MAXN]; int get(int i){ return lower_bound(par+i+1,par+n+1,2*par[i]-par[dp[i]])-par; } int main(){ // freopen("file.in", "r", stdin); int n,ok; scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",arr+i); par[i]=par[i-1]+arr[i]; } for(int i=1;i<=n;i++) vis[i]=1; for(int j=2;j<=n;j++){ ok=0; for(int i=n;i>=j-1;i--) if(vis[i]){ for(int k=get(i);k<=n;k++) if(!vis[k]) dp[k]=i,ok=1,vis[k]=1; vis[i]=0; } if(!ok){ printf("%d\n",j-1); return 0; } }printf("%d\n",n); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |