# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94460 | BigChungus | Kocka (COCI18_kocka) | C++14 | 117 ms | 5088 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 <iostream>
using namespace std;
const int N = 1e5 + 7;
int l[N], r[N], u[N], d[N], a[N], minst[N], maxdr[N];
/*
3
-1 2 0
-1 0 1
2 2 1
0 0 1
*/
int main()
{
int n;
bool ok(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> l[i];
if (l[i] == -1)
l[i] = n;
}
for (int i = 1; i <= n; ++i) {
cin >> r[i];
if (r[i] == -1)
r[i] = n;
# | 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... |