제출 #342535

#제출 시각아이디문제언어결과실행 시간메모리
342535blueICC (CEOI16_icc)C++11
7 / 100
460 ms620 KiB
#include "icc.h"
#include <set>
using namespace std;

void run(int N)
{
    set<int> edge[N+1];
    int a[1], b[1];

    bool flag = 0;

    for(int i = 1; i <= N-1; i++)
    {
        flag = 0;
        for(int p = 1; p <= N; p++)
        {
            for(int q = p+1; q <= N; q++)
            {
                if(edge[p].find(q) != edge[p].end()) continue;
                a[0] = p;
                b[0] = q;
                if(query(1, 1, a, b) == 0) continue;
                edge[p].insert(q);
                edge[q].insert(p);
                setRoad(p, q);
                flag = 1;
                break;
            }
            if(flag) break;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...