oj.uz

Submission #131482

# Submission time Handle Problem Language Result Execution time Memory
131482 2019-07-17T08:10:26 Z SirCeness Meetings (JOI19_meetings) C++14
0 / 100
 42 ms 532 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){
	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++){
		int ans = Query(root, ch, arr[i]);
		if (ans != root){
			bu.pb(arr[i]);
			ch = ans;
		} else {
			dig.pb(arr[i]);
		}
	}
	
	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();
	Bridge(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:21:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < arr.size(); i++){
                  ~~^~~~~~~~~~~~
meetings.cpp:31:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < bu.size(); i++){
                  ~~^~~~~~~~~~~

Subtask #1
0 / 7.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 42 ms 532 KB Wrong Answer [1]
2 Halted 0 ms 0 KB -