Submission #1143240

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143240		snpmrnhlol	Triumphal arch (POI13_luk)	C++20	0 / 100	172 ms	17368 KiB

luk

#include<bits/stdc++.h>
using namespace std;
const int N = 3e5;
vector <int> e[N];
int main(){
    int n;
    cin>>n;
    for(int i = 0;i < n - 1;i++){
        int u, w;
        cin>>u>>w;
        u--;w--;
        e[u].push_back(w);
        e[w].push_back(u);
    }
    int ans = 0;
    ans = max(ans, (int)e[0].size());
    for(int i = 1;i < n;i++){
        ans = max(ans, (int)e[i].size() - 1);
    }
    cout<<ans<<'\n';
    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