Submission #803011

# Submission time Handle Problem Language Result Execution time Memory
803011 2023-08-02T18:02:29 Z BT21tata Sorting (IOI15_sorting) C++17
54 / 100
8 ms 468 KB
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int cur[200005];

int findSwapPairs(int n, int s[], int m, int x[], int y[], int P[], int Q[])
{
	m=n;
	int r=0;
	for(int i=0; i<m; i++)
	{
		swap(s[x[i]], s[y[i]]);
		for(int j=0; j<n; j++)
			cur[j]=s[j];
		for(int j=i+1; j<m; j++)
			swap(cur[x[j]], cur[y[j]]);

		int pos1=0, pos2=0;
		for(int j=0; j<n; j++)
		{
			if(s[j]==cur[i]) pos1=j;
			if(s[j]==i) pos2=j;
		}
		P[r]=pos1;
		Q[r]=pos2;
		swap(s[P[r]], s[Q[r]]);
		r++;
		bool f=1;
		for(int j=0; j+1<n; j++)
			if(s[j]>s[j+1]) f=0;
		if(f) break;
	}
	return r;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 312 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 448 KB Output is correct
25 Correct 2 ms 436 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 2 ms 456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -