답안 #720968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
720968 2023-04-10T00:15:03 Z qwerasdfzxcl Meetings (JOI19_meetings) C++17
29 / 100
2000 ms 16288 KB
#include "meetings.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
int mp[2020][2020];

int query(int x, int y, int z){
	if (x==1){
		if (y > z) swap(y, z);
		if (mp[y][z]) return mp[y][z];
		return mp[y][z] = Query(x-1, y-1, z-1) + 1;
	}
	return Query(x-1, y-1, z-1) + 1;
}

void answer(int x, int y){
	if (x > y) swap(x, y);
	Bridge(x-1, y-1);
}

void dfs(int s, vector<int> a){
	vector<vector<int>> subtree;
	for (auto &x:a){
		bool flag = 0;
		for (auto &V:subtree){
			if (query(1, x, V[0])!=s){
				flag = 1;
				V.push_back(x);
				break;
			}
		}

		if (flag) continue;
		subtree.emplace_back();
		subtree.back().push_back(x);
	}

	for (auto &V:subtree){
		vector<int> C = V;
		while(C.size() > 1){
			int x = C.back(); C.pop_back();
			int y = C.back(); C.pop_back();
			int z = query(1, x, y);

			if (x==z) C.push_back(x);
			if (y==z) C.push_back(y);
		}

		answer(s, C[0]);
		V.erase(find(V.begin(), V.end(), C[0]));
		dfs(C[0], V);
	}
}

void Solve(int N) {
	vector<int> a;
	for (int i=2;i<=N;i++) a.push_back(i);
	dfs(1, a);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 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 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 0 ms 336 KB Output is correct
13 Correct 0 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 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 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 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 1 ms 336 KB Output is correct
10 Correct 0 ms 336 KB Output is correct
11 Correct 1 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 464 KB Output is correct
15 Correct 1 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 464 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 472 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 464 KB Output is correct
26 Correct 1 ms 592 KB Output is correct
27 Correct 7 ms 1652 KB Output is correct
28 Correct 7 ms 1616 KB Output is correct
29 Correct 9 ms 1616 KB Output is correct
30 Correct 11 ms 1744 KB Output is correct
31 Correct 9 ms 1748 KB Output is correct
32 Correct 8 ms 1616 KB Output is correct
33 Correct 11 ms 1616 KB Output is correct
34 Correct 14 ms 1616 KB Output is correct
35 Correct 13 ms 1616 KB Output is correct
36 Correct 11 ms 1700 KB Output is correct
37 Correct 45 ms 2056 KB Output is correct
38 Correct 76 ms 2208 KB Output is correct
39 Correct 175 ms 2508 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 600 ms 13564 KB Output is correct
2 Correct 707 ms 13724 KB Output is correct
3 Correct 654 ms 13740 KB Output is correct
4 Correct 748 ms 14176 KB Output is correct
5 Correct 552 ms 13864 KB Output is correct
6 Correct 536 ms 13912 KB Output is correct
7 Correct 584 ms 13932 KB Output is correct
8 Correct 631 ms 13832 KB Output is correct
9 Correct 677 ms 14036 KB Output is correct
10 Correct 640 ms 13896 KB Output is correct
11 Correct 663 ms 13896 KB Output is correct
12 Execution timed out 2937 ms 16288 KB Time limit exceeded
13 Halted 0 ms 0 KB -