Submission #1143345

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143345		Luca7	Triumphal arch (POI13_luk)	C++20	0 / 100	149 ms	18348 KiB

luk

#include<iostream>
#include<vector>
using namespace std;


vector<vector<int>> graph;
vector<int> vlev;


int main(){
    int i,j,n,u,v,sum=0;

    cin>>n;
    graph.resize(n+1);
    vlev.resize(n+1,0);
    for(i=1;i<n;i++){
        cin>>u>>v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    int res=0;
    for(i=1;i<=n;i++){
        u=graph[i].size();
        res=max(res,u-1);
    }
    cout<<res;
    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