oj.uz

답안 #1083806

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1083806 2024-09-04T07:49:04 Z alexdumitru CEOI16_icc (CEOI16_icc) C++14
61 / 100
 133 ms 640 KB 
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

const int NMAX = 100;

mt19937 mt(1725435865);

int A[NMAX], B[NMAX];
int cnt1, cnt2;
int cmp[NMAX + 1];
vector<vector<int>> comp;

void run(int n) {
    comp.resize(n);
    for (int i = 0; i < n; i++)
        comp[i].push_back(i + 1);
    int nrc = n;
    for (int step = 1; step < n; step++) {
        vector<int> perm(nrc);
        iota(perm.begin(), perm.end(), 0);

        bool diffHalfs = false;
        while (!diffHalfs) {
            shuffle(perm.begin(), perm.end(), mt);
            cnt1 = cnt2 = 0;
            for (int i = 0; i < nrc / 2; i++) {
                for (int node : comp[perm[i]]) {
                    cmp[node] = perm[i];
                    A[cnt1++] = node;
                }
            }
            for (int i = nrc / 2; i < nrc; i++) {
                for (int node : comp[perm[i]]) {
                    cmp[node] = perm[i];
                    B[cnt2++] = node;
                }
            }
            diffHalfs = query(cnt1, cnt2, A, B);
        }

        int pos1, pos2;
        pos1 = cnt1 - 1;
        pos2 = cnt2 - 1;

        int st = 0;
        int dr = cnt1 - 2;
        while (st <= dr) {
            int mij = (st + dr) / 2;
            if (query(mij + 1, cnt2, A, B)) {
                pos1 = mij;
                dr = mij - 1;
            } else {
                st = mij + 1;
            }
        }

        st = 0;
        dr = cnt2 - 2;
        while (st <= dr) {
            int mij = (st + dr) / 2;
            if (query(cnt1, mij + 1, A, B)) {
                pos2 = mij;
                dr = mij - 1;
            } else {
                st = mij + 1;
            }
        }

        setRoad(A[pos1], B[pos2]);

        pos1 = cmp[A[pos1]];
        pos2 = cmp[B[pos2]];
        if (pos1 > pos2) swap(pos1, pos2);

        for (int node : comp[pos2])
            comp[pos1].push_back(node);
        for (int i = pos2; i + 1 < nrc; i++)
            comp[i] = comp[i + 1];

        nrc--;
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 600 KB Ok! 103 queries used.
2 Correct 5 ms 640 KB Ok! 103 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 604 KB Ok! 556 queries used.
2 Correct 38 ms 604 KB Ok! 833 queries used.
3 Correct 35 ms 600 KB Ok! 782 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 604 KB Ok! 1561 queries used.
2 Correct 126 ms 636 KB Ok! 2162 queries used.
3 Correct 103 ms 604 KB Ok! 1735 queries used.
4 Correct 108 ms 600 KB Ok! 1718 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 640 KB Ok! 1686 queries used.
2 Correct 97 ms 600 KB Ok! 1656 queries used.
3 Correct 114 ms 604 KB Ok! 1832 queries used.
4 Correct 133 ms 600 KB Ok! 1616 queries used.

Subtask #5
0 / 29.0

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

Subtask #6
0 / 10.0

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