oj.uz

Submission #302531

# Submission time Handle Problem Language Result Execution time Memory
302531 2020-09-18T18:29:40 Z square1001 Sorting (IOI15_sorting) C++14
20 / 100
 19 ms 640 KB 
#include "sorting.h"
#include <random>
#include <vector>
#include <cassert>
#include <iostream>
#include <algorithm>
using namespace std;
mt19937 mt(2009190008);
int rand_rng(int l, int r) {
	uniform_int_distribution<int> p(l, r - 1);
	return p(mt);
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	fill(P, P + M, 0);
	fill(Q, Q + M, 0);
	if(is_sorted(S, S + N)) {
		return 0;
	}
	int L = 0;
	while(true) {
		swap(S[X[L]], S[Y[L]]);
		++L;
		vector<bool> vis(N, false);
		int cycles = 0;
		for(int i = 0; i < N; ++i) {
			if(vis[i]) continue;
			int pos = i;
			++cycles;
			while(!vis[pos]) {
				vis[pos] = true;
				pos = S[pos];
			}
		}
		int steps = N - cycles;
		if(L >= steps) break;
	}
	vector<bool> vis2(N, false);
	int cl = 0;
	for(int i = 0; i < L; ++i) {
		if(vis2[i]) continue;
		vector<int> path;
		int pos = i;
		while(!vis2[pos]) {
			path.push_back(pos);
			vis2[pos] = true;
			pos = S[pos];
		}
		for(int j = int(path.size()) - 1; j >= 1; --j) {
			P[cl] = path[j - 1];
			Q[cl] = path[j];
			swap(S[P[cl]], S[Q[cl]]);
			++cl;
		}
	}
	assert(is_sorted(S, S + N));
	for(int i = 0; i < L; ++i) {
		if(P[i] == Q[i]) continue;
		for(int j = L - 1; j >= i + 1; --j) {
			if(X[j] == Y[j]) continue;
			if(X[j] == P[i] && Y[j] != Q[i]) {
				P[i] = Y[j];
			}
			else if(X[j] == Q[i] && Y[j] != P[i]) {
				Q[i] = Y[j];
			}
			else if(Y[j] == P[i] && X[j] != Q[i]) {
				P[i] = X[j];
			}
			else if(Y[j] == Q[i] && X[j] != P[i]) {
				Q[i] = X[j];
			}
		}
	}
	return L;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Runtime error 1 ms 512 KB Execution killed with signal 11

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Runtime error 1 ms 512 KB Execution killed with signal 11

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 384 KB Output is correct
2 Correct 18 ms 384 KB Output is correct
3 Correct 19 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Runtime error 3 ms 640 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 384 KB Output is correct
2 Correct 18 ms 384 KB Output is correct
3 Correct 19 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Runtime error 3 ms 640 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -