Submission #1185892

#TimeUsernameProblemLanguageResultExecution timeMemory
1185892MJersahMagic Show (APIO24_show)C++20
5 / 100
2 ms384 KiB
#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(long long i=1;i<=n;i++)
    {
        if(x==i)
            continue;
        int u=min(x,i),j=max(i,x);
        v.push_back({u,j});
    }
    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){
    vi vis(5000);
    for(pair<int,int> i:V)
        vis[i.F]++,vis[i.S]++;
    int mx=0,id=0;
    for(int i=1;i<=5000;i++)
    {
        if(vis[i]>mx)
        {
            mx=vis[i];
            id=i;
        }
    }
    return id;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...