oj.uz

답안 #605534

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
605534 2022-07-25T18:44:01 Z Vanilla CEOI16_icc (CEOI16_icc) C++17
90 / 100
 138 ms 620 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 102;
int dsu [maxn];
vector <int> el [maxn];
 
int dad (int x) {
    return dsu[x] = (x == dsu[x] ? x: dad(dsu[x]));
}
 
void merge (int x, int y){
    x = dad(x), y = dad(y);
    if (x != y) {
        // if (el[x].size() < el[y].size()) swap(x, y);
        for (int j: el[y]) el[x].push_back(j);
        el[y].clear();
        dsu[y] = x;
    }
}
 
int qq (vector <int> a, vector <int> b) {
    return query(a.size(), b.size(), a.data(), b.data());
}
 
void run(int n) {
    srand(time(NULL));
    for (int i = 1; i <= n; i++) {
        dsu[i] = i;
        el[i].push_back(i);
    }
    for (int p = 0; p < n - 1; p++){
        set <int> s;
        vector <int> comp;
        for (int j = 1; j <= n; j++) s.insert(dad(j));
        for (int k: s) comp.push_back(k);
        int m = comp.size();
        // shuffle (bt.begin(), bt.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count()));
        vector <int> a,b;
        for (int i = 0; i < 8; i++){
            vector <int> v1, v2;
            for (int j = 0; j < m; j++){
                if (j & (1 << i)) for (int l: el[comp[j]]) v1.push_back(l);
                else for (int l: el[comp[j]]) v2.push_back(l);
            }
            if (qq(v1, v2)) {
                a = v1, b = v2;
                break;
            }
        }
        int l = 0, r = a.size(), rs1 = -1, rs2 = -1;
        if (rand() % 2)sort(a.begin(), a.end());
        if (rand() % 2)sort(b.begin(), b.end());
        if (rand() % 2)reverse(a.begin(), a.end());
        if (rand() % 2)reverse(b.begin(), b.end());
        if (rand() % 2)shuffle (a.begin(), a.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count()));
        if (rand() % 2)shuffle (b.begin(), b.end(), std::default_random_engine(std::chrono::system_clock::now().time_since_epoch().count()));
        while (l < r) {
            int mid = (l + r) / 2;
            vector <int> v;
            for (int i = 0; i <= mid; i++) v.push_back(a[i]);
            if (qq(v, b)) {
                rs1 = v.back();
                r = mid;
            }
            else {
                l = mid + 1;
            }
        }
        l = 0, r = b.size();
        while (l < r) {
            int mid = (l + r) / 2;
            vector <int> v;
            for (int i = 0; i <= mid; i++) v.push_back(b[i]);
            if (qq(v, a)) {
                rs2 = v.back();
                r = mid;
            }
            else {
                l = mid + 1;
            }
        }
        merge(rs1, rs2);
        setRoad(rs1, rs2);
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Ok! 108 queries used.
2 Correct 5 ms 468 KB Ok! 109 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 500 KB Ok! 517 queries used.
2 Correct 38 ms 484 KB Ok! 684 queries used.
3 Correct 34 ms 468 KB Ok! 675 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 104 ms 504 KB Ok! 1423 queries used.
2 Correct 133 ms 504 KB Ok! 1681 queries used.
3 Correct 132 ms 504 KB Ok! 1547 queries used.
4 Correct 116 ms 496 KB Ok! 1511 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 500 KB Ok! 1514 queries used.
2 Correct 123 ms 492 KB Ok! 1497 queries used.
3 Correct 138 ms 620 KB Ok! 1647 queries used.
4 Correct 103 ms 500 KB Ok! 1445 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 120 ms 500 KB Ok! 1671 queries used.
2 Correct 123 ms 492 KB Ok! 1661 queries used.
3 Correct 131 ms 492 KB Ok! 1650 queries used.
4 Correct 117 ms 508 KB Ok! 1636 queries used.
5 Correct 103 ms 504 KB Ok! 1462 queries used.
6 Correct 117 ms 492 KB Ok! 1562 queries used.

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 129 ms 620 KB Too many queries! 1655 out of 1625
2 Halted 0 ms 0 KB -