oj.uz

답안 #754927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754927 2023-06-08T22:19:11 Z MilosMilutinovic CEOI16_icc (CEOI16_icc) C++14
100 / 100
 151 ms 608 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 101;
int n, fa[N];
int gfa(int x) { return fa[x] == x ? x : fa[x] = gfa(fa[x]); }
//void setRoad(int x, int y) {
//    printf("new Road %d %d\n", x, y);
//}
bool query(vector<int> x, vector<int> y) {
    int sz_x = x.size();
    int sz_y = y.size();
    int qx[sz_x], qy[sz_y];
    for (int i = 0; i < sz_x; i++)
        qx[i] = x[i];
    for (int i = 0; i < sz_y; i++)
        qy[i] = y[i];
    return query(sz_x, sz_y, qx, qy);
//    printf("query\n");
//    for (int i : x) printf("%d ", i); printf("\n");
//    for (int i : y) printf("%d ", i); printf("\n");
//    int f;
//    scanf("%d", &f);
//    return f;
}
void add(vector<int>& v, int comp) {
    for (int i = 1; i <= n; i++)
        if (gfa(i) == gfa(comp))
            v.push_back(i);
}
pair<int, int> find_road(vector<int> a, vector<int> b) {
    pair<int, int> res;
    int low = 0, high = a.size() - 1;
    while (low < high) {
        int mid = (low + high - 1) / 2;
        vector<int> q_vec;
        for (int i = 0; i <= mid; i++)
            q_vec.push_back(a[i]);
        if (query(q_vec, b))
            high = mid;
        else
            low = mid + 1;
    }
    res.first = a[high];
    low = 0, high = b.size() - 1;
    while (low < high) {
        int mid = (low + high - 1) / 2;
        vector<int> q_vec;
        for (int i = 0; i <= mid; i++)
            q_vec.push_back(b[i]);
        if (query(q_vec, a))
            high = mid;
        else
            low = mid + 1;
    }
    res.second = b[high];
    return res;
}
void run(int n) {
    ::n = n;
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int iter = 1; iter <= n - 1; iter++) {
        vector<int> v;
        for (int i = 1; i <= n; i++)
            if (gfa(i) == i)
                v.push_back(i);
        int sz = (int) v.size(), lg = 0;
        while ((1 << lg) < sz) lg++;
        int xr = 0;
        for (int b = 0; b < lg; b++) {
            vector<int> l, r;
            for (int i = 0; i < sz; i++) {
                if (i >> b & 1) {
                    add(l, v[i]);
                } else {
                    add(r, v[i]);
                }
            }
            if (query(l, r))
                xr ^= (1 << b);
        }
        int f = -1;
        for (int b = 0; b < lg; b++)
            if (xr >> b & 1)
                f = b;
        if (f == -1) while (true) {}
        int a = 0, b = 0;
        for (int i = 0; i < lg; i++) {
            if (xr >> i & 1) {
                if (i == f) {
                    a += (1 << i);
                    continue;
                }
                vector<int> l, r;
                for (int j = 0; j < sz; j++) {
                    if (j >> f & 1) {
                        if (j >> i & 1) add(l, v[j]);
                    } else {
                        if (!(j >> i & 1)) add(r, v[j]);
                    }
                }
                if (query(l, r))
                    a += (1 << i);
                else
                    b += (1 << i);
            } else {
                vector<int> l, r;
                for (int j = 0; j < sz; j++) {
                    if (j >> i & 1) continue;
                    if (j >> f & 1)
                        add(l, v[j]);
                    else
                        add(r, v[j]);
                }
                if (!query(l, r))
                    a += (1 << i), b += (1 << i);
            }
        }
        vector<int> l, r;
        for (int i = 1; i <= n; i++) {
            if (gfa(i) == v[a])
                l.push_back(i);
            if (gfa(i) == v[b])
                r.push_back(i);
        }
        pair<int, int> p = find_road(l, r);
        setRoad(p.first, p.second);
        fa[gfa(p.first)] = gfa(p.second);
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 496 KB Ok! 117 queries used.
2 Correct 8 ms 492 KB Ok! 116 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 468 KB Ok! 650 queries used.
2 Correct 34 ms 496 KB Ok! 600 queries used.
3 Correct 41 ms 476 KB Ok! 656 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 500 KB Ok! 1607 queries used.
2 Correct 123 ms 492 KB Ok! 1395 queries used.
3 Correct 151 ms 496 KB Ok! 1613 queries used.
4 Correct 139 ms 496 KB Ok! 1606 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 496 KB Ok! 1601 queries used.
2 Correct 139 ms 480 KB Ok! 1599 queries used.
3 Correct 127 ms 608 KB Ok! 1613 queries used.
4 Correct 140 ms 496 KB Ok! 1606 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 131 ms 480 KB Ok! 1581 queries used.
2 Correct 131 ms 496 KB Ok! 1613 queries used.
3 Correct 144 ms 488 KB Ok! 1549 queries used.
4 Correct 131 ms 476 KB Ok! 1613 queries used.
5 Correct 133 ms 504 KB Ok! 1606 queries used.
6 Correct 142 ms 484 KB Ok! 1611 queries used.

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 130 ms 496 KB Ok! 1613 queries used.
2 Correct 131 ms 500 KB Ok! 1613 queries used.