제출 #960098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
960098		hqminhuwu	Finding Routers (IOI20_routers)	C++14	39 / 100	1 ms	856 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;
 
int pos[N], lmt;
 
void calc (int l, int r, int opl, int opr){
    if (l > r) return;
    if (l == r && l != 1 && r != (lmt - 1)){
      pos[l] = opl;
      return;
    }
    int m = (l + r) >> 1;
 
    int low = opl, high = opr;
    while (low < high){
        int mid = (low + high) >> 1;
        if (use_detector(mid) < m)
            low = mid + 1;
        else high = mid;
    }
 
    pos[m] = low - 1;
    calc (l, m - 1, opl, low - 1);
    calc (m + 1, r, low + 1, opr);
}
 
vector <int> find_routers (int len, int n, int q){
    vector <int> a(n, 0);
    lmt = n;
  
    calc (1, n - 1, 1, len ^ 1);
 
    forf (i, 1, n)
        a[i] = pos[i] + pos[i] - a[i - 1];
 
    return a;
}

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