oj.uz

Submission #411128

# Submission time Handle Problem Language Result Execution time Memory
411128 2021-05-24T12:10:27 Z blacktulip The Collection Game (BOI21_swaps) C++17
15 / 100
 106 ms 2376 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) {
	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=n;j>=1;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);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Correct
2 Correct 4 ms 824 KB Correct
3 Correct 21 ms 1260 KB Correct
4 Correct 103 ms 2272 KB Correct
5 Correct 102 ms 2268 KB Correct
6 Correct 94 ms 2308 KB Correct
7 Correct 106 ms 2268 KB Correct
8 Correct 95 ms 2272 KB Correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Correct
2 Correct 6 ms 712 KB Correct
3 Correct 23 ms 1276 KB Correct
4 Correct 93 ms 2264 KB Correct
5 Correct 92 ms 2356 KB Correct
6 Correct 101 ms 2356 KB Correct
7 Correct 94 ms 2264 KB Correct
8 Correct 98 ms 2376 KB Correct
9 Correct 94 ms 2320 KB Correct
10 Correct 90 ms 2256 KB Correct
11 Correct 102 ms 2280 KB Correct
12 Correct 90 ms 2248 KB Correct
13 Correct 92 ms 2268 KB Correct

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 328 KB Not correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 328 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 -