Submission #1136901

#	Time	Username	Problem	Language	Result	Execution time	Memory
1136901		Matbubble	Triumphal arch (POI13_luk)	C++20	0 / 100	83 ms	17344 KiB

luk

#include <iostream>
#include <iomanip>
#include <string>
#include <math.h>
#include <algorithm>
#include <cstring>
#include <numeric>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define dbg(x) cerr<<#x<<": "<<x<<"\n";

/*  
MC lover
*/

void solve(){
    int n; cin>>n;
    int ans=0;
    vector<vector<int>>g(n+1);
    for(int i=1 ; i<n ; i++){
        int a, b; cin>>a>>b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    vector<bool>vis(n+1);
    auto dfs=[&](auto &&self, int u, int root)->void{
        ans=max(ans, (int)g[u].size()-1);
        for(int v:g[u]){
            if(v==root) continue;
            self(self, v, u);
        }
    };
    dfs(dfs, 1, -1);
    cout<<ans<<"\n";
}

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

• 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