# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1131809 | _DaNeK_ | Evacuation plan (IZhO18_plan) | C++20 | 615 ms | 499692 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pb push_back
#define fi first
#define se second
#define vi vector<int>
#define bust ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define all(x) x.begin(),x.end()
const int INF = (ll) 1e9 + 10;
const int N = 1e5 + 44;
const int LOG = 20;
const int SZ = 835;
const int mod = 1e9 + 7;
const ld eps = 1e-12;
vector<pair<int,int>> g[N], v;
vector<int> nwg[N];
vector<int> npp;
map<int,pair<int,int>> changed;
int dist[N], p[N], sz[N], bp[603][N], bsz[603][N], aa[N], ap[N], asz[N], kk;
int fndp(int x) {
if (p[x] == x) return x;
return p[x] = fndp(p[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |