oj.uz

Submission #411142

# Submission time Handle Problem Language Result Execution time Memory
411142 2021-05-24T12:25:08 Z blacktulip The Collection Game (BOI21_swaps) C++17
0 / 100
 2 ms 328 KB 
#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 = 505;
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) {
	srand(time(NULL));
	vector<int> v;
	int sayac=0;
	while(1){
		sayac++;
		if(sayac>V)break;
		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);
				for(int ii=1;ii<=n;ii++){
					swap(cmp[i][ii],cmp[j][ii]);
				}
				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);
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 252 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 252 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 KB Not correct
2 Halted 0 ms 0 KB -