| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 99375 | kimcoding | Kocka (COCI18_kocka) | C++17 | 102 ms | 6004 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <cstdio>
#include <cstring>
#define min(a,b) (a<b?a:b)
int *cube[4], *now[4], n;
int f(int i, int j, int val) {
	if (cube[i][j] > val || cube[i][j] == -1) return -2;
	return now[i][j] == -1  ? val : min(now[i][j], val);
}
bool solve() {
	for (int i = 0; i < 4; i++) {
		for (int j = 0; j < n; j++) {
			if (cube[i][j] == -1 || cube[i][j] == now[i][j]) continue;
			now[i][j] = cube[i][j];
			now[i ^ 1][j] = f(i ^ 1, j, n - cube[i][j] - 1);
			int r = (i / 2 * 2 + 2) % 4, c = i & 1 ? n - cube[i][j] - 1 : cube[i][j];
			now[r][c] = f(r, c, j);
			now[r + 1][c] = f(r + 1, c, n - j - 1);
			if (now[i ^ 1][j] == -2 || now[r][c] == -2 || now[r + 1][c] == -2) 
				return false;
		}
	}
	return true;
}
int main() {
	scanf("%d", &n);
	for (int i = 0; i < 4; i++) {
		cube[i] = new int[n];
		now[i] = new int[n];
		memset(now[i], -1, sizeof(int) * n);
	}
	for (int i = 0; i < 4; i++) 
		for (int j = 0; j < n; j++) scanf("%d", &cube[i][j]);
	printf("%s\n", solve() ? "DA" : "NE");
	return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
