oj.uz

Submission #123833

# Submission time Handle Problem Language Result Execution time Memory
123833 2019-07-02T07:43:24 Z 김세빈(#3028) Meetings (JOI19_meetings) C++14
29 / 100
 2000 ms 1016 KB 
#include <bits/stdc++.h>

#include "meetings.h"

using namespace std;

vector <int> T[2020], X;
int S[2020], N[2020];
bool chk[2020];

void dfs2(int p, int r, int x)
{
	int v;
	
	for(int t: T[p]){
		if(t != r){
			v = Query(t, p, x);
			if(v == p) continue;
			else if(v == t){
				dfs2(t, p, x);
				return;
			}
			else{
				chk[v] = chk[x] = 1;
				X.push_back(v);
				for(int &u: T[p]){
					if(u == t) u = v;
				}
				for(int &u: T[t]){
					if(u == p) u = v;
				}
				T[v].push_back(p);
				T[v].push_back(t);
				if(v != x){
					X.push_back(x);
					T[v].push_back(x);
					T[x].push_back(v);
				}
				return;
			}
		}
	}
	
	chk[x] = 1;
	X.push_back(x);
	T[p].push_back(x);
	T[x].push_back(p);
}

void Solve(int n)
{
	srand(time(0));
	
	int i, j, v, x;
	
	v = Query(0, 1, 2);
	chk[v] = 1;
	X.push_back(v);
	
	for(i=0; i<3; i++){
		chk[i] = 1;
		X.push_back(i);
		if(i != v){
			T[i].push_back(v);
			T[v].push_back(i);
		}
	}
	
	for(i=3; i<n; i++){
		N[i] = i;
	}
	
	random_shuffle(N + 3, N + n);
	
	for(i=3; i<n; i++){
		if(chk[N[i]]) continue;
		x = X[rand() % X.size()];
		dfs2(x, x, N[i]);
	}
	
	for(i=0; i<n; i++){
		for(int &t: T[i]){
			if(i < t) Bridge(i, t);
		}
	}
}

Compilation message

meetings.cpp: In function 'void Solve(int)':
meetings.cpp:54:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j, v, x;
         ^

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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 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 376 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 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 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 424 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 504 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 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 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 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 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 424 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 504 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 9 ms 504 KB Output is correct
28 Correct 9 ms 376 KB Output is correct
29 Correct 10 ms 376 KB Output is correct
30 Correct 9 ms 376 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 9 ms 376 KB Output is correct
33 Correct 11 ms 380 KB Output is correct
34 Correct 15 ms 380 KB Output is correct
35 Correct 14 ms 376 KB Output is correct
36 Correct 11 ms 504 KB Output is correct
37 Correct 66 ms 504 KB Output is correct
38 Correct 65 ms 504 KB Output is correct
39 Correct 66 ms 376 KB Output is correct

Subtask #4
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1231 ms 868 KB Output is correct
2 Correct 1240 ms 980 KB Output is correct
3 Correct 1223 ms 816 KB Output is correct
4 Correct 1223 ms 632 KB Output is correct
5 Correct 860 ms 864 KB Output is correct
6 Correct 588 ms 808 KB Output is correct
7 Correct 648 ms 776 KB Output is correct
8 Correct 705 ms 740 KB Output is correct
9 Correct 738 ms 1016 KB Output is correct
10 Correct 711 ms 816 KB Output is correct
11 Correct 809 ms 876 KB Output is correct
12 Execution timed out 3046 ms 800 KB Time limit exceeded
13 Halted 0 ms 0 KB -