oj.uz

답안 #559552

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559552 2022-05-10T07:16:39 Z minhcool Meetings (JOI19_meetings) C++17
29 / 100
 1956 ms 1040 KB 
#include "meetings.h"
#include<bits/stdc++.h>
 
using namespace std; 
 
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define eb emplace_back
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 2e3 + 5, MAXN = 1e7 + 5;
 
const long long oo = 1e9 + 7, mod = 1e9 + 7;
 
vector<int> vis[N];
 
int sz[N];

//vector<ii> bridge;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int rnd(int l, int r){
	int temp = rng() % (r - l + 1);
	temp = (temp + (r - l + 1)) % (r - l + 1);
	return temp + l;
}

int query(int a, int b, int c){
	//cout << a << " " << b << " " << c << "\n";
	return Query(a - 1, b - 1, c - 1) + 1;
}

void bridge(int a, int b){
	Bridge(min(a, b) - 1, max(a, b) - 1);	
}

void solve(vector<int> x){
	if(x.size() <= 1) return;
	if(x.size() == 2){
		bridge(x[0], x[1]);
		return;
	}
	int temp = rnd(1, x.size() - 1);
	int node = x[temp];
	int node2 = x[0];
	//cout << temp << " " << node << " " << node2 << "\n";
	//assert(node != node2);
	for(auto it : x){
		if(it == node || it == node2) continue;
		int temp = query(node, node2, it);
		if(temp == node) continue;
		node2 = temp;
	}
	//cout << node << " " << node2 << "\n";
	bridge(node, node2);
	vector<int> x1, x2;
	x1.pb(node), x2.pb(node2);
	for(auto it : x){
		if(it == node || it == node2) continue;
		int temp = query(node, node2, it);
		assert(temp == node || temp == node2);
		if(temp == node) x1.pb(it);
		else x2.pb(it);	
	}
	solve(x1), solve(x2);
}
void Solve(int n){
	vector<int> str;
	for(int i = 1; i <= n; i++) str.pb(i);
	solve(str);
}
 
/*
5
0 1
0 2
1 3
1 4
*/

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 0 ms 336 KB Output is correct
8 Correct 0 ms 336 KB Output is correct
9 Correct 0 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 0 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 336 KB Output is correct
27 Correct 47 ms 456 KB Output is correct
28 Correct 64 ms 564 KB Output is correct
29 Correct 38 ms 472 KB Output is correct
30 Correct 38 ms 468 KB Output is correct
31 Correct 47 ms 464 KB Output is correct
32 Correct 55 ms 520 KB Output is correct
33 Correct 85 ms 684 KB Output is correct
34 Correct 100 ms 696 KB Output is correct
35 Correct 64 ms 584 KB Output is correct
36 Correct 28 ms 484 KB Output is correct
37 Correct 15 ms 464 KB Output is correct
38 Correct 17 ms 440 KB Output is correct
39 Correct 12 ms 464 KB Output is correct

Subtask #4
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1956 ms 1040 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -