oj.uz

Submission #868153

# Submission time Handle Problem Language Result Execution time Memory
868153 2023-10-30T13:48:54 Z waldi Sorting (IOI15_sorting) C++17
100 / 100
 221 ms 27264 KB 
#include "sorting.h"
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define debug(a) cerr << #a << ": " << a << "\n";
#define fi first
#define se second
#define ssize(x) (int(x.size()))
#define all(x) x.begin(),x.end()
using namespace std;
typedef pair<int, int> pii;

int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]){
	auto sprawdz = [&](int wyn){
		vector<int> co_winno(n), gdzie_winno(n);
		REP(i, n) co_winno[i] = gdzie_winno[i] = i;
		for(int i = wyn; ~--i;){
			int a = x[i], b = y[i];
			swap(co_winno[a], co_winno[b]);
			swap(gdzie_winno[co_winno[a]], gdzie_winno[co_winno[b]]);
		}
		
		vector<int> co_jest(n), gdzie_jest(n);
		REP(i, n) co_jest[i] = s[i], gdzie_jest[s[i]] = i;
		
		vector<int> graf(n);// [wartosc teraz] = wartosc na koncu
		REP(i, n) graf[i] = co_winno[gdzie_jest[i]];
		
		vector<bool> odw(n, 0);
		vector<pii> zmiany_wart;
		REP(i, n) if(!odw[i]){
			for(int w = i; !odw[w]; w = graf[w]) odw[w] = 1, zmiany_wart.emplace_back(w, graf[w]);
			zmiany_wart.pop_back();
		}
		if(ssize(zmiany_wart) > wyn) return 0;
		while(ssize(zmiany_wart) < wyn) zmiany_wart.emplace_back(0, 0);
		reverse(all(zmiany_wart));
		
		REP(i, wyn){
			swap(co_jest[x[i]], co_jest[y[i]]);
			swap(gdzie_jest[co_jest[x[i]]], gdzie_jest[co_jest[y[i]]]);
			
			int w1 = zmiany_wart[i].fi, w2 = zmiany_wart[i].se;
			int poz1 = gdzie_jest[w1], poz2 = gdzie_jest[w2];
			p[i] = poz1, q[i] = poz2;
			swap(gdzie_jest[w1], gdzie_jest[w2]);
			swap(co_jest[poz1], co_jest[poz2]);
		}
		return 1;
	};
	
	int wyn = -1;
	/*FOR(i, 0, m){
		if(sprawdz(i)){wyn = i; break;}
	}*/
	for(int lewo = 0, prawo = m; lewo <= prawo;){
		int sr = (lewo+prawo)>>1;
		if(sprawdz(sr)) wyn = sr, prawo = sr-1;
		else lewo = sr+1;
	}
	return wyn;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 708 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 860 KB Output is correct
24 Correct 1 ms 860 KB Output is correct
25 Correct 1 ms 704 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 600 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 520 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 520 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 137 ms 22908 KB Output is correct
16 Correct 158 ms 24108 KB Output is correct
17 Correct 169 ms 25716 KB Output is correct
18 Correct 73 ms 22392 KB Output is correct
19 Correct 145 ms 24664 KB Output is correct
20 Correct 149 ms 26280 KB Output is correct
21 Correct 142 ms 26456 KB Output is correct
22 Correct 144 ms 20568 KB Output is correct
23 Correct 168 ms 26040 KB Output is correct
24 Correct 168 ms 27008 KB Output is correct
25 Correct 167 ms 26888 KB Output is correct
26 Correct 146 ms 25280 KB Output is correct
27 Correct 135 ms 25660 KB Output is correct
28 Correct 156 ms 26896 KB Output is correct
29 Correct 166 ms 25824 KB Output is correct
30 Correct 112 ms 24568 KB Output is correct
31 Correct 168 ms 26520 KB Output is correct
32 Correct 152 ms 25244 KB Output is correct
33 Correct 221 ms 26288 KB Output is correct
34 Correct 157 ms 25948 KB Output is correct
35 Correct 143 ms 24284 KB Output is correct
36 Correct 66 ms 23968 KB Output is correct
37 Correct 178 ms 27264 KB Output is correct
38 Correct 165 ms 26072 KB Output is correct
39 Correct 166 ms 26556 KB Output is correct