#include<iostream>
using namespace std;
int r[100002];
int s[100002];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n; bool f = 1; cin >> n;
for(int i=0;i<4;i++) {
for(int j=0;j<n;j++) {
int a;
cin >> a;
if(i == 0) {
if(a == -1) {
r[j] = -1;
continue;
}
r[j] = 1;
s[a] = 1;
}
else if(i == 1) {
if(a == -1) {
if(r[j] == 1) f = 0;
continue;
}
else if(r[j] == -1 || s[n - a - 1] == -1) f = 0;
r[j] = 1;
s[n - a - 1] = 1;
}
else if(i == 2) {
if(a == -1) {
if(s[j] == 1) f = 0;
continue;
}
else if(s[j] == -1 || r[a] == -1) f = 0;
r[a] = 1;
s[j] = 1;
}
else if(i == 3) {
if(a == -1) {
if(s[j] == 1) f = 0;
continue;
}
else if(s[j] == -1 || r[n - a - 1] == -1) f = 0;
r[n - a - 1] = 1;
s[j] = 1;
}
}
}
if(f) cout << "DA";
else cout << "NE";
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
380 KB |
Output is correct |
3 |
Correct |
2 ms |
552 KB |
Output is correct |
4 |
Correct |
2 ms |
604 KB |
Output is correct |
5 |
Correct |
2 ms |
604 KB |
Output is correct |
6 |
Correct |
2 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
604 KB |
Output is correct |
2 |
Correct |
2 ms |
604 KB |
Output is correct |
3 |
Correct |
2 ms |
604 KB |
Output is correct |
4 |
Correct |
2 ms |
604 KB |
Output is correct |
5 |
Correct |
2 ms |
732 KB |
Output is correct |
6 |
Correct |
2 ms |
732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
44 ms |
1400 KB |
Output is correct |
2 |
Correct |
47 ms |
1400 KB |
Output is correct |
3 |
Correct |
47 ms |
1404 KB |
Output is correct |
4 |
Correct |
31 ms |
1404 KB |
Output is correct |
5 |
Correct |
45 ms |
1404 KB |
Output is correct |
6 |
Correct |
47 ms |
1404 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
44 ms |
1516 KB |
Output is correct |
2 |
Correct |
31 ms |
1516 KB |
Output is correct |
3 |
Correct |
45 ms |
1516 KB |
Output is correct |
4 |
Correct |
35 ms |
1516 KB |
Output is correct |
5 |
Correct |
49 ms |
1516 KB |
Output is correct |
6 |
Correct |
46 ms |
1516 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
51 ms |
1516 KB |
Output is correct |
2 |
Correct |
32 ms |
1516 KB |
Output is correct |
3 |
Correct |
51 ms |
1516 KB |
Output is correct |
4 |
Correct |
56 ms |
1516 KB |
Output is correct |
5 |
Correct |
58 ms |
1516 KB |
Output is correct |
6 |
Correct |
31 ms |
1516 KB |
Output is correct |