# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1112340 | thelegendary08 | Highway Tolls (IOI18_highway) | C++14 | 97 ms | 8884 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 vi vector<int>
#define vb vector<bool>
#define vpii vector<pair<int,int>>
#define pb push_back
#define vvi vector<vector<int>>
#define ll long long int
#define f0r(i,n) for(int i = 0; i<n; i++)
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<'\n';
using namespace std;
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
int m = U.size();
ll ret;
vi w(m,0);
ret = ask(w);
ll base = ret;
ll len = ret/A;
vi dep(N);
dep[0] = 0;
queue<int>q;
q.push(0);
vb vis(N);
vis[0] = 1;
vpii adj[N];
f0r(i, m){
adj[U[i]].pb({V[i], i});
adj[V[i]].pb({U[i], i});
}
vi par(N, -1);
# | 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... |