#include "Alice.h"
#include <vector>
using namespace std;
vector<pair<int, int>> Alice() {
long long x = setN(5000);
vector<pair<int, int>> r;
for (int i = 1; i < 5001; i++) if (i != x) r.emplace_back(i, x);
return r;
}
#include "Bob.h"
#include <vector>
#include <algorithm>
using namespace std;
long long Bob(vector<pair<int, int>> V) {
int e[4] = {V[0].first, V[0].second, V[1].first, V[1].second};
sort(e, e + 4);
return e[0] == e[1] ? e[1] : e[2];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |