oj.uz

Submission #1112646

# Submission time Handle Problem Language Result Execution time Memory
1112646 2024-11-14T13:29:14 Z Ghulam_Junaid ICC (CEOI16_icc) C++17
61 / 100
 139 ms 820 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){
    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];
        while (1){
            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();

            for (int x : all_roots){
                int id = rng() % 2;
                roots[id].push_back(x);
                for (int v : S[x])
                    vec[id].push_back(v);
            }
            
            // shuffle(all_roots.begin(), all_roots.end(), rng);
            // for (int i = 0; i < all_roots.size(); i ++){
            //     int id = (i >= all_roots.size() / 2);
            //     roots[id].push_back(all_roots[i]);
            //     for (int v : S[all_roots[i]])
            //         vec[id].push_back(v);
            // }

            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 6 ms 592 KB Ok! 107 queries used.
2 Correct 6 ms 592 KB Ok! 118 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 764 KB Ok! 557 queries used.
2 Correct 39 ms 592 KB Ok! 844 queries used.
3 Correct 38 ms 592 KB Ok! 825 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 121 ms 592 KB Ok! 1501 queries used.
2 Correct 139 ms 648 KB Ok! 2171 queries used.
3 Correct 102 ms 652 KB Ok! 1738 queries used.
4 Correct 106 ms 592 KB Ok! 1776 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 764 KB Ok! 1658 queries used.
2 Correct 98 ms 632 KB Ok! 1660 queries used.
3 Correct 119 ms 592 KB Ok! 1773 queries used.
4 Correct 101 ms 820 KB Ok! 1536 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 116 ms 592 KB Too many queries! 1846 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 592 KB Too many queries! 1925 out of 1625
2 Halted 0 ms 0 KB -