#include<bits/stdc++.h>
#include "Alice.h"
using namespace std;
typedef long long ll;
vector<pair<int, int>>Alice(){
ll 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<bits/stdc++.h>
#include "Bob.h"
using namespace std;
typedef long long ll;
ll Bob(vector<pair<int, int>>V){
vector<int>d(5001, 0);
for(int i = 0; i < V.size(); i++){
d[V[i].first]++;
d[V[i].second]++;
}
return max_element(d.begin(), d.end()) - d.begin();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |