# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1137787 | eggx50000 | Take-out (POI13_usu) | C++20 | 218 ms | 52220 KiB |
#include <iostream>
#include <algorithm>
#include <string.h>
#include <vector>
#include <random>
#include <set>
#include <queue>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
int n, m, k, cnt[1000099], cp[1000099];
char ca[1000099];
struct Ufo{
int par[1000099], en[1000099];
void ini(){
for(int i = 1; i <= m; i ++) en[i] = i;
}
int fi(int a){
if(par[a] == 0) return a;
else return par[a] = fi(par[a]);
}
int nd(int a){
return en[fi(a)];
}
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... |
# | 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... |