oj.uz

답안 #166912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
166912 2019-12-04T14:23:50 Z luciocf CEOI16_icc (CEOI16_icc) C++14
90 / 100
 170 ms 724 KB 
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

const int maxn = 110;

int pai[maxn], peso[maxn];
int A[maxn], B[maxn];

vector<int> comp[maxn];

void init(int n)
{
    for (int i = 1; i <= n; i++)
    {
        pai[i] = i, peso[i] = 1;
        comp[i].push_back(i);
    }
}

int Find(int x)
{
    if (pai[x] == x) return x;
    return pai[x] = Find(pai[x]);
}

void Join(int x, int y)
{
    x = Find(x), y = Find(y);
    if (x == y) return;

    if (__builtin_clz(x) > __builtin_clz(y)) swap(x, y);
    if (__builtin_clz(x) > __builtin_clz(y))
    {
        int toss = rand()%2;
        if (toss) swap(x, y);
    }

    pai[y] = x, peso[x] += peso[y];

    for (auto v: comp[y])
        comp[x].push_back(v);
}

void run(int n)
{
    init(n);
    
    for (int e = 1; e < n; e++)
    {
        int qwerty = 0;

        for (int i = 1; i <= n; i++)
        {
            if (Find(i) == i)
            {
                for (int j = 0; j < 7; j++)
                    if (i&(1<<j))
                        qwerty = max(qwerty,j);
            }
        }
        
        for (int b = 0; b <= qwerty; b++)
        {
            int sz_a = -1, sz_b = -1;

            for (int i = 1; i <= n; i++)
            {
                if (Find(i) == i)
                {
                    if (i&(1<<b))
                    {
                        for (auto v: comp[i])
                            A[++sz_a] = v;
                    }
                    else
                    {
                        for (auto v: comp[i])
                            B[++sz_b] = v;
                    }
                }
            }

            if (b < qwerty && !query(sz_a+1, sz_b+1, A, B)) continue;

            int ini = 0, fim = sz_a, ans = -1;

            while (ini <= fim)
            {
                int mid = (ini+fim)>>1;

                if (query(mid+1, sz_b+1, A, B)) ans = mid, fim = mid-1;
                else ini = mid+1;
            }

            ini = 0, fim = sz_b;
            int ans2 = -1;

            while (ini <= fim)
            {
                int mid = (ini+fim)>>1;
                
                if (query(ans+1, mid+1, A, B)) ans2 = mid, fim = mid-1;
                else ini = mid+1;
            }

            setRoad(A[ans], B[ans2]);
            Join(A[ans], B[ans2]);

            break;
        }
    }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 504 KB Ok! 112 queries used.
2 Correct 9 ms 504 KB Ok! 109 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 504 KB Ok! 559 queries used.
2 Correct 52 ms 504 KB Ok! 678 queries used.
3 Correct 53 ms 564 KB Ok! 674 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 572 KB Ok! 1375 queries used.
2 Correct 169 ms 504 KB Ok! 1654 queries used.
3 Correct 140 ms 576 KB Ok! 1367 queries used.
4 Correct 159 ms 504 KB Ok! 1524 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 504 KB Ok! 1421 queries used.
2 Correct 147 ms 504 KB Ok! 1464 queries used.
3 Correct 167 ms 504 KB Ok! 1621 queries used.
4 Correct 142 ms 636 KB Ok! 1415 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 166 ms 632 KB Ok! 1633 queries used.
2 Correct 165 ms 504 KB Ok! 1619 queries used.
3 Correct 170 ms 608 KB Ok! 1635 queries used.
4 Correct 160 ms 724 KB Ok! 1576 queries used.
5 Correct 146 ms 632 KB Ok! 1468 queries used.
6 Correct 156 ms 564 KB Ok! 1568 queries used.

Subtask #6
0 / 10.0

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