# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104950 | Shtef | KOVANICE (COI15_kovanice) | C++14 | 810 ms | 42352 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 <vector>
#include <algorithm>
#include <utility>
using namespace std;
typedef pair <int, int> pii;
#define x first
#define y second
#define mp make_pair
vector <int> ms[300005], fg[300005], topo[300005];
int n, m, v, link[300005], sz[300005], koja[300005], idx = 1, col[300005], val[300005];
vector <pii> a;
bool je[300005], bio[300005];
int tonumber(string s, int &x){
int ret = 0;
while(s[x] >= '0' && s[x] <= '9' && x < (int)s.size()){
ret = ret * 10 + s[x] - '0';
x++;
}
return ret;
}
int find(int x){
while(x != link[x]){
x = link[x];
}
# | 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... |