# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
561029 | 2022-05-12T07:50:37 Z | AGE | Kocka (COCI18_kocka) | C++14 | 172 ms | 16712 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+1; 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+1; 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 3 -1 2 0 -1 0 1 2 2 1 0 0 1 */
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 5076 KB | Output is correct |
2 | Incorrect | 3 ms | 5012 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 5076 KB | Output is correct |
2 | Incorrect | 4 ms | 5076 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 142 ms | 13268 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 172 ms | 16712 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 148 ms | 13236 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |