oj.uz

Submission #119836

# Submission time Handle Problem Language Result Execution time Memory
119836 2019-06-22T13:34:25 Z keko37 Meetings (JOI19_meetings) C++14
17 / 100
 986 ms 844 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;
		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);
	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++) {
                ~^~~~~~~~~

Subtask #1
7.0 / 7.0

# 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 1 ms 256 KB Output is correct
4 Correct 2 ms 384 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 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# 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 1 ms 256 KB Output is correct
4 Correct 2 ms 384 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 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct

Subtask #3
0 / 12.0

# 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 1 ms 256 KB Output is correct
4 Correct 2 ms 384 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 384 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 3 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Incorrect 7 ms 384 KB Wrong Answer [1]
28 Halted 0 ms 0 KB -

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 986 ms 844 KB Output is correct
2 Incorrect 688 ms 784 KB Wrong Answer [1]
3 Halted 0 ms 0 KB -