oj.uz

답안 #96844

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96844 2019-02-12T13:34:51 Z Kastanda CEOI16_icc (CEOI16_icc) C++11
61 / 100
 193 ms 704 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;
bool Rand()
{
    return (Rnd() & 1);
}
void GoForIt(vector < int > L, vector < int > R)
{
    int cnt = 0;
    while (L.size() > 1)
    {
        vector < int > L1, L2;
        shuffle(L.begin(), L.end(), Rnd);
        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;
        shuffle(R.begin(), R.end(), Rnd);
        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];
    vector < int > A[N + 1];
    for (int i = 1; i <= N; i++)
        A[i].pb(i), P[i] = i;
    for (int q = 1; q <= N - 1; q ++)
    {
        bool done = 0;
        vector < int > L, R;
        while (!done)
        {
            L.clear(); R.clear();
            for (int i = 1; i <= N; i++)
            {
                bool w = Rand();
                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 ?
            int _N = N - q + 1;
            _N >>= 1; _N -= 2;
            if ((int)L.size() <= _N || (int)R.size() <= _N)
                continue;

            done = query(L.size(), R.size(), L.data(), R.data());
        }
        GoForIt(L, R);
        setRoad(fe, se);
        int v = fe, u = se, pu = P[u];
        for (int w : A[pu])
            P[w] = P[v], A[P[v]].pb(w);
        A[pu].clear();
    }
    return ;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 640 KB Ok! 572 queries used.
2 Correct 75 ms 512 KB Ok! 861 queries used.
3 Correct 56 ms 512 KB Ok! 816 queries used.

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 129 ms 512 KB Ok! 1515 queries used.
2 Correct 184 ms 704 KB Ok! 2165 queries used.
3 Correct 125 ms 512 KB Ok! 1550 queries used.
4 Correct 149 ms 512 KB Ok! 1740 queries used.

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 568 KB Ok! 1672 queries used.
2 Correct 153 ms 696 KB Ok! 1610 queries used.
3 Correct 178 ms 692 KB Ok! 1858 queries used.
4 Correct 146 ms 572 KB Ok! 1537 queries used.

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 185 ms 604 KB Too many queries! 1840 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

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