oj.uz

Submission #131531

# Submission time Handle Problem Language Result Execution time Memory
131531 2019-07-17T08:49:52 Z SirCeness Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1092 KB 
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;
#define ll long long;
#define mod 1000000007
#define mp make_pair
#define pb push_back
#define bas(x) #x << ": " << x
#define prarr(x, n) cout << #x << ": "; for (int qsd = 0; qsd < n; qsd++) cout << x[qsd] << " "; cout << endl;
#define prarrv(x) cout << #x << ": "; for (int qsd = 0; qsd < (int)x.size(); qsd++) cout << x[qsd] << " "; cout << endl;
#define inside sl<=l%&&r<=sr
#define outside sr<l||r<sl

void get(int root, vector<int>& arr){
	//cout << "get(" << root << ")" << endl;
	//prarrv(arr);
	if (arr.size() == 0) return;
	else if (arr.size() == 1){
		Bridge(min(root, arr[0]), max(root, arr[0]));
		return;
	}
	int ch = arr[rand()%arr.size()];
	vector<int> alt;
	vector<int> ust;
	vector<int> dig;
	ust.pb(ch);
	for (int i = 0; i < arr.size(); i++){
		//cout << "query(" << root << ", " << ch << ", " << arr[i] << ")" << endl;
		if (ch == arr[i]) continue;
		int ans = Query(root, ch, arr[i]);
		if (ans == ch){
			alt.pb(arr[i]);
		} else if (ans == root){
			dig.pb(arr[i]);
		} else {
			ust.pb(arr[i]);
		}
	}
	
	get(root, dig);
	get(root, ust);
	get(ch, alt);
}

void Solve(int N) {
	srand(571);
	vector<int> arr(N-1);
	for (int i = 1; i < N; i++) arr[i-1] = i;
	get(0, arr);
}

Compilation message

meetings.cpp: In function 'void get(int, std::vector<int>&)':
meetings.cpp:28:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < arr.size(); i++){
                  ~~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 372 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 248 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 248 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 372 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 248 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 2 ms 296 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 380 KB Output is correct
19 Correct 3 ms 400 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 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 248 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 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 248 KB Output is correct
6 Correct 2 ms 372 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 248 KB Output is correct
10 Correct 2 ms 248 KB Output is correct
11 Correct 2 ms 248 KB Output is correct
12 Correct 2 ms 292 KB Output is correct
13 Correct 2 ms 248 KB Output is correct
14 Correct 3 ms 248 KB Output is correct
15 Correct 2 ms 296 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 380 KB Output is correct
19 Correct 3 ms 400 KB Output is correct
20 Correct 3 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 3 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 248 KB Output is correct
26 Correct 2 ms 248 KB Output is correct
27 Correct 44 ms 376 KB Output is correct
28 Correct 33 ms 432 KB Output is correct
29 Correct 37 ms 424 KB Output is correct
30 Correct 43 ms 376 KB Output is correct
31 Correct 43 ms 504 KB Output is correct
32 Correct 58 ms 504 KB Output is correct
33 Correct 57 ms 420 KB Output is correct
34 Correct 168 ms 760 KB Output is correct
35 Correct 64 ms 504 KB Output is correct
36 Correct 21 ms 376 KB Output is correct
37 Correct 13 ms 376 KB Output is correct
38 Correct 12 ms 504 KB Output is correct
39 Correct 12 ms 504 KB Output is correct

Subtask #4
0 / 71.0

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