oj.uz

답안 #1028152

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1028152 2024-07-19T14:36:22 Z serifefedartar CEOI16_icc (CEOI16_icc) C++17
61 / 100
 131 ms 760 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define LOGN 20
const ll MOD = 1e9 + 7;
const ll MAXN = 105;

int par[MAXN], sz[MAXN], temp1[MAXN], temp2[MAXN];
int find(int node) {
    if (node == par[node])
        return node;
    return par[node] = find(par[node]);
}

void unite(int a, int b) {
    a = find(a);
    b = find(b);
    if (a == b)
        return ;
    if (sz[b] > sz[a])
        swap(a, b);
    sz[a] += sz[b];
    par[b] = a;
}

int qry(int sz1, int sz2, vector<int> A, vector<int> B) {
    for (int i = 0; i < sz1; i++)
        temp1[i] = A[i];
    for (int i = 0; i < sz2; i++)
        temp2[i] = B[i];
    return query(sz1, sz2, temp1, temp2);
}

void match(vector<vector<int>> arr) {
    while (true) {
        random_shuffle(arr.begin(), arr.end());

        vector<int> A, B;
        for (int i = 0; i < arr.size() / 2; i++) {
            for (auto u : arr[i])
                A.push_back(u);
        }
        for (int i = arr.size() / 2; i < arr.size(); i++) {
            for (auto u : arr[i])
                B.push_back(u);
        }

        if (qry(A.size(), B.size(), A, B)) {

            while ((int)B.size() > 1) {
                vector<int> X, Y;
                for (int i = 0; i < (int)B.size() / 2; i++)
                    X.push_back(B[i]);
                for (int i = (int)B.size() / 2; i < (int)B.size(); i++)
                    Y.push_back(B[i]);

                if (qry(A.size(), X.size(), A, X))
                    B = X;
                else
                    B = Y;
            }

            while ((int)A.size() > 1) {
                vector<int> X, Y;
                for (int i = 0; i < (int)A.size() / 2; i++)
                    X.push_back(A[i]);
                for (int i = (int)A.size() / 2; i < (int)A.size(); i++)
                    Y.push_back(A[i]);

                if (qry(X.size(), 1, X, B))
                    A = X;
                else
                    A = Y;
            }

            setRoad(B[0], A[0]);
            unite(B[0], A[0]);

            return ;
        }
    }
}

int n;
void solve() {
    map<int, vector<int>> mp;
    for (int i = 1; i <= n; i++)
        mp[find(i)].push_back(i);

    vector<vector<int>> temp;
    for (auto u : mp)
        temp.push_back(u.s);

    match(temp);
}

void run(int N) {
    n = N;
    for (int i = 1; i <= N; i++)
        sz[i] = 1, par[i] = i;
    for (int i = 1; i < N; i++)
        solve();
}

Compilation message

icc.cpp: In function 'void match(std::vector<std::vector<int> >)':
icc.cpp:44:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |         for (int i = 0; i < arr.size() / 2; i++) {
      |                         ~~^~~~~~~~~~~~~~~~
icc.cpp:48:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for (int i = arr.size() / 2; i < arr.size(); i++) {
      |                                      ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 604 KB Ok! 106 queries used.
2 Correct 4 ms 760 KB Ok! 96 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 604 KB Ok! 553 queries used.
2 Correct 42 ms 648 KB Ok! 865 queries used.
3 Correct 32 ms 652 KB Ok! 832 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 604 KB Ok! 1489 queries used.
2 Correct 99 ms 600 KB Ok! 2179 queries used.
3 Correct 80 ms 600 KB Ok! 1724 queries used.
4 Correct 88 ms 656 KB Ok! 1719 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 600 KB Ok! 1710 queries used.
2 Correct 80 ms 600 KB Ok! 1644 queries used.
3 Correct 89 ms 652 KB Ok! 1833 queries used.
4 Correct 74 ms 600 KB Ok! 1584 queries used.

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 131 ms 652 KB Too many queries! 1892 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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