Submission #1143172

#	Time	Username	Problem	Language	Result	Execution time	Memory
1143172		tudor_popescu	Triumphal arch (POI13_luk)	C++20	0 / 100	127 ms	2704 KiB

luk

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

struct jack{
    int a;
    int b;
}  v[300005];

bool cmp( jack x, jack y ) {
    return x.a < y.a;
}

int main() {
	int n, s, smax;
    int x;
    cin >> n;
    for ( int i = 0; i < n - 1; i++ ) {
        cin >> v[i].a >> v[i].b;
        if ( v[i].a > v[i].b ) {
            x = v[i].a;
            v[i].a = v[i].b;
            v[i].b = x;
        }
    }
    sort(v, v + (n-1), cmp);
    smax = s = 1;
    for ( int i = 0; i < n-2; i++ ) {
        if ( v[i].a == v[i + 1].a ) {
            s++;
        }
        else {
            if ( s > smax )
                smax = s;
            s = 1;
        }
    }
    if ( s > smax )
        smax = s;
    cout << smax;
    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