| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 784167 | Ozy | Highway Tolls (IOI18_highway) | C++17 | 15 ms | 7760 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;
#define lli long long int
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "
#define rep(i,a,b) for(int i = (a); i <= (b); i++)
#define repa(i,a,b) for(int i = (a); i >= (b); i--)
#define pll pair<lli,lli>
#define MAX 90000
//para los hijos
#define des first
#define id second
lli m,df,prof;
lli arista_padre[MAX+2];
vector<pll> hijos[MAX+2];
vector<lli> nodos;
void dfs(lli pos, lli padre, lli p) {
if(p == prof) {
nodos.push_back(pos);
return;
}
for(auto h : hijos[pos]) {
if(padre == h.des) continue;
arista_padre[h.des] = h.id;
dfs(h.des,pos,p+1);
}
}
void find_pair(int n, std::vector<int> u, std::vector<int> v, int A, int B) {
m = u.size();
rep(i,0,m-1) {
hijos[u[i]].push_back({v[i],i});
hijos[v[i]].push_back({u[i],i});
}
vector<int> status;
status.resize(m);
rep(i,0,m-1) status[i] = 0;
df = ask(status);
prof = df/A;
dfs(0,-1,0);
lli last,ini = 0;
lli mitad,fin = nodos.size()-1;
while (ini <= fin) {
mitad = (ini+fin)/2;
rep(i,0,nodos.size()-1) {
if (ini <= i && i <= mitad) status[i] = 1;
else status[i] = 0;
}
lli x = ask(status);
if (x != df) {
fin = mitad-1;
last = mitad;
}
else ini = mitad+1;
}
answer(0,last);
}
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... | ||||
