Submission #1291183

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291183		kustov_vadim_533	Sorting (IOI15_sorting)	C++20	0 / 100	13 ms	500 KiB

sorting

#include <iostream>
#include <algorithm>
#include <math.h>
#include <vector>
#include <set>
#include <queue>
#include <array>
#include <map>
#include <random>
#include <bitset>
#include <stack>
#include <deque>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <chrono>
//#include "towns.h"

using namespace std;

typedef long long ll;
typedef long double ld;

mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for (int i = 0; i < M; ++i) {
		bool fl = true;
		for (int j = 0; j < N; ++j) {
			fl = fl && (S[j] == j);
		}
		if (fl) return i;

		swap(X[i], Y[i]);

		P[i] = 0;
		Q[i] = 0;

		for (int j = 0; j < N; ++j) {
			if (S[j] != j && !(j == 1 && S[j] == 0) && !(j == 0 && S[j] == 1)) {
				P[i] = j;
				Q[i] = S[j];
				swap(S[j], S[S[j]]);
				break;
			}
		}
	}
	return M;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26