답안 #223126

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223126 2020-04-14T21:13:25 Z AQT Meetings (JOI19_meetings) C++14
29 / 100
2000 ms 1400 KB
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;

void rec(vector<int> v){
	if(v.size() == 1){
		return;
	}
	random_shuffle(v.begin(), v.end());
	int c = v[0];
	vector<vector<int>> st;
	for(int i = 1; i<v.size(); i++){
		int n = v[i];
		bool b = 0;
		for(int j = 0; j<st.size(); j++){
			if(Query(n, st[j][0], c) != c){
				b = 1;
				st[j].push_back(n);
				break;
			}
		}
		if(!b){
			st.push_back({n});
		}
	}
	for(auto k : st){
		int lca = k[0];
		for(int j = 1; j<k.size(); j++){
			if(lca != k[j]){
				lca = Query(lca, k[j], c);
			}
		}
		//cout << min(lca, c) << " " << max(lca, c) << "\n"; 
		Bridge(min(lca, c), max(lca, c));
		rec(k);
	}
}

void Solve(int N) {
	vector<int> v;
	for(int i = 0; i<N; i++){
		v.push_back(i);
	}
	rec(v);
}

Compilation message

meetings.cpp: In function 'void rec(std::vector<int>)':
meetings.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i<v.size(); i++){
                 ~^~~~~~~~~
meetings.cpp:16:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j<st.size(); j++){
                  ~^~~~~~~~~~
meetings.cpp:29:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 1; j<k.size(); j++){
                  ~^~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 4 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 4 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 6 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 60 ms 512 KB Output is correct
28 Correct 71 ms 504 KB Output is correct
29 Correct 75 ms 504 KB Output is correct
30 Correct 54 ms 504 KB Output is correct
31 Correct 94 ms 716 KB Output is correct
32 Correct 156 ms 632 KB Output is correct
33 Correct 29 ms 384 KB Output is correct
34 Correct 115 ms 632 KB Output is correct
35 Correct 144 ms 760 KB Output is correct
36 Correct 38 ms 384 KB Output is correct
37 Correct 21 ms 384 KB Output is correct
38 Correct 23 ms 384 KB Output is correct
39 Correct 21 ms 512 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3084 ms 1400 KB Time limit exceeded
2 Halted 0 ms 0 KB -