oj.uz

Submission #597469

# Submission time Handle Problem Language Result Execution time Memory
597469 2022-07-16T04:54:48 Z 1bin ICC (CEOI16_icc) C++14
90 / 100
 137 ms 508 KB 
#include <bits/stdc++.h>
#include "icc.h"
#include <cassert>
 
using namespace std;
 
typedef long long ll;
#define all(v) v.begin(), v.end()
const int NMAX = 105;
int par[NMAX], a[NMAX], b[NMAX], sza, szb;
int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
vector<int> v[NMAX];
 
void run(int n){
    memset(par, -1, sizeof(par));
    for(int i = 1; i <= n; i++) v[i].emplace_back(i);
    int sz = n;
    
    for(int i = 0; i < n - 1; i++, sz--){
        vector<int> arr;
        for(int i = 1; i <= n; i++)
            if(par[i] == -1) arr.emplace_back(i);
            
        for(int bit = 0; (1 << bit) < sz; bit++){
            sza = szb = 0;    
            for(int j = 0; j < sz; j++){
                if(j & (1 << bit)) {
                    for(auto x : v[arr[j]]) a[sza++] = x;
                }
                else{
                    for(auto x : v[arr[j]]) b[szb++] = x;
                }
            }
            
            if(query(sza, szb, a, b)){
                int l = 0, r = sza - 1, m, x, y;
                while(l < r){
                    m = (l + r) >> 1;
                    if(query(m + 1, szb, a, b)) r = m;
                    else l = m + 1;
                }
                x = a[l];
                l = 0; r = szb - 1;
                while(l < r){
                    m = (l + r) >> 1;
                    if(query(sza, m + 1, a, b)) r = m;
                    else l = m + 1;
                }
                y = b[l];
                
                setRoad(x, y);
                x = find(x); y = find(y);
                if(v[x].size() < v[y].size()) swap(x, y);
                for(int t : v[y]) v[x].emplace_back(t);
                par[y] = x;
                break;
            }
            assert(1 << (bit + 1) < sz);
        }
    }
    return;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Ok! 99 queries used.
2 Correct 5 ms 468 KB Ok! 98 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 468 KB Ok! 535 queries used.
2 Correct 36 ms 468 KB Ok! 659 queries used.
3 Correct 32 ms 468 KB Ok! 658 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 500 KB Ok! 1424 queries used.
2 Correct 106 ms 468 KB Ok! 1612 queries used.
3 Correct 109 ms 468 KB Ok! 1655 queries used.
4 Correct 108 ms 484 KB Ok! 1504 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 484 KB Ok! 1596 queries used.
2 Correct 111 ms 508 KB Ok! 1472 queries used.
3 Correct 109 ms 496 KB Ok! 1636 queries used.
4 Correct 109 ms 496 KB Ok! 1519 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 476 KB Ok! 1629 queries used.
2 Correct 107 ms 488 KB Ok! 1611 queries used.
3 Correct 108 ms 468 KB Ok! 1646 queries used.
4 Correct 137 ms 492 KB Ok! 1653 queries used.
5 Correct 103 ms 468 KB Ok! 1486 queries used.
6 Correct 110 ms 500 KB Ok! 1555 queries used.

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 123 ms 484 KB Too many queries! 1635 out of 1625
2 Halted 0 ms 0 KB -