oj.uz

Submission #428004

# Submission time Handle Problem Language Result Execution time Memory
428004 2021-06-15T07:05:55 Z haxorman Sorting (IOI15_sorting) C++14
20 / 100
 168 ms 356 KB 
#include "sorting.h"
#include "bits/stdc++.h"
using namespace std;

const int mxN = 2e5 + 7;

int n, m, arr[mxN];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n = N, m = M;

	for (int i = 0; i < n; ++i) {
		arr[i] = S[i];
	}
	sort(S, S + n);

	int R = 0, ind = 0;
	bool subtask_3 = (Y[ind] != 0);

	swap(arr[X[ind]], arr[Y[ind]]);
	int start = 0;
	if (subtask_3) {
		for (int i = 0; i < 2; ++i) {
			for (int j = 0; j < n; ++j) {
				if (arr[j] == S[i] && j != 1) {
					swap(arr[j], arr[1]);
					P[ind] = j, Q[ind] = 1;
					++R;
					++ind;
					break;
				}
			}
			swap(arr[X[ind]], arr[Y[ind]]);
		}
		start = 2;
	}


	for (int iter = 1; iter <= 50; ++iter) {
		for (int i = start; i < n; ++i) {
			for (int j = 0; j < n; ++j) {
				if (arr[j] == S[i] && i != j) {
					swap(arr[j], arr[i]);
					P[ind] = j, Q[ind] = i;
					++R;
					++ind;
					break;
				}
			}
		}
		swap(arr[X[ind]], arr[Y[ind]]);
	}

	if (arr[0] != 0) {
		P[ind] = 0, Q[ind] = 1;
		++R;
		++ind; 
	}

	return R;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Incorrect 1 ms 204 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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