oj.uz

Submission #123783

# Submission time Handle Problem Language Result Execution time Memory
123783 2019-07-02T06:45:17 Z 임유진(#3031) Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 816 KB 
#include "meetings.h"
#include<vector>

using namespace std;

void f(vector<int> &v) {
	if(v.size() == 1) return;
	if(v.size() == 2) {
		Bridge(min(v[0], v[1]), max(v[0], v[1]));
		return;
	}

	/*
	printf("f(");
	for(auto a : v) printf("%d ", a);
	printf(")\n");
	*/

	int alpha = v[0], beta = v[1];
	vector<int> X, Y;
	X.push_back(alpha);
	Y.push_back(beta);
	for(int i = 2; i < v.size(); i++) {
		if(v[i] == beta) {
			Y.push_back(v[i]);
			continue;
		}
		int t = Query(alpha, beta, v[i]);
		if(t != alpha && t != beta) beta = t;
		if(t == alpha) X.push_back(v[i]);
		else Y.push_back(v[i]);
	}
	Bridge(min(alpha, beta), max(alpha, beta));
	f(X);
	f(Y);
}

void Solve(int N) {
	vector<int> v(N);
	for(int i = 0; i < N; i++) v[i] = i;
	f(v);

	/*
  int x = Query(0, 1, 2);
  for (int u = 0; u < N - 1; ++u) {
    Bridge(u, u + 1);
  }
  */
}

Compilation message

meetings.cpp: In function 'void f(std::vector<int>&)':
meetings.cpp:23:19: 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 248 KB Output is correct
2 Correct 2 ms 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 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 248 KB Output is correct
13 Correct 2 ms 376 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 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 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 248 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 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 376 KB Output is correct
21 Correct 2 ms 248 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 248 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 248 KB Output is correct
3 Correct 2 ms 248 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 376 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 248 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 248 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 248 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 376 KB Output is correct
21 Correct 2 ms 248 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 2 ms 248 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 248 KB Output is correct
27 Correct 36 ms 376 KB Output is correct
28 Correct 30 ms 376 KB Output is correct
29 Correct 18 ms 376 KB Output is correct
30 Correct 29 ms 376 KB Output is correct
31 Correct 22 ms 376 KB Output is correct
32 Correct 46 ms 504 KB Output is correct
33 Correct 48 ms 504 KB Output is correct
34 Correct 62 ms 504 KB Output is correct
35 Correct 40 ms 504 KB Output is correct
36 Correct 22 ms 376 KB Output is correct
37 Correct 10 ms 380 KB Output is correct
38 Correct 11 ms 392 KB Output is correct
39 Correct 157 ms 796 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3036 ms 816 KB Time limit exceeded
2 Halted 0 ms 0 KB -