# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
463679 | tomsyd | 통행료 (IOI18_highway) | C++17 | 235 ms | 262148 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 "highway.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
vector<pair<int,int>> edges;
void dfs(int node, int prev){
for (int i:adj[node]){
if (i != prev){
dfs(i,node);
edges.emplace_back(node,i);
}
}
}
void find_pair(int N, vector<int> U, vector<int> V, int A, int B) {
int M = U.size();
edges.clear();
adj = vector<vector<int>>(N);
map<pair<int,int>,int> id;
for (int i=0; i<M; ++i){
adj[U[i]].emplace_back(V[i]);
adj[V[i]].emplace_back(U[i]);
id[make_pair(U[i],V[i])] = i;
id[make_pair(V[i],U[i])] = i;
}
dfs(0,-1);
vector<int> query;
for (int i=0; i<M; ++i) query.emplace_back(1);
int init = ask(query), crt = 0;
for (int j=0; j<edges.size(); ++j){
query[id[edges[j]]] = 0;
if (ask(query) != init){
crt = edges[j].second;
break;
}
query[id[edges[j]]] = 1;
}
answer(crt,0);
}
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... |