Submission #1183033

#TimeUsernameProblemLanguageResultExecution timeMemory
1183033anmattroiMagic Show (APIO24_show)C++17
5 / 100
2 ms380 KiB
#include "Alice.h"
#include <bits/stdc++.h>

using namespace std;

vector<pair<int,int> > Alice(){
    int64_t X = setN(5000);
    vector<pair<int, int> > ans;

    for (int i = 1; i <= 5000; i++)
        if (i != X)
            ans.emplace_back(i, X);
    return ans;
}

#include "Bob.h"
#include <bits/stdc++.h>

using namespace std;


long long Bob(vector<pair<int,int>> V){
    vector<int> deg(5001, 0);
    for (auto [u, v] : V) {
        ++deg[u];
        ++deg[v];
    }
    pair<int, int> best = {-1, -1};
    for (int i = 1; i <= 5000; i++) best = max(best, pair<int, int> {deg[i], i});
    return best.second;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...