# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
967081 | fcmalkcin | Swapping Cities (APIO20_swap) | C++17 | 79 ms | 17148 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 <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fs first
#define sc second
const int mxn = 2e5+10;
vector<int> v;
int N,M;
vector<pair<int,pii>> edges;
void init(int NN, int MM,
std::vector<int> U, std::vector<int> V, std::vector<int> W) {
N = NN,M = MM;
for(int i = 0;i<M;i++){
edges.push_back(make_pair(W[i],pii(U[i],V[i])));
}
sort(edges.begin(),edges.end());
return;
}
namespace BIS{
vector<int> paths[mxn];
int dp[mxn];
queue<int> q;
# | 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... |