# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
94183 | 2019-01-16T12:37:50 Z | AKaan37 | Nizin (COCI16_nizin) | C++14 | 107 ms | 32376 KB |
#include <bits/stdc++.h> using namespace std; typedef long long int lo; typedef pair<int,int> PII; #define fi first #define se second #define pb push_back #define mp make_pair #define FOR for(lo i=1;i<=n;i++) #define mid (start+end)/2 const lo mod = 1000000007; const lo li = 1000001; const lo inf = 1000000000; const lo MAX = 1000000000000000000; const lo MIN = -1000000000000000000; const lo LOG = 30; lo n,m,cev,a[li+1005],oo,ama,kk,vis[li+3000],gogo,nono; //~ vector<lo> v; lo nov; int main(){ scanf("%lld",&n); FOR{ scanf("%lld",&a[i]); } FOR{ if(i>n/2) break; if(vis[i]==1) continue; for(int u=n;u>=1;u--){ if(vis[u]==0) nov=u; break; } while(a[i]!=a[nov]){ vis[i]=1; vis[nov]=1; if(a[i]>a[nov]){ gogo++; a[nov]+=a[nov-gogo]; vis[nov-gogo]=1; oo++; } if(a[i]<a[nov]){ nono++; a[i]+=a[i+nono]; vis[i+nono]=1; oo++; //~ cout<<a[i]<<endl; } } } printf("%lld\n",oo); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Runtime error | 3 ms | 504 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 21 ms | 16124 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 21 ms | 16120 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 20 ms | 16248 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 20 ms | 16120 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 26 ms | 17500 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 52 ms | 21996 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 87 ms | 28892 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 107 ms | 32376 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |