oj.uz

Submission #754920

# Submission time Handle Problem Language Result Execution time Memory
754920 2023-06-08T22:09:58 Z MilosMilutinovic ICC (CEOI16_icc) C++14
0 / 100
 252 ms 476 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 101;
int n, fa[N];
int gfa(int x) { return fa[x] == x ? x : fa[x] = gfa(fa[x]); }
bool query(vector<int> x, vector<int> y) {
    int sz_x = x.size();
    int sz_y = y.size();
    int qx[sz_x], qy[sz_y];
    for (int i = 0; i < sz_x; i++)
        qx[i] = x[i];
    for (int i = 0; i < sz_y; i++)
        qy[i] = y[i];
    return query(sz_x, sz_y, qx, qy);
//    printf("query\n");
//    for (int i : x) printf("%d ", i); printf("\n");
//    for (int i : y) printf("%d ", i); printf("\n");
//    int f;
//    scanf("%d", &f);
//    return f;
}
void add(vector<int>& v, int comp) {
    for (int i = 1; i <= n; i++)
        if (gfa(i) == gfa(comp))
            v.push_back(i);
}
void run(int n) {
    ::n = n;
    for (int i = 1; i <= n; i++) fa[i] = i;
    for (int iter = 1; iter <= n - 1; iter++) {
        vector<int> v;
        for (int i = 1; i <= n; i++)
            if (gfa(i) == i)
                v.push_back(i);
        int sz = (int) v.size(), lg = 0;
        while ((1 << lg) <= sz) lg++;
        int xr = 0;
        for (int b = 0; b < lg; b++) {
            vector<int> l, r;
            for (int i = 0; i < sz; i++) {
                if (i >> b & 1) {
                    add(l, v[i]);
                } else {
                    add(r, v[i]);
                }
            }
            if (query(l, r))
                xr ^= (1 << b);
        }
        int f = -1;
        for (int b = 0; b < lg; b++)
            if (xr >> b & 1)
                f = b;
        if (f == -1) while (true) {}
        int a = 0, b = 0;
        for (int i = 0; i < lg; i++) {
            if (xr >> i & 1) {
                vector<int> l, r;
                for (int j = 0; j < sz; j++) {
                    if (j >> f & 1) {
                        add(l, v[j]);
                    } else {
                        add(r, v[j]);
                    }
                }
                if (query(l, r))
                    a += (1 << i);
                else
                    b += (1 << i);
            } else {
                vector<int> l, r;
                for (int j = 0; j < sz; j++) {
                    if (j >> i & 1) continue;
                    if (j >> f & 1)
                        add(l, v[j]);
                    else
                        add(r, v[j]);
                }
                if (!query(l, r))
                    a += (1 << i), b += (1 << i);
            }
        }
        vector<int> l, r;
        for (int i = 1; i <= n; i++) {
            //if (gfa(i) == v[a])
                l.push_back(i);
            //if (gfa(i) == v[b])
                r.push_back(i);
        }
        int p = -1, q = -1;
        for (int x : l)
            for (int y : r)
                if (gfa(x) != gfa(y) && query({x}, {y}))
                    p = x, q = y;
        assert(p != -1);
        setRoad(p, q);
        fa[gfa(p)] = gfa(q);
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 100 ms 476 KB Too many queries! 2126 out of 1500
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 252 ms 476 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 246 ms 472 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 190 ms 468 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 194 ms 476 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 476 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -