# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1165811 | Muhammet | Toll (APIO13_toll) | C++20 | 2595 ms | 324 KiB |
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define ll long long
ll n, m, k, an;
vector <int> p, a, h;
vector <vector <pair <int, int>>> v;
vector <pair <int, int>> blue;
void clr(vector <int> &p) {
p.resize(n+1);
for(int i = 1; i <= n; i++) {
p[i] = i;
}
}
int fnd(int x) {
if(p[x] == x) return p[x];
return p[x] = fnd(p[x]);
}
void dfs(int x, int y) {
# | 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... |