# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1095868 | owoovo | Highway Tolls (IOI18_highway) | C++17 | 291 ms | 262144 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>
#define ll long long
#define F first
#define S second
using namespace std;
vector<int> e[90010];
int n,dp[90010];
void dfs(int now,int last){
dp[now]=dp[last]+1;
for(auto x:e[now]){
if(x==last)continue;
dfs(x,now);
}
return;
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int M = U.size();
vector<int> w;
w.resize(M);
for(auto x:w)x=0;
for(int i=0;i<M;i++){
e[U[i]].push_back(V[i]);
e[V[i]].push_back(U[i]);
}
dp[0]=-1;
dfs(0,0);
ll now=ask(w);
ll need=now/A;
vector<int> may;
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... |