# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
264866 | RuDi24 | Highway Tolls (IOI18_highway) | C++14 | 26 ms | 1736 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 <iostream>
#include <queue>
#include <map>
using namespace std;
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
map <int,vector<int>> gr;
for(int i = 0;i < M;i++){
gr[U[i]].push_back(V[i]);
gr[V[i]].push_back(U[i]);
}
queue <int> qu;
vector<int> dis(N);
vector<int> vis(N);
qu.push(0);
int dist = 0;
while(!qu.empty()) {
int sz = qu.size();
while(sz--){
int t = qu.front();
qu.pop();
for(int i = 0;i < gr[t].size();i++) if(!vis[gr[t][i]]) {
qu.push(gr[t][i]);
vis[gr[t][i]] = 1;
}
dis[t] = dist;
}
dist++;
}
vector<int> w(M,1);
int b = ask(w);
for(int i = 0;i < M;i++) w[i] = 0;
int a = ask(w);
for(int i = 0;i < N;i++){
if(dis[i]*A == a && dis[i]*B == b){
answer(0,i);
return ;
}
}
}
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... |