# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
532843 | ohohorz | Swapping Cities (APIO20_swap) | C++14 | 2050 ms | 25964 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 <vector>
#include<set>
#include<algorithm>
#include<climits>
using namespace std;
// #define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define sz(x) (int)x.size()
const int MAXN = 1e5 + 5;
const int INF = INT_MAX;
int n, m;
// vector< pair <int,int> > g[MAXN];
vector< pair<pii,int> > ed;
vector<int> wts;
int deg[MAXN];
int tot, onedeg, twodeg;
bool vis[MAXN];
vector<pii> g[MAXN];
void dfs(int u){
vis[u] = 1;
tot ++;
onedeg += (deg[u] == 1);
twodeg += (deg[u] == 2);
# | 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... |