# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561018 | 2022-05-12T07:45:26 Z | AGE | Kocka (COCI18_kocka) | C++14 | 176 ms | 16668 KB |
#include<bits/stdc++.h> #define F first #define S second #define pb push_back #define int long long using namespace std; const int N=1e5+5,M=2e3+10,mod=100000000000031; vector<int>v; long long summ(long long x,long long y){ return ((x%mod)+(y%mod))%mod; } long long mult(long long x,long long y){ return ((x%mod)*(y%mod))%mod; } int ans[4][N]; set<int>st[N]; main() { int n; cin>>n; int ok=0; for(int i=1;i<=n;i++){ int x; cin>>x; if(x==-1) x=n; ans[0][i]=x+1; st[x+1].insert(i); } for(int i=1;i<=n;i++){ int x; cin>>x; if(x==-1) x=n; if(n-x!=-1&&n-x<ans[0][i]) ok=1; ans[1][i]=n-x; if(n-x==-1) continue; st[n-x].insert(i); } for(int i=1;i<=n;i++){ int x; cin>>x; if(x==-1) x=n+1; if(*st[i].begin()<=x) ok=1; ans[2][i]=x; } for(int i=1;i<=n;i++){ int x; cin>>x; if(x==-1) x=n+1; if(*st[i].begin()>n-x) ok=1; } if(ok==1) cout<<"NE"<<endl; else cout<<"DA"<<endl; return 0; } /* 3 -1 0 1 -1 2 1 -1 2 -1 1 0 -1 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 5076 KB | Output is correct |
2 | Incorrect | 6 ms | 5076 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 5076 KB | Output is correct |
2 | Incorrect | 4 ms | 5076 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 148 ms | 14912 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 176 ms | 16668 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 162 ms | 14984 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |