제출 #96835

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
96835		Kastanda	ICC (CEOI16_icc)	C++11	18 / 100	178 ms	1016 KiB

icc

// I do it for the glory
#include<bits/stdc++.h>
#include "icc.h"
#define pb push_back
using namespace std;
mt19937 Rnd(time(0));
int fe, se, qq;
bool Rand()
{
    return (Rnd() & 1);
}
void GoForIt(vector < int > L, vector < int > R)
{
    if (L.size() > R.size())
        L.swap(R);
    if (R.size() == 1)
    {
        fe = L[0];
        se = R[0];
        return ;
    }
    vector < int > R1, R2;
    for (int i = 0; i < (int)R.size(); i++)
    {
        if (i < (R.size() >> 1))
            R1.pb(R[i]);
        else
            R2.pb(R[i]);
    }
    R.clear();
    qq ++;
    bool w = query(L.size(), R1.size(), L.data(), R1.data());
    if (w) GoForIt(L, R1);
    else GoForIt(L, R2);
}
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 ?
            done = query(L.size(), R.size(), L.data(), R.data());
        }
        qq = 0;
        GoForIt(L, R);
        if (qq > 12) assert(0);
        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 ;
}

컴파일 시 표준 에러 (stderr) 메시지

icc.cpp: In function 'void GoForIt(std::vector<int>, std::vector<int>)':
icc.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (i < (R.size() >> 1))
             ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 11 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 21
• Subtask 5: 0 / 29
• Subtask 6: 0 / 10