#include <bits/stdc++.h>
#include "Alice.h"
#define vi vector<int>
#define vvi vector<vi>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define lcm(a,b) a*b/__gcd(a,b);
//#define mid (l+r)/2
#define no cout<<"No\n";
#define yes cout<<"Yes\n";
using namespace std;
vector<pair<int,int>> Alice(){
int n=5000;
long long x = setN(5000);
vector<pair<int,int>> v;
for(int i=1;i<=n;i++)
{
if(x==i)
continue;
v.push_back({x,i});
}
return v;
}
#include "Bob.h"
#include <bits/stdc++.h>
#define vi vector<int>
#define vvi vector<vi>
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define F first
#define S second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define lcm(a,b) a*b/__gcd(a,b);
//#define mid (l+r)/2
#define no cout<<"No\n";
#define yes cout<<"Yes\n";
using namespace std;
long long Bob(vector<std::pair<int,int>> V){
return V[0].F;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |