Submission #1136809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136809		aguss	Triumphal arch (POI13_luk)	C++20	0 / 100	108 ms	18772 KiB

luk

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

#define raya() cout << endl << "====================================" << endl
#define dbg(x) cerr << #x << ": " << x << endl;

using namespace std;
using ll = long long;

const ll MOD = 1e9 + 7;
const ll INF = 1e18 + 5;

void solve(){
    int n;
    cin >> n;    
    vector<vector<int>> arr(n);
    vector<int> depth(n, 0);
    vector<bool> vis(n, 0);
    for(int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        arr[a].push_back(b);
        arr[b].push_back(a);
    }
    queue<int> q;
    map<int, int> ma;
    int ans = 0;
    q.push(0);
    vis[0] = 1;
    while(!q.empty()){
        int a = q.front();
        q.pop();
        for(int x : arr[a]){
            if(vis[x]){
                continue;
            }
            vis[x] = 1;
            depth[x] = depth[a] + 1;
            ans = max(ans, ++ma[depth[x]]);
            q.push(x);
        }
    }
    cout << ans;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    solve();
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10