Submission #1064781

#	Time	Username	Problem	Language	Result	Execution time	Memory
1064781		sunboi	Make them Meet (EGOI24_makethemmeet)	C++17	0 / 100	0 ms	348 KiB

Main

#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 << 3*n*10 << endl;
    for (int i = 0; i < 10; i++){
        for (int i = 0; i < n; i++){
        cout << depth[i] / 2 << ' ';
        }
        cout << endl;
        for (int i = 0; i < n; i++){
            cout << (depth[i] + 1) / 2 << ' ';
        }
        cout << endl;
        
        for (int i = 0; i < n; i++){
            if (depth[i] <= 1) cout << n << ' ';
            else cout << i << ' ';
        }
        cout << endl;
    }
    
    
    
 }

• Subtask 1: 0 / 10
• Subtask 2: 0 / 13
• Subtask 3: 0 / 11
• Subtask 4: 0 / 36
• Subtask 5: 0 / 30