# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
88315 | ltomic | Zamjena (COCI18_zamjena) | C++14 | 156 ms | 9040 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>
#include <cstdio>
#include <vector>
#include <map>
using namespace std;
const int P = 1000, MAXN = 5e4+5;
vector<int> G[MAXN];
vector<int> val;
map <string, int> var;
int n, a[2][MAXN];
int cnt = 0;
char name[20];
bool check(const int &a, const int &b) {
if (a >= P && b < P) {
int id = a-P;
if (val[id] != 0 && val[id] != b) return false;
val[id] = b;
}
return true;
}
int val_comp[MAXN];
int comp[MAXN], cnt_comp;
void dfs(int x) {
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... |