oj.uz

답안 #96864

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96864 2019-02-12T14:12:54 Z Kastanda CEOI16_icc (CEOI16_icc) C++11
90 / 100
 160 ms 632 KB 
// I do it for the glory
#include<bits/stdc++.h>
#include "icc.h"
#define pb push_back
using namespace std;
//mt19937 Rnd(chrono::steady_clock::now().time_since_epoch().count());
int fe, se;
void GoForIt(vector < int > L, vector < int > R)
{
    int cnt = 0;
    while (L.size() > 1)
    {
        vector < int > L1, L2;
        for (int i = 0; i < (int)L.size(); i++)
        {
            if (i < ((int)L.size() >> 1))
                L1.pb(L[i]);
            else
                L2.pb(L[i]);
        }
        cnt ++;
        bool w = query(L1.size(), R.size(), L1.data(), R.data());
        if (w) L = L1;
        else L = L2;
    }
    while (R.size() > 1)
    {
        vector < int > R1, R2;
        for (int i = 0; i < (int)R.size(); i++)
        {
            if (i < ((int)R.size() >> 1))
                R1.pb(R[i]);
            else
                R2.pb(R[i]);
        }
        cnt ++;
        bool w = query(L.size(), R1.size(), L.data(), R1.data());
        if (w) R = R1;
        else R = R2;
    }
    assert(cnt <= 13);
    fe = L[0];
    se = R[0];
    return ;
}
void run(int N)
{
    int P[N + 1];
    set < int > S;
    vector < int > A[N + 1];
    for (int i = 1; i <= N; i++)
        A[i].pb(i), P[i] = i, S.insert(i);
    for (int q = 1; q <= N - 1; q ++)
    {
        vector < int > L, R, perm(7, 0);
        //iota(perm.begin(), perm.end(), 0);
        //auto it = perm.begin(); it ++;
        //shuffle(it, perm.end(), Rnd);
        for (int bit = 0; bit <= 7; bit ++)
        {
            L.clear(); R.clear();
            int id = 0;
            for (int i : S)
            {
                id ++;
                bool w = (id & (1 << bit)) ? (1) : (0);
                for (int v : A[i])
                {
                    if (w) L.pb(v);
                    else R.pb(v);
                }
            }
            if (!L.size() || !R.size())
                continue; // What are the odds of that ?
            if (query(L.size(), R.size(), L.data(), R.data()))
                break;
        }
        GoForIt(L, R);
        setRoad(fe, se);
        int v = se, u = fe;
        int pu = P[u];
        for (int w : A[pu])
            P[w] = P[v], A[P[v]].pb(w);
        A[pu].clear(); S.erase(pu);
    }
    return ;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 512 KB Ok! 94 queries used.
2 Correct 9 ms 512 KB Ok! 105 queries used.

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 512 KB Ok! 550 queries used.
2 Correct 46 ms 512 KB Ok! 692 queries used.
3 Correct 53 ms 484 KB Ok! 679 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 143 ms 572 KB Ok! 1421 queries used.
2 Correct 150 ms 564 KB Ok! 1680 queries used.
3 Correct 136 ms 512 KB Ok! 1615 queries used.
4 Correct 133 ms 632 KB Ok! 1545 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 512 KB Ok! 1470 queries used.
2 Correct 120 ms 604 KB Ok! 1468 queries used.
3 Correct 139 ms 604 KB Ok! 1640 queries used.
4 Correct 158 ms 512 KB Ok! 1523 queries used.

Subtask #5
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 158 ms 576 KB Ok! 1625 queries used.
2 Correct 146 ms 512 KB Ok! 1611 queries used.
3 Correct 157 ms 512 KB Ok! 1640 queries used.
4 Correct 148 ms 512 KB Ok! 1629 queries used.
5 Correct 137 ms 568 KB Ok! 1514 queries used.
6 Correct 144 ms 512 KB Ok! 1555 queries used.

Subtask #6
0 / 10.0

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