# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059986 | mispertion | Swapping Cities (APIO20_swap) | C++17 | 193 ms | 54864 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 "swap.h"
#include <bits/stdc++.h>
#include <vector>
#pragma gcc optimize("unroll-loops")
#pragma gcc optimize("o3")
#pragma gcc optimize("Ofast")
using namespace std;
const int N = 1e5 + 5;
const int infi = INT_MAX;
typedef pair<int, int> pii;
#define mp make_pair
#define sz(x) (int)x.size()
#define pb push_back
#define F first
#define S second
struct dsu{
int pw[N];
vector<pii> p[N], cnt1[N], cnt2[N], sz[N];
vector<int> st[N];
dsu(int n){
for(int i = 1; i <= n; i++){
st[i] = {i};
p[i] = {{-1, i}};
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... |