Submission #131617

# Submission time Handle Problem Language Result Execution time Memory
131617 2019-07-17T10:35:02 Z Kewo Meetings (JOI19_meetings) C++17
29 / 100
2000 ms 2552 KB
#include "meetings.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define spc " "
#define endl "\n"
#define fast_io() cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
using namespace std;

typedef pair<int, int> ii;
typedef long long int lli;

const int N = (2005);
const int LOG = (20);

int mark[N], tk;
set<int> below[N];

void Solve(int N) {
	for(int i = 0; i < N; i++)
		below[0].insert(i);

	for(int i = 1; i < N; i++)
		for(int j = i + 1; j < N; j++) {
			int node = Query(0, i, j);
			below[node].insert(i);
			below[node].insert(j);
		}
	for(int i = 0; i < N; i++)
		below[i].erase(i);

	for(int i = 1; i < N; i++)
		if(below[i].size() == 0)
			mark[i] = 1;

	while(!mark[0])
		for(int i = 0; i < N; i++) {
			if(mark[i])
				continue;
			bool ok = true;
			for(auto j : below[i])
				if(!mark[j])
					ok = false;
			if(ok) {
				mark[i] = 1;
				for(auto j : below[i])
					if(mark[j] == 1) {
						if(i < j)
							Bridge(i, j);
						else
							Bridge(j, i);
						mark[j] = 2;
					}
			}
		}
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 372 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 372 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 4 ms 424 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 372 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 504 KB Output is correct
19 Correct 3 ms 504 KB Output is correct
20 Correct 3 ms 504 KB Output is correct
21 Correct 3 ms 504 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 3 ms 504 KB Output is correct
24 Correct 3 ms 504 KB Output is correct
25 Correct 4 ms 424 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 133 ms 808 KB Output is correct
28 Correct 134 ms 592 KB Output is correct
29 Correct 131 ms 504 KB Output is correct
30 Correct 139 ms 640 KB Output is correct
31 Correct 140 ms 604 KB Output is correct
32 Correct 138 ms 548 KB Output is correct
33 Correct 134 ms 552 KB Output is correct
34 Correct 137 ms 536 KB Output is correct
35 Correct 137 ms 504 KB Output is correct
36 Correct 147 ms 760 KB Output is correct
37 Correct 244 ms 1568 KB Output is correct
38 Correct 297 ms 2088 KB Output is correct
39 Correct 298 ms 2552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Execution timed out 3043 ms 1280 KB Time limit exceeded
2 Halted 0 ms 0 KB -