Submission #597438

#	Time	Username	Problem	Language	Result	Execution time	Memory
597438		1bin	ICC (CEOI16_icc)	C++14	0 / 100	1 ms	468 KiB

icc

#include <bits/stdc++.h>
#include <icc.h>

using namespace std;

typedef long long ll;
#define all(v) v.begin(), v.end()
const int NMAX = 105;
int par[NMAX], a[NMAX], b[NMAX], sza, szb;
int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
vector<int> v[NMAX];

void run(int n){
    memset(par, -1, sizeof(par));
    for(int i = 1; i <= n; i++) v[i].emplace_back(i);
    int sz = n;
    for(int i = 0; i < n - 1; i++, sz--){
        vector<int> arr;
        for(int i = 1; i <= n; i++)
            if(par[i] == -1) arr.emplace_back(i);
        for(int bit = 0; 1 << bit < sz; bit++){
            for(int j = 0; j < sz; j++){
                if(j & (1 << bit)) {
                    for(auto& x : v[j]) a[sza++] = x;
                }
                else{
                    for(auto& x : v[j]) b[szb++] = x;
                }
            }
            if(query(sza, szb, a, b)){
                int l = 0, r = sza - 1, m, x, y;
                while(l < r){
                    m = (l + r) >> 1;
                    if(query(m - l + 1, szb, a + l, b)) r = m;
                    else l = m + 1;
                }
                x = l;
                l = 0; r = szb - 1;
                while(l < r){
                    m = (l + r) >> 1;
                    if(query(sza, m - l + 1, a, b + l)) r = m;
                    else l = m + 1;
                }
                y = l;
                setRoad(x, y);
                break;
            }
        }
    }
    return;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10