Submission #1015982

#TimeUsernameProblemLanguageResultExecution timeMemory
1015982SulAMagic Show (APIO24_show)C++17
0 / 100
0 ms344 KiB
#include <bits/stdc++.h> #include "Alice.h" using namespace std; vector<pair<int, int>> Alice() { long long x = setN(5000); vector<pair<int,int>> tree; for (int i = 1; i <= x; i++) { if (i != x) { tree.push_back({i, x}); } } return tree; }
#include <bits/stdc++.h> #include "Bob.h" using namespace std; long long Bob(vector<pair<int,int>> tree) { int cnt[5001] = {}; for (auto [u,v] : tree) { cnt[u]++, cnt[v]++; } return max_element(cnt, cnt+5001) - cnt; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...