| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1078336 | Maite_Morale | Magic Show (APIO24_show) | C++17 | 2 ms | 832 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 long long ll;
std::vector<std::pair<int,int>> Alice();
long long setN(int n);
long long Bob(std::vector<std::pair<int,int>> V);
const ll nodes=5000;
std::vector<std::pair<int,int>> Alice(){
long long x = setN(nodes);
std::vector<std::pair<int,int>> r={};
for(int i=1;i<=nodes;i++)if(x!=i)r.push_back({x,i});
return r;
}
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
std::vector<std::pair<int,int>> Alice();
long long setN(int n);
long long Bob(std::vector<std::pair<int,int>> V);
long long Bob(std::vector<std::pair<int,int>> V){
map<ll,ll> mp;
for(int i=0;i<V.size();i++){
mp[V[i].first]++;mp[V[i].second]++;
if(mp[V[i].first]==2)return V[i].first;
if(mp[V[i].second]==2)return V[i].second;
}
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
