답안 #1113464

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1113464	2024-11-16T15:52:47 Z	Nonoze	Make them Meet (EGOI24_makethemmeet)	C++17	21.061 / 100	90 ms	11744 KB

Main

#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)x.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define cmin(a, b) a=min(a, b)
#define cmax(a, b) a=max(a, b)
#define fi first
#define se second
#define pb push_back
#define mp make_pair

#define int long long

void solve();

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	solve();
	return 0;
}

vector<vector<int>> vec;


void print() {
	cout << sz(vec) << endl;
	for (auto &a: vec) {
		for (auto &u: a) cout << u << ' ';
		cout << endl;
	}
	cout << endl;
}

void add(vector<int> &a) { vec.pb(a); }

int n, m;
vector<int> a;
vector<set<int>> adj;


void execute(int x, int par=-1) {
	for (auto u: adj[x]) if (u!=par) {
		auto temp=a; temp[x]=0, temp[u]=0;
		add(temp);
		execute(u, x);
		add(temp);
	}
}

void solve() {
	cin >> n >> m; a.clear(), a.resize(n, 0); iota(all(a), 1);
	adj.clear(), adj.resize(n);
	for (int i=0; i<m; i++) {
		int u, v; cin >> u >> v;
		adj[u].insert(v), adj[v].insert(u);
	}
	for (int i=0; i<n; i++) {
		for (int j=0; j<n; j++) {
			if (sz(adj[j])==1) {
				execute(j);
				adj[*adj[j].begin()].erase(j);
				adj[j].clear();
				break;
			}
		}
	}
	print();
}

Subtask #1
3.694915254 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Partially correct	59 ms	11032 KB	Partially correct
5	Partially correct	61 ms	11396 KB	Partially correct

Subtask #2
0.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Incorrect	1 ms	336 KB	If people start at 0 and 1, then they can avoid each other
3	Halted	0 ms	0 KB	-

Subtask #3
4.0644067794 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	504 KB	Output is correct
4	Partially correct	10 ms	1604 KB	Partially correct
5	Partially correct	65 ms	10884 KB	Partially correct
6	Partially correct	76 ms	11396 KB	Partially correct
7	Partially correct	23 ms	3152 KB	Partially correct

Subtask #4
13.3016949144 / 36.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Partially correct	59 ms	11032 KB	Partially correct
5	Partially correct	61 ms	11396 KB	Partially correct
6	Correct	1 ms	336 KB	Output is correct
7	Correct	1 ms	336 KB	Output is correct
8	Correct	1 ms	504 KB	Output is correct
9	Partially correct	10 ms	1604 KB	Partially correct
10	Partially correct	65 ms	10884 KB	Partially correct
11	Partially correct	76 ms	11396 KB	Partially correct
12	Partially correct	23 ms	3152 KB	Partially correct
13	Correct	1 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	Partially correct	59 ms	10984 KB	Partially correct
17	Partially correct	64 ms	11396 KB	Partially correct
18	Correct	1 ms	336 KB	Output is correct
19	Correct	1 ms	336 KB	Output is correct
20	Partially correct	10 ms	1616 KB	Partially correct
21	Partially correct	60 ms	10880 KB	Partially correct
22	Partially correct	63 ms	11744 KB	Partially correct
23	Partially correct	19 ms	3152 KB	Partially 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	Partially correct	66 ms	11396 KB	Partially correct
28	Partially correct	76 ms	11396 KB	Partially correct
29	Partially correct	64 ms	11396 KB	Partially correct
30	Partially correct	64 ms	11436 KB	Partially correct
31	Partially correct	63 ms	11396 KB	Partially correct
32	Partially correct	64 ms	11396 KB	Partially correct
33	Partially correct	65 ms	11400 KB	Partially correct
34	Partially correct	90 ms	11396 KB	Partially correct
35	Partially correct	75 ms	11476 KB	Partially correct
36	Partially correct	65 ms	11396 KB	Partially correct
37	Partially correct	69 ms	11396 KB	Partially correct
38	Partially correct	64 ms	11440 KB	Partially correct
39	Partially correct	62 ms	11416 KB	Partially correct
40	Partially correct	66 ms	11396 KB	Partially correct
41	Partially correct	66 ms	11396 KB	Partially correct
42	Partially correct	66 ms	11312 KB	Partially correct
43	Partially correct	64 ms	11396 KB	Partially correct
44	Partially correct	62 ms	11384 KB	Partially correct
45	Partially correct	70 ms	11404 KB	Partially correct
46	Correct	1 ms	336 KB	Output is correct
47	Correct	1 ms	336 KB	Output is correct
48	Correct	1 ms	336 KB	Output is correct
49	Correct	1 ms	336 KB	Output is correct
50	Correct	1 ms	336 KB	Output is correct
51	Correct	1 ms	336 KB	Output is correct
52	Correct	1 ms	336 KB	Output is correct
53	Correct	1 ms	336 KB	Output is correct
54	Correct	1 ms	336 KB	Output is correct
55	Correct	1 ms	336 KB	Output is correct
56	Correct	1 ms	504 KB	Output is correct
57	Correct	1 ms	336 KB	Output is correct
58	Correct	1 ms	336 KB	Output is correct
59	Correct	1 ms	336 KB	Output is correct
60	Correct	1 ms	336 KB	Output is correct
61	Correct	1 ms	336 KB	Output is correct
62	Correct	1 ms	336 KB	Output is correct
63	Correct	1 ms	336 KB	Output is correct
64	Correct	1 ms	336 KB	Output is correct
65	Correct	1 ms	336 KB	Output is correct

Subtask #5
0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	336 KB	Output is correct
3	Correct	1 ms	336 KB	Output is correct
4	Partially correct	59 ms	11032 KB	Partially correct
5	Partially correct	61 ms	11396 KB	Partially correct
6	Correct	1 ms	336 KB	Output is correct
7	Incorrect	1 ms	336 KB	If people start at 0 and 1, then they can avoid each other
8	Halted	0 ms	0 KB	-

답안 #1113464

Compilation message

Subtask #1 3.694915254 / 10.0

Subtask #2 0.0 / 13.0

Subtask #3 4.0644067794 / 11.0

Subtask #4 13.3016949144 / 36.0

Subtask #5 0.0 / 30.0

Subtask #1
3.694915254 / 10.0

Subtask #2
0.0 / 13.0

Subtask #3
4.0644067794 / 11.0

Subtask #4
13.3016949144 / 36.0

Subtask #5
0.0 / 30.0