| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 807103 | 2023-08-04T13:16:45 Z | LIF | Finding Routers (IOI20_routers) | C++14 | 1 ms | 340 KB |
#include "routers.h"
#include<bits/stdc++.h>
using namespace std;
int pos[300005];
int minn[300005];
bool check(int now,int find)
{
int idx = use_detector(now);
minn[idx] = min(minn[idx],now);
if(idx >= find)return true;
else return false;
}
std::vector<int> find_routers(int l, int n, int q) {
/*std::vector<int> ans;
for (int i = 0; i < n; i++) {
ans.push_back(0);
}*/
pos[0] = 0;
for(int i=1;i<n;i++)minn[i] = l;
for(int i=1;i<n;i++)
{
int ll = pos[i-1];
int rr = minn[i];
int ans;
while(ll <= rr)
{
int mid = (ll+rr)>>1;
if(check(mid,i) == true)
{
ans = mid;
rr = mid - 1;
}
else ll = mid + 1;
}
pos[i] = pos[i-1] + (ans - 1 - pos[i-1]) * 2;
}
vector<int> temp;
for(int i=0;i<n;i++)temp.push_back(pos[i]);
return temp;
}
Compilation message
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | Output is correct |
| 2 | Correct | 0 ms | 212 KB | Output is correct |
| 3 | Correct | 0 ms | 212 KB | Output is correct |
| 4 | Correct | 0 ms | 212 KB | Output is correct |
| 5 | Correct | 0 ms | 212 KB | Output is correct |
| 6 | Correct | 0 ms | 212 KB | Output is correct |
| 7 | Correct | 0 ms | 212 KB | Output is correct |
| 8 | Correct | 0 ms | 212 KB | Output is correct |
| 9 | Correct | 0 ms | 212 KB | Output is correct |
| 10 | Correct | 0 ms | 212 KB | Output is correct |
| 11 | Correct | 1 ms | 212 KB | Output is correct |
| 12 | Correct | 0 ms | 212 KB | Output is correct |
| 13 | Correct | 0 ms | 212 KB | Output is correct |
| 14 | Correct | 0 ms | 212 KB | Output is correct |
| 15 | Correct | 0 ms | 212 KB | Output is correct |
| 16 | Correct | 0 ms | 212 KB | Output is correct |
| 17 | Correct | 0 ms | 212 KB | Output is correct |
| 18 | Correct | 0 ms | 212 KB | Output is correct |
| 19 | Correct | 0 ms | 212 KB | Output is correct |
| 20 | Correct | 0 ms | 212 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | Output is correct |
| 2 | Correct | 0 ms | 212 KB | Output is correct |
| 3 | Correct | 1 ms | 212 KB | Output is correct |
| 4 | Correct | 0 ms | 212 KB | Output is correct |
| 5 | Correct | 0 ms | 212 KB | Output is correct |
| 6 | Correct | 0 ms | 212 KB | Output is correct |
| 7 | Correct | 1 ms | 212 KB | Output is correct |
| 8 | Correct | 0 ms | 212 KB | Output is correct |
| 9 | Correct | 0 ms | 212 KB | Output is correct |
| 10 | Correct | 0 ms | 212 KB | Output is correct |
| 11 | Correct | 0 ms | 212 KB | Output is correct |
| 12 | Correct | 0 ms | 212 KB | Output is correct |
| 13 | Correct | 0 ms | 212 KB | Output is correct |
| 14 | Correct | 0 ms | 212 KB | Output is correct |
| 15 | Correct | 0 ms | 212 KB | Output is correct |
| 16 | Correct | 1 ms | 212 KB | Output is correct |
| 17 | Correct | 0 ms | 212 KB | Output is correct |
| 18 | Correct | 0 ms | 212 KB | Output is correct |
| 19 | Correct | 0 ms | 212 KB | Output is correct |
| 20 | Correct | 0 ms | 212 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Correct | 0 ms | 212 KB | Output is correct |
| 2 | Correct | 0 ms | 212 KB | Output is correct |
| 3 | Correct | 0 ms | 212 KB | Output is correct |
| 4 | Correct | 0 ms | 212 KB | Output is correct |
| 5 | Correct | 0 ms | 212 KB | Output is correct |
| 6 | Correct | 1 ms | 212 KB | Output is correct |
| 7 | Correct | 0 ms | 212 KB | Output is correct |
| 8 | Correct | 0 ms | 212 KB | Output is correct |
| 9 | Correct | 1 ms | 212 KB | Output is correct |
| 10 | Correct | 0 ms | 212 KB | Output is correct |
| 11 | Correct | 0 ms | 212 KB | Output is correct |
| 12 | Correct | 0 ms | 212 KB | Output is correct |
| 13 | Correct | 0 ms | 212 KB | Output is correct |
| 14 | Correct | 1 ms | 212 KB | Output is correct |
| 15 | Correct | 1 ms | 212 KB | Output is correct |
| 16 | Correct | 0 ms | 212 KB | Output is correct |
| 17 | Correct | 1 ms | 212 KB | Output is correct |
| 18 | Correct | 0 ms | 212 KB | Output is correct |
| 19 | Correct | 0 ms | 212 KB | Output is correct |
| 20 | Correct | 1 ms | 212 KB | Output is correct |
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| 1 | Partially correct | 1 ms | 340 KB | Partial score |
| 2 | Partially correct | 1 ms | 212 KB | Partial score |
| 3 | Partially correct | 1 ms | 340 KB | Partial score |
| 4 | Partially correct | 1 ms | 212 KB | Partial score |
| 5 | Partially correct | 1 ms | 340 KB | Partial score |
| 6 | Partially correct | 1 ms | 212 KB | Partial score |
| 7 | Partially correct | 1 ms | 340 KB | Partial score |
| 8 | Partially correct | 1 ms | 212 KB | Partial score |
| 9 | Partially correct | 1 ms | 340 KB | Partial score |
| 10 | Partially correct | 1 ms | 340 KB | Partial score |
| 11 | Correct | 1 ms | 340 KB | Output is correct |
| 12 | Partially correct | 1 ms | 340 KB | Partial score |
| 13 | Correct | 1 ms | 212 KB | Output is correct |
| 14 | Partially correct | 1 ms | 340 KB | Partial score |
| 15 | Partially correct | 1 ms | 340 KB | Partial score |
| 16 | Partially correct | 1 ms | 340 KB | Partial score |
| 17 | Partially correct | 1 ms | 340 KB | Partial score |
| 18 | Partially correct | 1 ms | 340 KB | Partial score |
| 19 | Partially correct | 1 ms | 340 KB | Partial score |
| 20 | Partially correct | 1 ms | 340 KB | Partial score |
| 21 | Partially correct | 1 ms | 340 KB | Partial score |