oj.uz

Submission #24607

# Submission time Handle Problem Language Result Execution time Memory
24607 2017-06-10T18:07:37 Z bill_kondo ICC (CEOI16_icc) C++14
7 / 100
 373 ms 2084 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair <int, int> pii;

const int maxn = 1e2 + 10;

int n;
set <pii> e;

int c[maxn];
int d[maxn];

void acha ()
{
	for (int a = 1; a <= n; ++a)
		for (int b = a + 1; b <= n; ++b)
			if (e.find (pii (a, b)) == e.end())
			{
				c[0] = {a};
				d[0] = {b};
				
				if (query (1, 1, c, d))
				{
					e.insert (pii (a, b));
					setRoad (a, b);
					return;
				}
			}
}

void run (int N)
{
	n = N;
	for (int i = 1; i <= n - 1; ++i)
		acha ();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 2080 KB Ok! 1015 queries used.
2 Correct 63 ms 2080 KB Ok! 1010 queries used.

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 353 ms 2084 KB Number of queries more than 5000 out of 2500
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 373 ms 2084 KB Number of queries more than 4500 out of 2250
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 339 ms 2080 KB Number of queries more than 4000 out of 2000
2 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 289 ms 2080 KB Number of queries more than 3550 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 259 ms 2084 KB Number of queries more than 3250 out of 1625
2 Halted 0 ms 0 KB -