Submission #119850

# Submission time Handle Problem Language Result Execution time Memory
119850 2019-06-22T13:48:57 Z keko37 Meetings (JOI19_meetings) C++14
100 / 100
1159 ms 1040 KB
#include <bits/stdc++.h>
#include "meetings.h"


using namespace std;

int n;

void rjesi (vector <int> v) {
	if (v.size() < 2) return;
	random_shuffle(v.begin(), v.end());
	int a = v[0], b = v[1];
	vector <int> lef, rig;
	lef.push_back(a); rig.push_back(b);
	for (int i=2; i<v.size(); i++) {
		//cout << "pikam " << a << " " << b << " " << v[i] << endl;
		if (v[i] == a || v[i] == b) continue;
		assert(a != b);
		int val = Query(a, b, v[i]);
		if (val == a) {
			lef.push_back(v[i]);
		} else if (val == b) {
		 	rig.push_back(v[i]);
		} else {
			if (lef.size() < rig.size()) {
				a = val;
				lef.push_back(val);
				if (v[i] != val) lef.push_back(v[i]);
			} else {
				b = val;
				rig.push_back(val);
				if (v[i] != val) rig.push_back(v[i]);
			}
		}
	}
	if (a > b) swap(a, b);
	//cout << "naso sam " << a << " " << b << endl;
	//cout << "lef je "; for (auto x : lef) cout << x << " "; cout << endl;
	//cout << "rig je "; for (auto x : rig) cout << x << " "; cout << endl;
	Bridge(a, b);
	sort(lef.begin(), lef.end());
	lef.erase(unique(lef.begin(), lef.end()), lef.end());
	sort(rig.begin(), rig.end());
	rig.erase(unique(rig.begin(), rig.end()), rig.end());
	rjesi(lef);
	rjesi(rig);
}

void Solve (int N) {
	n = N;
	vector <int> e;
	for (int i=0; i<n; i++) {
		e.push_back(i);
	}
	rjesi(e);
}

Compilation message

meetings.cpp: In function 'void rjesi(std::vector<int>)':
meetings.cpp:15:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=2; i<v.size(); i++) {
                ~^~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 8 ms 384 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 7 ms 384 KB Output is correct
32 Correct 9 ms 384 KB Output is correct
33 Correct 13 ms 512 KB Output is correct
34 Correct 12 ms 384 KB Output is correct
35 Correct 12 ms 384 KB Output is correct
36 Correct 7 ms 384 KB Output is correct
37 Correct 7 ms 384 KB Output is correct
38 Correct 8 ms 384 KB Output is correct
39 Correct 8 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1071 ms 940 KB Output is correct
2 Correct 1059 ms 760 KB Output is correct
3 Correct 1159 ms 888 KB Output is correct
4 Correct 923 ms 912 KB Output is correct
5 Correct 715 ms 888 KB Output is correct
6 Correct 498 ms 768 KB Output is correct
7 Correct 604 ms 760 KB Output is correct
8 Correct 640 ms 1040 KB Output is correct
9 Correct 725 ms 816 KB Output is correct
10 Correct 588 ms 908 KB Output is correct
11 Correct 799 ms 980 KB Output is correct
12 Correct 706 ms 804 KB Output is correct
13 Correct 753 ms 872 KB Output is correct
14 Correct 709 ms 736 KB Output is correct
15 Correct 700 ms 792 KB Output is correct
16 Correct 699 ms 832 KB Output is correct
17 Correct 714 ms 792 KB Output is correct
18 Correct 727 ms 752 KB Output is correct
19 Correct 598 ms 772 KB Output is correct
20 Correct 680 ms 860 KB Output is correct
21 Correct 686 ms 940 KB Output is correct
22 Correct 625 ms 680 KB Output is correct
23 Correct 736 ms 888 KB Output is correct
24 Correct 688 ms 888 KB Output is correct
25 Correct 664 ms 880 KB Output is correct
26 Correct 816 ms 888 KB Output is correct
27 Correct 677 ms 632 KB Output is correct
28 Correct 807 ms 1020 KB Output is correct
29 Correct 547 ms 760 KB Output is correct
30 Correct 632 ms 860 KB Output is correct
31 Correct 803 ms 812 KB Output is correct
32 Correct 714 ms 752 KB Output is correct
33 Correct 546 ms 832 KB Output is correct
34 Correct 9 ms 512 KB Output is correct
35 Correct 7 ms 384 KB Output is correct
36 Correct 9 ms 512 KB Output is correct
37 Correct 9 ms 384 KB Output is correct
38 Correct 7 ms 384 KB Output is correct
39 Correct 10 ms 384 KB Output is correct
40 Correct 14 ms 512 KB Output is correct
41 Correct 13 ms 512 KB Output is correct
42 Correct 12 ms 512 KB Output is correct
43 Correct 7 ms 384 KB Output is correct
44 Correct 7 ms 384 KB Output is correct
45 Correct 7 ms 432 KB Output is correct
46 Correct 7 ms 512 KB Output is correct
47 Correct 2 ms 256 KB Output is correct
48 Correct 2 ms 384 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 384 KB Output is correct
51 Correct 2 ms 384 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 2 ms 384 KB Output is correct
54 Correct 2 ms 384 KB Output is correct
55 Correct 2 ms 256 KB Output is correct
56 Correct 2 ms 256 KB Output is correct
57 Correct 2 ms 256 KB Output is correct
58 Correct 2 ms 384 KB Output is correct
59 Correct 2 ms 284 KB Output is correct
60 Correct 2 ms 384 KB Output is correct
61 Correct 2 ms 256 KB Output is correct
62 Correct 2 ms 384 KB Output is correct
63 Correct 2 ms 328 KB Output is correct
64 Correct 2 ms 256 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 256 KB Output is correct
67 Correct 2 ms 384 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 2 ms 384 KB Output is correct
70 Correct 2 ms 384 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 2 ms 256 KB Output is correct