제출 #101263

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
101263		dantoh000	ICC (CEOI16_icc)	C++14	7 / 100	358 ms	632 KiB

icc

#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
vi p, rk, sz;
void init(int n){
    for(int i = 0; i < n; i++){
        p.push_back(i);
        rk.push_back(0);
        sz.push_back(1);
    }
}
int findset(int x){
    return p[x] == x ? x : p[x] = findset(p[x]);
}
bool sameset(int i, int j){
    return findset(i) == findset(j);
}
void unionset(int i, int j){
    int x = findset(i), y = findset(j);
    if (x == y) return;
    if (rk[x] < rk[y]){
        p[x] = y;
        sz[y] += sz[x];
    }
    else{
        p[y] = x;
        sz[x] += sz[y];
        if (rk[x] == rk[y]) rk[x]++;
    }
}
void run(int n) {
    int cur = 0;
    init(n);
    vector<int> random;
    for (int i = 1; i <= n; i++) random.push_back(i);
    random_shuffle(random.begin(),random.end());
    int a[1], b[1];
    while (cur < n){

        for (int i = 0; i < n; i++){
            for (int j = i+1; j < n; j++){
                //printf("%d %d\n",i,j);
                a[0] = random[i], b[0] = random[j];
                //printf("%d ",b[0]);
                if (sameset(a[0]-1,b[0]-1)) continue;
                if (query(1,1,a,b) == 1){
                    setRoad(a[0],b[0]);
                    unionset(a[0]-1,b[0]-1);
                    cur++;
                }
            }
            //printf("done with %d\n",a[0]);
        }
    }
}

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