oj.uz

Submission #131493

# Submission time Handle Problem Language Result Execution time Memory
131493 2019-07-17T08:16:47 Z ekrem Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 3832 KB 
#include "meetings.h"
#include <bits/stdc++.h>
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define inf 1000000009
#define MAXN 1000005

using namespace std;

typedef long long ll;
typedef pair < int , int > ii;
typedef set < int > si;

int n, k, sil[MAXN];
si :: iterator it;

int sor(int x, int y, int z){
	if(x == y)return x;
	if(z == y)return z;
	if(x == z)return x;
	return Query(x - 1, y - 1, z - 1) + 1;
}

void coz(si a, int x){
	if(a.empty())
		return;
	si b;
	int son = *a.begin();
	b.insert(son);
	a.erase(son);
	k = 0;
	// cout << x << " -> " << son << " ";
	for(it = a.begin(); it != a.end(); it++){
		// cout << *it << " ";
		int y = sor(son, x, *it);
		// cout << son << " " << x << " " << *it << " = " << y << endl;
		if(y == x)
			continue;
		if(y == son){
			sil[++k] = *it;
			// it = a.erase(y);
			b.insert(*it);
			continue;
		}
		son = y;
		sil[++k] = y;
		sil[++k] = *it;
		// it = a.erase(y);
		b.insert(y);
		b.insert(*it);
	}
	// cout << endl;
	for(int i = 1; i <= k; i++)
		a.erase(sil[i]);
	Bridge(min(x - 1, son - 1), max(x - 1, son - 1));
	// cout << x << " " << son << " " << b.size() << endl;
	b.erase(son);
	coz(b, son);
	coz(a, x);
}

void Solve(int nn) {n = nn;
	si a;
	for(int i = 2; i <= n; i++)
		a.insert(i);
	coz(a, 1);
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 296 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 296 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 3 ms 380 KB Output is correct
26 Correct 3 ms 504 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 248 KB Output is correct
8 Correct 2 ms 252 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 248 KB Output is correct
13 Correct 2 ms 296 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 380 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 372 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 3 ms 380 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 13 ms 632 KB Output is correct
28 Correct 11 ms 504 KB Output is correct
29 Correct 13 ms 504 KB Output is correct
30 Correct 15 ms 632 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 10 ms 504 KB Output is correct
33 Correct 12 ms 504 KB Output is correct
34 Correct 16 ms 632 KB Output is correct
35 Correct 14 ms 632 KB Output is correct
36 Correct 15 ms 504 KB Output is correct
37 Correct 97 ms 1232 KB Output is correct
38 Correct 153 ms 1996 KB Output is correct
39 Correct 202 ms 2504 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1202 ms 1224 KB Output is correct
2 Correct 1272 ms 1576 KB Output is correct
3 Correct 1299 ms 1320 KB Output is correct
4 Correct 1600 ms 1864 KB Output is correct
5 Correct 1145 ms 1628 KB Output is correct
6 Correct 716 ms 1764 KB Output is correct
7 Correct 696 ms 1352 KB Output is correct
8 Correct 782 ms 1588 KB Output is correct
9 Correct 790 ms 1732 KB Output is correct
10 Correct 714 ms 1556 KB Output is correct
11 Correct 871 ms 1552 KB Output is correct
12 Execution timed out 3075 ms 3832 KB Time limit exceeded
13 Halted 0 ms 0 KB -