Submission #164425

#	Time	Username	Problem	Language	Result	Execution time	Memory
164425		Lawliet	ICC (CEOI16_icc)	C++14	7 / 100	503 ms	1084 KiB

icc

#include <bits/stdc++.h>
#include "icc.h"

using namespace std;
typedef pair<int,int> pii;

int N;

map< pii , bool > hasEdge;

void run(int n)
{
	N = n;

	for(int k = 1 ; k < N ; k++)
	{
		bool find = false;

		int ansA = 0;
		int ansB = 0;

		for(int i = 1 ; i <= n && !find ; i++)
		{
			for(int j = i + 1 ; j <= n && !find ; j++)
			{
				if( hasEdge[ { i , j } ] ) continue;

				int A[1] = { i };
				int B[1] = { j };

				int ans = query( 1 , 1 , A , B );

				if( ans == 1 )
				{
					find = true;

					ansA = i;
					ansB = j;
				}
			}
		}

		hasEdge[ { ansA , ansB } ] = true;

		setRoad( ansA , ansB );
	}
}

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