# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078271 | Marco_Escandon | Magic Show (APIO24_show) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
std::vector<std::pair<int,int>> Alice(){
long long x = setN(5000);
ll n=5000;
vector<pair<ll,ll>> temp;
for(int i=1; i<n; i++)
{
temp.push_back({i,n});
}
return temp;
}
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
long long Bob(std::vector<std::pair<int,int>> V){
vector<ll> v(5001,0);
for(auto i:V)
{
v[i.first]++;
v[i.second]++;
}
pair<ll,ll> bs;
for(int i=0; i<5001; i++)
{
bs=max(make_pair(v[i],i),bs);
}
return bs.second; // change this into your code
}