# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92445 | ltomic | Kocka (COCI18_kocka) | C++14 | 403 ms | 66560 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 <set>
#include <cstdlib>
using namespace std;
const int MAXN = 1e5+5;
set<int> s[4][MAXN];
int l[MAXN], r[MAXN], u[MAXN], d[MAXN];
int n;
void no() {
printf("NE\n");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", l+i);
if (l[i] == -1) continue;
s[0][i].insert(l[i]);
s[1][l[i]].insert(i);
s[2][i].insert(n-l[i]-1);
s[3][l[i]].insert(n-i-1);
}
for (int i = 0; i < n; ++i) {
scanf("%d", r+i);
if (r[i] == -1) continue;
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... |