oj.uz

Submission #1113458

# Submission time Handle Problem Language Result Execution time Memory
1113458 2024-11-16T15:27:00 Z Nonoze Make them Meet (EGOI24_makethemmeet) C++17
16.6535 / 100
 161 ms 22540 KB 
#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<vector<int>> adj;
vector<bool> visited;

void dfs(int x) {
	visited[x]=1;
	for (auto u: adj[x]) if (!visited[u]) {
		auto temp=a; temp[x]=0, temp[u]=0;
		add(temp);
		dfs(u);
		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=1; i<n; i++) {
		int u, v; cin >> u >> v;
		adj[u].pb(v), adj[v].pb(u);
	}
	for (int i=0; i<n; i++) {
		visited.clear(), visited.resize(n, 0);
		dfs(i);
	}
	print();
}

Subtask #1
2.921658986 / 10.0

# Verdict Execution time Memory 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 132 ms 21624 KB Partially correct
5 Partially correct 127 ms 22484 KB Partially correct

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory 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 Incorrect 2 ms 504 KB If people start at 0 and 1, then they can avoid each other
5 Halted 0 ms 0 KB -

Subtask #3
3.2138248846 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Partially correct 21 ms 2896 KB Partially correct
5 Partially correct 131 ms 21504 KB Partially correct
6 Partially correct 130 ms 22532 KB Partially correct
7 Partially correct 40 ms 6224 KB Partially correct

Subtask #4
10.5179723496 / 36.0

# Verdict Execution time Memory 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 132 ms 21624 KB Partially correct
5 Partially correct 127 ms 22484 KB Partially correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Partially correct 21 ms 2896 KB Partially correct
10 Partially correct 131 ms 21504 KB Partially correct
11 Partially correct 130 ms 22532 KB Partially correct
12 Partially correct 40 ms 6224 KB Partially correct
13 Correct 1 ms 504 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 129 ms 21504 KB Partially correct
17 Partially correct 123 ms 22532 KB Partially correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 336 KB Output is correct
20 Partially correct 18 ms 2916 KB Partially correct
21 Partially correct 125 ms 21556 KB Partially correct
22 Partially correct 131 ms 22528 KB Partially correct
23 Partially correct 39 ms 6224 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 138 ms 22412 KB Partially correct
28 Partially correct 131 ms 22500 KB Partially correct
29 Partially correct 161 ms 22540 KB Partially correct
30 Partially correct 129 ms 22536 KB Partially correct
31 Partially correct 139 ms 22528 KB Partially correct
32 Partially correct 140 ms 22528 KB Partially correct
33 Partially correct 141 ms 22444 KB Partially correct
34 Partially correct 125 ms 22528 KB Partially correct
35 Partially correct 133 ms 22276 KB Partially correct
36 Partially correct 128 ms 22532 KB Partially correct
37 Partially correct 134 ms 22528 KB Partially correct
38 Partially correct 137 ms 22528 KB Partially correct
39 Partially correct 138 ms 22528 KB Partially correct
40 Partially correct 139 ms 22528 KB Partially correct
41 Partially correct 131 ms 22272 KB Partially correct
42 Partially correct 132 ms 22528 KB Partially correct
43 Partially correct 131 ms 22528 KB Partially correct
44 Partially correct 131 ms 22528 KB Partially correct
45 Partially correct 135 ms 22336 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 336 KB Output is correct
57 Correct 1 ms 504 KB Output is correct
58 Correct 2 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 2 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

# Verdict Execution time Memory 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 132 ms 21624 KB Partially correct
5 Partially correct 127 ms 22484 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 336 KB Output is correct
9 Incorrect 2 ms 504 KB If people start at 0 and 1, then they can avoid each other
10 Halted 0 ms 0 KB -