oj.uz

Submission #590882

# Submission time Handle Problem Language Result Execution time Memory
590882 2022-07-06T12:44:44 Z FatihSolak Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 17144 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
bool ck(int n,int s[],int m,int x[],int y[]){
	if(is_sorted(s,s+n))
		return 1;
	vector<int> fnal;
	vector<int> now;
	vector<int> pfnal(n,0);
	vector<int> pnow(n,0);
	int cnt = 0;
	for(int i = 0;i<n;i++){
		fnal.push_back(s[i]);
		pfnal[s[i]] = i;
		now.push_back(s[i]);
		pnow[s[i]] = i;
		cnt += (s[i] == i);
	}
	for(int i = 0;i<m;i++){
		swap(pfnal[fnal[x[i]]],pfnal[fnal[y[i]]]);
		swap(fnal[x[i]],fnal[y[i]]);
	}
	int num = 0;
	for(int i = 0;i<m;i++){
		if(pnow[now[x[i]]] == now[x[i]])cnt--;
		if(pnow[now[y[i]]] == now[y[i]])cnt--;
		swap(now[x[i]],now[y[i]]);
		swap(pnow[now[x[i]]],pnow[now[y[i]]]);
		if(pnow[now[x[i]]] == now[x[i]])cnt++;
		if(pnow[now[y[i]]] == now[y[i]])cnt++;
		while(num < n){
			int ps1 = pnow[num];
			int ps2 = pnow[fnal[num]];
			if(ps1 == ps2){
				num++;
				continue;
			}
			if(pnow[now[ps1]] == now[ps1])cnt--;
			if(pnow[now[ps2]] == now[ps2])cnt--;
			swap(pnow[now[ps1]],pnow[now[ps2]]);
			swap(now[ps1],now[ps2]);
			if(pnow[now[ps1]] == now[ps1])cnt++;
			if(pnow[now[ps2]] == now[ps2])cnt++;
			int tmp = pfnal[num];
			swap(pfnal[fnal[num]],pfnal[num]);
			swap(fnal[num],fnal[tmp]);
			num++;
			break;
		}
		if(cnt == n)
			return 1;
	}
	return 0;
}
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]) {
	/*int l = 0,r = m;
	while(l < r){
		int mm = (l + r)/2;
		if(ck(n,s,mm,x,y)){
			r = mm;
		}
		else l = mm+1;
	}
	m = l;*/
	for(int i = n;i>=1;i--){
		if(ck(n,s,i,x,y)){
			m = i;
		}
	}
	if(is_sorted(s,s+n))
		return 0;
	for(int i = 0;i<m;i++){
		p[i] = q[i] = 0;
	}
	vector<int> fnal;
	vector<int> now;
	vector<int> pfnal(n,0);
	vector<int> pnow(n,0);
	int cnt = 0;
	for(int i = 0;i<n;i++){
		fnal.push_back(s[i]);
		pfnal[s[i]] = i;
		now.push_back(s[i]);
		pnow[s[i]] = i;
		cnt += (s[i] == i);
	}
	for(int i = 0;i<m;i++){
		swap(pfnal[fnal[x[i]]],pfnal[fnal[y[i]]]);
		swap(fnal[x[i]],fnal[y[i]]);
	}
	int num = 0;
	for(int i = 0;i<m;i++){
		if(pnow[now[x[i]]] == now[x[i]])cnt--;
		if(pnow[now[y[i]]] == now[y[i]])cnt--;
		swap(now[x[i]],now[y[i]]);
		swap(pnow[now[x[i]]],pnow[now[y[i]]]);
		if(pnow[now[x[i]]] == now[x[i]])cnt++;
		if(pnow[now[y[i]]] == now[y[i]])cnt++;
		while(num < n){
			int ps1 = pnow[num];
			int ps2 = pnow[fnal[num]];
			if(ps1 == ps2){
				num++;
				continue;
			}
			p[i] = ps1;
			q[i] = ps2;
			if(pnow[now[ps1]] == now[ps1])cnt--;
			if(pnow[now[ps2]] == now[ps2])cnt--;
			swap(pnow[now[ps1]],pnow[now[ps2]]);
			swap(now[ps1],now[ps2]);
			if(pnow[now[ps1]] == now[ps1])cnt++;
			if(pnow[now[ps2]] == now[ps2])cnt++;
			int tmp = pfnal[num];
			swap(pfnal[fnal[num]],pfnal[num]);
			swap(fnal[num],fnal[tmp]);
			num++;
			break;
		}
		if(cnt == n)
			return i+1;
	}
	assert(0);
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 304 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 300 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 304 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 300 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 296 KB Output is correct
21 Correct 7 ms 468 KB Output is correct
22 Correct 8 ms 436 KB Output is correct
23 Correct 8 ms 468 KB Output is correct
24 Correct 8 ms 436 KB Output is correct
25 Correct 7 ms 424 KB Output is correct
26 Correct 9 ms 540 KB Output is correct
27 Correct 9 ms 540 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 468 KB Output is correct
2 Correct 101 ms 444 KB Output is correct
3 Correct 96 ms 428 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 126 ms 340 KB Output is correct
6 Correct 117 ms 436 KB Output is correct
7 Correct 126 ms 460 KB Output is correct
8 Correct 103 ms 432 KB Output is correct
9 Correct 104 ms 432 KB Output is correct
10 Correct 105 ms 432 KB Output is correct
11 Correct 118 ms 444 KB Output is correct
12 Correct 125 ms 444 KB Output is correct
13 Correct 124 ms 440 KB Output is correct
14 Correct 58 ms 436 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 468 KB Output is correct
2 Correct 101 ms 444 KB Output is correct
3 Correct 96 ms 428 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 126 ms 340 KB Output is correct
6 Correct 117 ms 436 KB Output is correct
7 Correct 126 ms 460 KB Output is correct
8 Correct 103 ms 432 KB Output is correct
9 Correct 104 ms 432 KB Output is correct
10 Correct 105 ms 432 KB Output is correct
11 Correct 118 ms 444 KB Output is correct
12 Correct 125 ms 444 KB Output is correct
13 Correct 124 ms 440 KB Output is correct
14 Correct 58 ms 436 KB Output is correct
15 Execution timed out 1051 ms 17144 KB Time limit exceeded
16 Halted 0 ms 0 KB -