oj.uz

Submission #1088456

# Submission time Handle Problem Language Result Execution time Memory
1088456 2024-09-14T12:40:17 Z Pacybwoah Sorting (IOI15_sorting) C++17
54 / 100
 22 ms 676 KB 
#include "sorting.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<cassert>
using namespace std;
namespace{
	struct DSU{
		vector<int> dsu, sz;
		DSU(int n){
			dsu.resize(n + 1);
			sz.resize(n + 1);
			for(int i = 1; i <= n; i++) dsu[i] = i, sz[i] = 1;
		}
		int query(int x){
			if(x == dsu[x]) return x;
			dsu[x] = query(dsu[x]);
			return dsu[x];
		}
		void unite(int a, int b){
			a = query(a);
			b = query(b);
			if(a == b) return;
			if(sz[a] < sz[b]) swap(a, b);
			dsu[b] = a;
			sz[a] += sz[b];
		}
	};
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int n = N;
	vector<int> pos(n);
	for(int i = 0; i < n; i++) pos[S[i]] = i;
	vector<int> vec(n);
	bool flag1 = 1;
	for(int i = 0; i < n; i++) if(S[i] != i) flag1 = 0;
	if(flag1) return 0;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++) vec[j] = S[j], pos[S[j]] = j;
		vector<int> oripos;
		for(int j = 0; j < n; j++){
			swap(vec[X[j]], vec[Y[j]]);
			swap(pos[vec[X[j]]], pos[vec[Y[j]]]);
			if(j < i){
				swap(vec[P[j]], vec[Q[j]]);
				swap(pos[vec[P[j]]], pos[vec[Q[j]]]);
			}
			if(j == i){
				oripos = pos;
				bool flag = 0;
			}
		}
		P[i] = oripos[i];
		Q[i] = oripos[vec[i]];
		for(int j = 0; j < n; j++) vec[j] = S[j];
		for(int j = 0; j <= i; j++){
			swap(vec[X[i]], vec[Y[i]]);
			swap(vec[P[i]], vec[Q[i]]);
		}
		bool flag = 1;
		for(int j = 0; j < n; j++) if(j != vec[j]) flag = 0;
		if(flag) return i + 1;
	}
	return n;
    /*int l = 0, r = M;
	while(l < r){
		int mid = (l + r) >> 1;
		DSU dsu(n);
		vector<int> vec(n);
		for(int i = 0; i < n; i++) vec[i] = S[i];
		for(int i = 0; i < mid; i++) swap(vec[X[i]], vec[Y[i]]);
		for(int i = 0; i < n; i++) dsu.unite(vec[i], i);
		vector<bool> vis(n);
		int cc = 0;
		for(int i = 0; i < n; i++){
			if(!vis[dsu.query(i)]){
				vis[dsu.query(i)] = 1;
				cc++;
			}
		}
		if(n - cc <= mid) r = mid;
		else l = mid + 1;
	}
	DSU dsu(n);
	vector<int> pos(n);
	for(int i = 0; i < l; i++) swap(S[X[i]], S[Y[i]]);
	for(int i = 0; i < n; i++) dsu.unite(i, S[i]), pos[S[i]] = i;
	vector<vector<int>> children(n);
	for(int i = 0; i < n; i++) children[dsu.query(i)].push_back(i);
	int cur = 0;
	for(int i = 0; i < n; i++){
		if((int)children[i].size() >= 2){
			int sz = children[i].size();
			for(int j = 0; j < sz - 1; j++){
				int id = children[i][j];
				P[cur] = id;
				Q[cur] = pos[id];
				swap(S[P[cur]], S[Q[cur]]);
				swap(pos[S[P[cur]]], pos[S[Q[cur]]]);
				cur++;
			}
		}
	}
	while(cur < l - 1){
		P[cur] = 0;
		Q[cur] = 0;
		cur++;
	}
	return l;*/
}
// g++ -std=c++17 -Wall -Wextra -fsanitize=undefined -fsanitize=address -Wshadow -o run sorting.cpp grader.cpp

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:52:10: warning: unused variable 'flag' [-Wunused-variable]
   52 |     bool flag = 0;
      |          ^~~~
sorting.cpp:32:39: warning: unused parameter 'M' [-Wunused-parameter]
   32 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
18.0 / 18.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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 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 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 3 ms 676 KB Output is correct
24 Correct 3 ms 604 KB Output is correct
25 Correct 3 ms 604 KB Output is correct
26 Correct 3 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 568 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 568 KB Output isn't correct
2 Halted 0 ms 0 KB -