oj.uz

Submission #1064841

# Submission time Handle Problem Language Result Execution time Memory
1064841 2024-08-18T18:24:46 Z sunboi Make them Meet (EGOI24_makethemmeet) C++14
57 / 100
 8 ms 608 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
 
vector<vector<int>> g;
vector<int> vis, depth;
 
void dfs(int v, int par){
    vis[v] = 1;
    if (par != -1) depth[v] = depth[par] + 1;
    
    for (int u : g[v]){
        if (u != par && vis[u] == 0){
            dfs(u, v);
        }
    }
}
 
 signed main(){
    int n, m; cin >> n >> m;
    
    g.clear();
    g.resize(n + 1);
    vis.clear();
    vis.resize(n + 1);
    depth.clear();
    depth.resize(n + 1);
    for (int i = 0; i < m; i++){
        int a, b; cin >> a >> b;
        
        g[a].push_back(b);
        g[b].push_back(a);
    }
    int root = 0;
    for (int i = 0; i < n; i++){
        if ((long long)(g[i].size()) == 1) {
            root = i;
            break;
        }
    }
    depth[root] = 0;
    dfs(root, -1);
    
    cout << 6 * n << endl;
    for (int k = 0; k < 3 * n; k++){
        for (int i = 0; i < n; i++){
        cout << depth[i] / 2 << ' ';
        }
        cout << endl;
      
        for (int i = 0; i < n; i++){
            if (depth[i] == 0) cout << 1 << ' ';
            else cout << (depth[i] + 1) / 2 << ' ';
        }
        cout << endl;
        
    }
    
    return 0;
    
    
    
    
    
    
 }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 408 KB Output is correct
5 Correct 8 ms 348 KB Output is correct

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
3 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 4 ms 608 KB Output is correct
6 Correct 4 ms 604 KB Output is correct
7 Correct 2 ms 344 KB Output is correct

Subtask #4
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 408 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 4 ms 608 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 4 ms 516 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 6 ms 604 KB Output is correct
23 Correct 2 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 5 ms 348 KB Output is correct
28 Correct 7 ms 604 KB Output is correct
29 Correct 6 ms 604 KB Output is correct
30 Correct 4 ms 344 KB Output is correct
31 Correct 4 ms 344 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 7 ms 344 KB Output is correct
34 Correct 4 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 4 ms 604 KB Output is correct
37 Correct 4 ms 544 KB Output is correct
38 Correct 4 ms 344 KB Output is correct
39 Correct 4 ms 344 KB Output is correct
40 Correct 8 ms 604 KB Output is correct
41 Correct 4 ms 348 KB Output is correct
42 Correct 4 ms 348 KB Output is correct
43 Correct 5 ms 560 KB Output is correct
44 Correct 5 ms 600 KB Output is correct
45 Correct 5 ms 604 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 440 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 0 ms 504 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 6 ms 408 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Incorrect 0 ms 348 KB If people start at 0 and 2, then they can avoid each other
8 Halted 0 ms 0 KB -