oj.uz

Submission #131506

# Submission time Handle Problem Language Result Execution time Memory
131506 2019-07-17T08:28:49 Z SirCeness Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1132 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;
	int ch = arr[0];
	vector<int> bu;
	vector<int> dig;
	bu.pb(ch);
	for (int i = 1; i < arr.size(); i++){
		//cout << "query(" << root << ", " << ch << ", " << arr[i] << ")" << endl;
		int ans = Query(root, ch, arr[i]);
		if (ans != root){
			bu.pb(arr[i]);
			if (ans == arr[i]) ch = ans;
		} else {
			dig.pb(arr[i]);
		}
	}
	
	//prarrv(bu);
	//prarrv(dig);
	//cout << bas(ch) << endl;
	
	for (int i = 0; i < bu.size(); i++){
		if (bu[i] == ch){
			int tmp = bu[bu.size()-1];
			bu[bu.size()-1] = bu[i];
			bu[i] = tmp;
			break;
		}
	}
	bu.pop_back();
	//cout << "bridge(" << root << ", " << ch << ")" << endl;
	Bridge(min(root, ch), max(root, ch));
	get(ch, bu);
	get(root, dig);
}

void Solve(int N) {
	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:23:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < arr.size(); i++){
                  ~~^~~~~~~~~~~~
meetings.cpp:38:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < bu.size(); i++){
                  ~~^~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 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 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 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 376 KB Output is correct
2 Correct 2 ms 248 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 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 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 248 KB Output is correct
15 Correct 2 ms 376 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 248 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 248 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 380 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 248 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 248 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 248 KB Output is correct
15 Correct 2 ms 376 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 248 KB Output is correct
19 Correct 2 ms 248 KB Output is correct
20 Correct 2 ms 248 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 248 KB Output is correct
23 Correct 2 ms 248 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 13 ms 376 KB Output is correct
28 Correct 10 ms 376 KB Output is correct
29 Correct 12 ms 376 KB Output is correct
30 Correct 14 ms 404 KB Output is correct
31 Correct 10 ms 376 KB Output is correct
32 Correct 11 ms 376 KB Output is correct
33 Correct 16 ms 504 KB Output is correct
34 Correct 20 ms 632 KB Output is correct
35 Correct 18 ms 376 KB Output is correct
36 Correct 15 ms 376 KB Output is correct
37 Correct 113 ms 704 KB Output is correct
38 Correct 129 ms 776 KB Output is correct
39 Correct 159 ms 760 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1439 ms 948 KB Output is correct
2 Correct 1661 ms 960 KB Output is correct
3 Correct 1684 ms 984 KB Output is correct
4 Correct 1770 ms 804 KB Output is correct
5 Correct 1153 ms 764 KB Output is correct
6 Correct 897 ms 888 KB Output is correct
7 Correct 849 ms 908 KB Output is correct
8 Correct 975 ms 768 KB Output is correct
9 Correct 974 ms 784 KB Output is correct
10 Correct 931 ms 828 KB Output is correct
11 Correct 1101 ms 956 KB Output is correct
12 Execution timed out 3025 ms 1132 KB Time limit exceeded
13 Halted 0 ms 0 KB -