# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077901 | vladilius | Highway Tolls (IOI18_highway) | C++17 | 91 ms | 36544 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;
using ll = long long;
using pii = pair<int, int>;
#define pb push_back
#define ff first
#define ss second
#define ins insert
void find_pair(int n, vector<int> U, vector<int> V, int A, int B){
if (U.size() != (n - 1)){
answer(0, 0);
return;
}
vector<pii> g[n + 1];
for (int i = 0; i < n - 1; i++){
U[i]++; V[i]++;
g[U[i]].pb({V[i], i});
g[V[i]].pb({U[i], i});
}
vector<int> w(n - 1);
ll nl = ask(w);
auto em = [&](){
fill(w.begin(), w.end(), 0);
};
vector<int> all;
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... |