Submission #960063

#	Time	Username	Problem	Language	Result	Execution time	Memory
960063		hqminhuwu	Finding Routers (IOI20_routers)	C++14	0 / 100	1 ms	348 KiB

routers

#include <bits/stdc++.h>
#include "routers.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <ll,ll> pll;
typedef pair <int,int> pii;
typedef pair <int,pii> piii;

#define forr(_a,_b,_c) for(int _a = (_b); _a <= (_c); ++_a)
#define ford(_a,_b,_c) for(int _a = (_b) + 1; _a --> (_c);)
#define forf(_a,_b,_c) for(int _a = (_b); _a < (_c); ++_a)
#define st first
#define nd second
#define pb push_back
#define mp make_pair
#define all(x) begin(x),end(x)
#define mask(i) (1LL << (i))
#define bit(x, i) (((x) >> (i)) & 1)
#define bp __builtin_popcountll
#define file "test"

const int N = 5e5 + 5;
const ll oo = 1e9;
const ll mod = 1e9 + 7; // 998244353;


vector <int> find_routers (int l, int n, int q){
    vector <int> a(n, 0);
    
    forf (i, 1, n){
        int l = a[i - 1] + 1, r = l;
        while (l < r){
            int mid = (l + r) >> 1;
            if (use_detector(mid) < i)
                l = mid + 1;
            else r = mid;
        }
        a[i] = l - 1 + (l - 1 - a[i - 1]); 
    }
    return a;
}

//x..o..x..

• Subtask 1: 0 / 16
• Subtask 2: 0 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 40