# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
146086 | 2019-08-22T02:45:11 Z | youssan_william | Kocka (COCI18_kocka) | C++14 | 225 ms | 3524 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { int n; cin >> n; int arr[4][n]; int a[n] , b[n]; bool tillNowOk=true; for(int i = 0 ; i <2 ;i++) { for(int j= 0 ; j < n ;j++) { cin >> a[j]; } for(int j= 0 ; j < n ;j++) { cin >> b[j]; if(a[j]==-1&&b[j]==-1) continue; if(a[j]==-1&&b[j]!=-1) { tillNowOk=false; } if(b[j]==-1&&a[j]!=-1) { tillNowOk=false; } if(a[i]+b[i]<n) { continue; } else { tillNowOk=false; } } } if(!tillNowOk) { cout << "NE\n"; return 0; } cout << "DA\n"; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 380 KB | Output is correct |
3 | Correct | 3 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 376 KB | Output is correct |
5 | Correct | 4 ms | 376 KB | Output is correct |
6 | Correct | 3 ms | 380 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 376 KB | Output is correct |
2 | Correct | 4 ms | 376 KB | Output is correct |
3 | Correct | 4 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 376 KB | Output is correct |
5 | Correct | 18 ms | 376 KB | Output is correct |
6 | Correct | 3 ms | 376 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 174 ms | 3004 KB | Output is correct |
2 | Correct | 201 ms | 3448 KB | Output is correct |
3 | Correct | 200 ms | 3456 KB | Output is correct |
4 | Correct | 125 ms | 2276 KB | Output is correct |
5 | Correct | 210 ms | 3524 KB | Output is correct |
6 | Correct | 200 ms | 3420 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 186 ms | 3192 KB | Output is correct |
2 | Correct | 125 ms | 2352 KB | Output is correct |
3 | Correct | 199 ms | 3428 KB | Output is correct |
4 | Correct | 134 ms | 2424 KB | Output is correct |
5 | Correct | 200 ms | 3520 KB | Output is correct |
6 | Correct | 186 ms | 3236 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 175 ms | 2980 KB | Output is correct |
2 | Correct | 126 ms | 2296 KB | Output is correct |
3 | Correct | 207 ms | 3452 KB | Output is correct |
4 | Correct | 225 ms | 3424 KB | Output is correct |
5 | Correct | 200 ms | 3320 KB | Output is correct |
6 | Correct | 127 ms | 2420 KB | Output is correct |