| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 114505 | tinjyu | Highway Tolls (IOI18_highway) | C++14 | 30 ms | 4840 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>
using namespace std;
int m,ans[1000005];
int find(int s,int e)
{
std::vector<int> w(m);
for(int i=0;i<=m;i++)
{
w[i] = 0;
}
for(int i=s;i<=e;i++)
{
w[i]=1;
}
int t=ask(w);
if(t==e-s+1)
{
for(int i=s;i<=e;i++)
{
ans[0]++;
ans[ans[0]]=i;
}
}
else if(t==0)return 0;
else
{
find(s,(s+e)/2);
find((s+e)/2,e);
}
}
void find_pair(int N, std::vector<int> U, std::vector<int> V, int A, int B) {
m = U.size();
find(0,m);
int s=N+1,t=0;
for(int i=1;i<=ans[0];i++)
{
s=min(ans[i],s);
t=max(ans[i]+1,t);
}
answer(s, t);
}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... | ||||
