#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "routers.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=6700417;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
ld const EPS=0.00000001;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(a) (int)a.size()
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll viz[100005];
ll check(ll pos,ll indx){
if(viz[pos]!=0){
if(viz[pos]>=indx){
return 1;
}else return 0;
}
int x=use_detector(pos);
viz[pos]=x;
if(x>=indx){
return 1;
}else return 0;
}
std::vector<int> find_routers(int st, int n, int q) {
vector<int>ans;
ans.pb(0);
ll last=0;
for(ll i=1;i<n;i++)
{
ll l=last+1,r=st-2*(n-i-1),res=0;
while(l<=r){
ll mid=(l+r)/2;
if(check(mid,i)){
res=mid;
r=mid-1;
}else l=mid+1;
}
int pos=res+res-last-2;
ans.pb(min(pos,st));
last=pos;
}
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 KB |
Output is correct |
| 5 |
Correct |
0 ms |
212 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
0 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
212 KB |
Output is correct |
| 12 |
Correct |
0 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
0 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
340 KB |
Output is correct |
| 18 |
Correct |
0 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
980 KB |
Output is correct |
| 2 |
Correct |
1 ms |
980 KB |
Output is correct |
| 3 |
Correct |
1 ms |
980 KB |
Output is correct |
| 4 |
Correct |
1 ms |
980 KB |
Output is correct |
| 5 |
Correct |
1 ms |
1044 KB |
Output is correct |
| 6 |
Correct |
1 ms |
980 KB |
Output is correct |
| 7 |
Correct |
1 ms |
980 KB |
Output is correct |
| 8 |
Correct |
1 ms |
980 KB |
Output is correct |
| 9 |
Correct |
1 ms |
980 KB |
Output is correct |
| 10 |
Correct |
1 ms |
928 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
980 KB |
Output is correct |
| 13 |
Correct |
0 ms |
340 KB |
Output is correct |
| 14 |
Correct |
2 ms |
980 KB |
Output is correct |
| 15 |
Correct |
1 ms |
980 KB |
Output is correct |
| 16 |
Correct |
1 ms |
980 KB |
Output is correct |
| 17 |
Correct |
2 ms |
980 KB |
Output is correct |
| 18 |
Correct |
1 ms |
980 KB |
Output is correct |
| 19 |
Correct |
1 ms |
980 KB |
Output is correct |
| 20 |
Correct |
1 ms |
980 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 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 |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
0 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
0 ms |
340 KB |
Output is correct |
| 13 |
Correct |
0 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
0 ms |
340 KB |
Output is correct |
| 16 |
Correct |
0 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
340 KB |
Output is correct |
| 18 |
Correct |
1 ms |
340 KB |
Output is correct |
| 19 |
Correct |
0 ms |
340 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 2 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 3 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 4 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 5 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 6 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 7 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 8 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 9 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 10 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 11 |
Partially correct |
1 ms |
340 KB |
Partial score |
| 12 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 15 |
Partially correct |
2 ms |
1108 KB |
Partial score |
| 16 |
Partially correct |
1 ms |
1108 KB |
Partial score |
| 17 |
Partially correct |
2 ms |
980 KB |
Partial score |
| 18 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 19 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 20 |
Partially correct |
1 ms |
980 KB |
Partial score |
| 21 |
Partially correct |
1 ms |
1108 KB |
Partial score |
