oj.uz

Submission #1083794

# Submission time Handle Problem Language Result Execution time Memory
1083794 2024-09-04T07:23:07 Z alexdumitru ICC (CEOI16_icc) C++17
61 / 100
 125 ms 640 KB 
#include <bits/stdc++.h>
#include "icc.h"
 
using namespace std;
 
const int NMAX = 100;
 
mt19937 mt(time(0));
 
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;
 
        int st = 0;
        int dr = cnt1 - 1;
        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 - 1;
        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--;
    }
}

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:69:16: warning: 'pos2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   69 |         setRoad(A[pos1], B[pos2]);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~
icc.cpp:69:16: warning: 'pos1' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 604 KB Ok! 109 queries used.
2 Correct 5 ms 636 KB Ok! 105 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 640 KB Ok! 536 queries used.
2 Correct 40 ms 600 KB Ok! 880 queries used.
3 Correct 38 ms 604 KB Ok! 809 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 604 KB Ok! 1556 queries used.
2 Correct 125 ms 604 KB Ok! 2146 queries used.
3 Correct 100 ms 640 KB Ok! 1736 queries used.
4 Correct 103 ms 628 KB Ok! 1702 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 600 KB Ok! 1638 queries used.
2 Correct 93 ms 628 KB Ok! 1605 queries used.
3 Correct 119 ms 624 KB Ok! 1856 queries used.
4 Correct 113 ms 604 KB Ok! 1640 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 110 ms 604 KB Too many queries! 1895 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 110 ms 612 KB Too many queries! 1884 out of 1625
2 Halted 0 ms 0 KB -