oj.uz

답안 #605474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
605474 2022-07-25T18:12:02 Z Vanilla CEOI16_icc (CEOI16_icc) C++17
83 / 100
 136 ms 1240 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;
    }
}

map <pair <vector <int> ,vector <int> >, int > mp;
 
int qq (vector <int> a, vector <int> b) {
    if (mp.count({a, b})) return mp[{a,b}];
    return mp[{a, b}] = query(a.size(), b.size(), a.data(), b.data());
}
 
void run(int n) {
    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();
        vector <int> a,b;
        for (int i = 0; i <= 7; 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() - 1, rs1 = -1, rs2 = -1;
        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 - 1;
            }
            else {
                l = mid + 1;
            }
        }
        l = 0, r = b.size() - 1;
        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 - 1;
            }
            else {
                l = mid + 1;
            }
        }
        merge(rs1, rs2);
        setRoad(rs1, rs2);
    }
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 500 KB Ok! 99 queries used.
2 Incorrect 4 ms 508 KB Wrong road!
3 Halted 0 ms 0 KB -

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 572 KB Ok! 545 queries used.
2 Correct 41 ms 672 KB Ok! 676 queries used.
3 Correct 33 ms 580 KB Ok! 659 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 1216 KB Ok! 1479 queries used.
2 Correct 113 ms 1168 KB Ok! 1618 queries used.
3 Correct 131 ms 1188 KB Ok! 1670 queries used.
4 Correct 109 ms 1100 KB Ok! 1549 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 1080 KB Ok! 1502 queries used.
2 Correct 113 ms 1168 KB Ok! 1578 queries used.
3 Correct 114 ms 1152 KB Ok! 1642 queries used.
4 Correct 107 ms 1112 KB Ok! 1559 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 1228 KB Ok! 1635 queries used.
2 Correct 116 ms 1228 KB Ok! 1618 queries used.
3 Correct 113 ms 1228 KB Ok! 1643 queries used.
4 Correct 117 ms 1232 KB Ok! 1658 queries used.
5 Correct 107 ms 1100 KB Ok! 1494 queries used.
6 Correct 136 ms 1136 KB Ok! 1567 queries used.

Subtask #6
0 / 10.0

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