oj.uz

Submission #605030

# Submission time Handle Problem Language Result Execution time Memory
605030 2022-07-25T12:23:00 Z SlavicG ICC (CEOI16_icc) C++17
90 / 100
 154 ms 504 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

/*
int query(int a, int b, int* aa, int* bb) {

}
*/

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int query(vector<int> a, vector<int> b) {
    int aa[(int)a.size()], bb[(int)b.size()];
    for(int i = 0; i < (int)a.size(); ++i) aa[i] = a[i];
    for(int i = 0; i < (int)b.size(); ++i) bb[i] = b[i];
    return query(a.size(), b.size(), aa, bb);
}
struct dsu {
    vector<int> p;
    dsu(int n) {
        p.resize(n);
        iota(p.begin(), p.end(), 0);
    }
    int get(int a) {return p[a] = (p[a] == a ? a : get(p[a]));}
    void uni(int a, int b) {
        a = get(a);
        b = get(b);
        if(a < b) swap(a, b);
        p[a] = b;
    }
};

void run(int n) {
    dsu d(n + 5);
    for(int times = 0; times < n - 1; ++times) {
        int st = -1;
        vector<int> v;
        for(int i = 1; i <= n; ++i) v.push_back(d.get(i));
        sort(v.begin(), v.end());
        v.erase(unique(v.begin(), v.end()), v.end());
        vector<int> A, B;
        vector<int> bits;
        for(int bit = 0; (1 << bit) < n; ++bit) bits.push_back(bit);
        shuffle(bits.begin(), bits.end(), rng);
        int mn = INT_MAX;
        for(int bit: bits) {
            vector<int> c1, c2;
            for(int i = 1; i <= n; ++i) {
                if((d.get(i) - 1) & (1 << bit)) c1.push_back(i);
                else c2.push_back(i);
            }
            if(c1.empty() || c2.empty()) continue;
            if(query(c1, c2)) {
                if(ceil(log2(c1.size())) + ceil(log2(c2.size())) < mn) {
                    mn = ceil(log2(c1.size())) + ceil(log2(c2.size()));
                    A = c1, B = c2;
                    break;
                }
            }
        }
        assert(A.size() > 0 && B.size() > 0);
        sort(A.begin(), A.end());
        sort(B.begin(), B.end());
        int ansA = -1, ansB = -1;
        int l = 0, r = (int)A.size() - 1;
        while(l <= r) {
            int mid = l + r >> 1;
            vector<int> paiu;
            for(int i = 0; i <= mid; ++i) paiu.push_back(A[i]);
            if(query(paiu, B)) {
                ansA = A[mid];
                r = mid - 1;
            } else l = mid + 1;
        }
        l = 0, r = (int)B.size() - 1;
        while(l <= r) {
            int mid = l + r >> 1;
            vector<int> paiu;
            for(int i = 0; i <= mid; ++i) paiu.push_back(B[i]);
            if(query(paiu, A)) {
                ansB = B[mid];
                r = mid - 1;
            } else l = mid + 1;
        }
        assert(ansA != -1 && ansB != -1);
        d.uni(ansA, ansB);
        setRoad(ansA, ansB);
    }
}

/*
int main() {
    int n; cin >> n;
    run(n);
}
*/

Compilation message

icc.cpp: In function 'void run(int)':
icc.cpp:68:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |             int mid = l + r >> 1;
      |                       ~~^~~
icc.cpp:78:25: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   78 |             int mid = l + r >> 1;
      |                       ~~^~~
icc.cpp:37:13: warning: unused variable 'st' [-Wunused-variable]
   37 |         int st = -1;
      |             ^~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 492 KB Ok! 106 queries used.
2 Correct 6 ms 468 KB Ok! 107 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 488 KB Ok! 549 queries used.
2 Correct 46 ms 492 KB Ok! 717 queries used.
3 Correct 54 ms 484 KB Ok! 699 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 504 KB Ok! 1501 queries used.
2 Correct 146 ms 500 KB Ok! 1770 queries used.
3 Correct 130 ms 492 KB Ok! 1553 queries used.
4 Correct 131 ms 484 KB Ok! 1585 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 492 KB Ok! 1570 queries used.
2 Correct 140 ms 496 KB Ok! 1582 queries used.
3 Correct 124 ms 488 KB Ok! 1575 queries used.
4 Correct 129 ms 504 KB Ok! 1502 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 492 KB Ok! 1635 queries used.
2 Correct 128 ms 500 KB Ok! 1579 queries used.
3 Correct 137 ms 488 KB Ok! 1710 queries used.
4 Correct 128 ms 500 KB Ok! 1646 queries used.
5 Correct 137 ms 492 KB Ok! 1553 queries used.
6 Correct 146 ms 492 KB Ok! 1639 queries used.

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 140 ms 496 KB Too many queries! 1666 out of 1625
2 Halted 0 ms 0 KB -