| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 411123 | blacktulip | The Collection Game (BOI21_swaps) | C++17 | 0 ms | 0 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 "swaps.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair< lo,lo > PII;
#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)
const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n,m,b[li],a[li],k,flag,t;
int cev;
string s;
vector<int> v;
int cmp[li][li],vis[li],viss[li][li];
void solve(int n, int V) {
vector<int> v;
int sayac=0;
while(1){
sayac++;
FOR vis[i]=0;
vector<pair<int,int>> vv;
int flagg=0;
for(int i=1;i<=n;i++){
//~ cout<<"**\n";
if(vis[i])continue;
for(int j=1;j<=n;j++){
if(vis[j])continue;
if(i==j)continue;
if(viss[i][j] || viss[j][i])continue;
viss[i][j]=1;
vis[i]=1;
vis[j]=1;
schedule(i,j);
flagg=1;
vv.pb({i,j});
break;
//~ printf("%d %d %d\n",i,j,sayac);
}
}
if(flagg==0)break;
v=visit();
int say=0;
for(auto go:vv){
if(v[say]==0){
cmp[go.se][go.fi]=1;
}
else{
cmp[go.fi][go.se]=1;
}
say++;
}
}
vector<int> vec;
vector<pair<int,int>> vv;
for(int i=1;i<=n;i++){
cev=0;
for(int j=1;j<=n;j++){
cev+=cmp[i][j];
}
vv.pb({cev,i});
}
sort(vv.begin(),vv.end());
reverse(vv.begin(),vv.end());
for(auto go:vv)vec.pb(go.se);
answer(vec);
}