# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633968 | 2022-08-23T14:25:42 Z | Farhan_HY | Kocka (COCI18_kocka) | C++14 | 32 ms | 16360 KB |
#include <bits/stdc++.h> #define int long long #define float double #define pb push_back #define F first #define S second #define T int t; cin >> t; while(t--) #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; /// Benzema is the best player in the world const int N = 1e6 + 5; const int M = 1e3 + 3; const int inf = 8e18; const int LOG = 31; const int mod = 1e9 + 7; const float pi = atan(1) * 4; int n; int a[M][M]; main() { IOS cin >> n; for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) a[i][j] = -1; for(int i = 1; i <= n; i++) { int x; cin >> x; if (x == -1) x = n; for(int j = 1; j <= x; j++) a[i][j] = 1; a[i][x + 1] = 0; } bool ok = 1; for(int i = 1; i <= n; i++) { int x; cin >> x; if (x == -1) x = n; x = n - x + 1; for(int j = x; j <= n; j++) { if (a[i][j] != -1 && a[i][j] != 1) ok = 0; a[i][j] = 1; } if (a[i][x - 1] != -1 && a[i][x - 1] != 0) ok = 0; a[i][x - 1] = 0; } for(int i = 1; i <= n; i++) { int x; cin >> x; if (x == -1) x = n; for(int j = 1; j <= x; j++) { if (a[j][i] != -1 && a[j][i] != 1) ok = 0; a[j][i] = 1; } if (a[x + 1][i] != -1 && a[x + 1][i] != 0) ok = 0; a[x + 1][i] = 0; } for(int i = 1; i <= n; i++) { int x; cin >> x; if (x == -1) x = n; x = n - x + 1; for(int j = x; j <= n; j++) { if (a[j][i] != -1 && a[j][i] != 1) ok = 0; a[j][i] = 1; } if (a[x - 1][i] != -1 && a[x - 1][i] != 0) ok = 0; a[x - 1][i] = 0; } if (ok) cout << "DA"; else cout << "NE"; } ///use scanf /* 3 -1 2 0 -1 0 1 2 2 1 0 0 1 3 -1 0 1 -1 2 1 -1 2 -1 1 0 -1 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 8148 KB | Output is correct |
2 | Correct | 8 ms | 8188 KB | Output is correct |
3 | Correct | 6 ms | 8148 KB | Output is correct |
4 | Correct | 8 ms | 8148 KB | Output is correct |
5 | Correct | 7 ms | 8148 KB | Output is correct |
6 | Correct | 10 ms | 8144 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 8148 KB | Output is correct |
2 | Correct | 4 ms | 8148 KB | Output is correct |
3 | Correct | 6 ms | 8148 KB | Output is correct |
4 | Correct | 4 ms | 8148 KB | Output is correct |
5 | Correct | 6 ms | 8148 KB | Output is correct |
6 | Correct | 8 ms | 8148 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 32 ms | 16360 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 28 ms | 16332 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 27 ms | 16308 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |