oj.uz

Submission #1112705

# Submission time Handle Problem Language Result Execution time Memory
1112705 2024-11-14T15:56:08 Z Ghulam_Junaid ICC (CEOI16_icc) C++17
100 / 100
 102 ms 760 KB 
#include <bits/stdc++.h>
#include "icc.h"
// #include "grader.cpp"
using namespace std;

#define all(vv) vv.begin(), vv.end() 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 105;
int n, par[N];
vector<int> S[N];

int root(int v){
    return (par[v] == -1 ? v : par[v] = root(par[v]));
}

void merge(int u, int v){
    if ((u = root(u)) == (v = root(v)))
        return ;

    if (S[u].size() > S[v].size())
        swap(u, v);

    for (int x : S[u]){
        par[x] = v;
        S[v].push_back(x);
    }
    S[u].clear();
}

void run(int nn){
    srand(time(0));

    n = nn;
    for (int i = 1; i <= n; i ++)
        par[i] = -1, S[i] = {i};

    for (int edge = 0; edge < n - 1; edge ++){
        vector<int> roots[2], vec[2];
        set<int> st;
        for (int v = 1; v <= n; v ++)
            st.insert(root(v));
        
        vector<int> all_roots;
        for (int v : st)
            all_roots.push_back(v);

        for (int j : {0, 1})
            roots[j].clear(), vec[j].clear();
        shuffle(all_roots.begin(), all_roots.end(), rng);

        bool mark[n + 5] = {};
        vector<int> sizes = {(int)all_roots.size()};
        while (1){
            for (int j : {0, 1})
                roots[j].clear(), vec[j].clear();
            
            vector<int> new_sizes;
            int i = 0;
            for (int x : sizes){
                if (x == 1){
                    new_sizes.push_back(1);
                    mark[all_roots[i]] = 1;
                    for (int j = i; j < i + 1; j ++)
                        roots[0].push_back(all_roots[j]);
                    i += x;
                }
                else{
                    new_sizes.push_back(x / 2);
                    new_sizes.push_back(x - x / 2);

                    for (int j = i; j < i + x / 2; j ++)
                        roots[0].push_back(all_roots[j]);
                    i += x / 2;

                    for (int j = i; j < i + new_sizes.back(); j ++)
                        roots[1].push_back(all_roots[j]);
                    i += new_sizes.back();
                }
            }
            sizes = new_sizes;

            for (int j : {0, 1}){
                for (int x : roots[j]){
                    if (mark[x]) continue;
                    for (int v : S[x]){
                        vec[j].push_back(v);
                    }
                }
            }

            if (*max_element(all(new_sizes)) == 1)
                break;

            int a[(int)vec[0].size()], b[(int)vec[1].size()];
            copy(all(vec[0]), a), copy(all(vec[1]), b);

            int res = query((int)vec[0].size(), (int)vec[1].size(), a, b);
            if (res) break;
        }

        vector<int> tmp[2] = {vec[0], vec[1]};
        for (int j : {0, 1}){
            int l = -1;
            int r = vec[j].size() - 1;

            while (r - l > 1){
                int mid = (l + r) / 2;

                tmp[j].clear();
                for (int i = 0; i <= mid; i ++)
                    tmp[j].push_back(vec[j][i]);

                int a[(int)tmp[0].size()], b[(int)tmp[1].size()];
                copy(all(tmp[0]), a), copy(all(tmp[1]), b);
                int res = query((int)tmp[0].size(), (int)tmp[1].size(), a, b);
                
                if (res)
                    r = mid;
                else
                    l = mid;

                tmp[j].clear();
                for (int i = l + 1; i <= r; i ++)
                    tmp[j].push_back(vec[j][i]);
            }
            vec[j] = tmp[j];
        }

        setRoad(vec[0][0], vec[1][0]);
        merge(vec[0][0], vec[1][0]);
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 592 KB Ok! 99 queries used.
2 Correct 5 ms 592 KB Ok! 97 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 592 KB Ok! 542 queries used.
2 Correct 29 ms 648 KB Ok! 606 queries used.
3 Correct 29 ms 640 KB Ok! 605 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 592 KB Ok! 1452 queries used.
2 Correct 89 ms 652 KB Ok! 1467 queries used.
3 Correct 100 ms 652 KB Ok! 1460 queries used.
4 Correct 91 ms 592 KB Ok! 1552 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 648 KB Ok! 1465 queries used.
2 Correct 100 ms 640 KB Ok! 1506 queries used.
3 Correct 92 ms 592 KB Ok! 1522 queries used.
4 Correct 97 ms 592 KB Ok! 1452 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 760 KB Ok! 1524 queries used.
2 Correct 94 ms 592 KB Ok! 1541 queries used.
3 Correct 102 ms 652 KB Ok! 1574 queries used.
4 Correct 92 ms 760 KB Ok! 1555 queries used.
5 Correct 102 ms 592 KB Ok! 1506 queries used.
6 Correct 98 ms 640 KB Ok! 1630 queries used.

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 592 KB Ok! 1557 queries used.
2 Correct 88 ms 644 KB Ok! 1484 queries used.