# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
87188 | jvalsortav | Kocka (COCI18_kocka) | C++14 | 12 ms | 6820 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 <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <utility>
#include <set>
using namespace std;
int n, x;
int square1[1010][1010], square2[1010][1010];
long long l[1010], r[1010], u[1010], d[1010];
bool inf = true;
int main() {
cin >> n;
for (int i = 0; i < n; i++){
cin >> x;
l[i] = x; // ljevo
if (x == -1) continue;
else{
square1[i][x] = 1;
}
# | 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... |