oj.uz

Submission #375320

# Submission time Handle Problem Language Result Execution time Memory
375320 2021-03-09T07:40:43 Z casperwang Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1004 KB 
#include "meetings.h"
#define All(x) x.begin(), x.end()
#define pb push_back
#include <bits/stdc++.h>
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }

void solve_set(vector <int> V) {
	srand(time(NULL));
	random_shuffle(All(V));
	set <int> R;
	vector <int> V2;
	for (int i : V) R.insert(i);
	int m = Query(V[0], V[1], V[2]);
	if (V.size() == 3) {
		for (int i = 0; i < 3; i++) {
			if (m != V[i]) {
				Bridge(min(m, V[i]), max(m, V[i]));
			}
		}
		return;
	}
	for (int i = 0; i < 3; i++) {
		if (m == V[i]) continue;
		vector <int> A, B;
		R.erase(V[i]);
		for (int j : V) {
			if (j == V[i] || j == m) continue;
			int d = Query(m, V[i], j);
			if (d == V[i])
				B.pb(j), R.erase(j);
			else if (d != m)
				A.pb(j), R.erase(j);
		}
		if (A.size() == 0) {
			Bridge(min(m, V[i]), max(m, V[i]));
		} else if (A.size() == 1) {
			Bridge(min(A[0], m), max(A[0], m));
			Bridge(min(A[0], V[i]), max(A[0], V[i]));
		} else if (A.size() >= 2) {
			A.pb(m);
			A.pb(V[i]);
			solve_set(A);
		}
		if (B.size() == 1) {
			Bridge(min(B[0], V[i]), max(B[0], V[i]));
		} else if (B.size() >= 2) {
			B.pb(V[i]);
			solve_set(B);
		}
	}
	for (int i : R) V2.pb(i);
	if (V2.size() == 2) {
		Bridge(min(V2[0], V2[1]), max(V2[0], V2[1]));
	} else if (V2.size() >= 3) {
		solve_set(V2);
	}
}

void Solve(int N) {
	vector <int> arr;
	for (int i = 0; i < N; i++) arr.pb(i);
	solve_set(arr);
	return;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 22 ms 364 KB Output is correct
28 Correct 16 ms 364 KB Output is correct
29 Correct 21 ms 364 KB Output is correct
30 Correct 16 ms 364 KB Output is correct
31 Correct 17 ms 364 KB Output is correct
32 Correct 15 ms 364 KB Output is correct
33 Correct 21 ms 492 KB Output is correct
34 Correct 23 ms 492 KB Output is correct
35 Correct 21 ms 492 KB Output is correct
36 Correct 18 ms 364 KB Output is correct
37 Correct 15 ms 364 KB Output is correct
38 Correct 15 ms 364 KB Output is correct
39 Correct 12 ms 364 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1500 ms 896 KB Output is correct
2 Correct 1643 ms 844 KB Output is correct
3 Correct 1550 ms 996 KB Output is correct
4 Correct 1469 ms 880 KB Output is correct
5 Execution timed out 2137 ms 1004 KB Time limit exceeded
6 Halted 0 ms 0 KB -