Submission #1087022

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1087022	2024-09-12T04:18:09 Z	the_coding_pooh	Sorting (IOI15_sorting)	C++14	20 / 100	1 ms	604 KB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#define uwu return 0;
 
using namespace std;
 
const int SIZE = 2e5 + 5;
 
int s[SIZE], tar[SIZE], x[SIZE], y[SIZE], p[SIZE], q[SIZE], pos_of_val[SIZE];
 
 
void build(int M){
	for(int i = M - 1; i >= 0; i--){
		swap(tar[x[i]], tar[y[i]]);
	}
	return;
}
 
int get_sequence(int N, int M){
	int cnt = 0;	
	for(int i = 0; i < N; i++){
		if(s[i] != tar[i]){
			for(int j = i + 1; j < N; j++){
				if(s[j] == tar[i]){
					p[cnt] = i;
					q[cnt] = j;
					cnt++;
					swap(s[i], s[j]);
					break;
				}
			}	
		}
	}
	return cnt;
}
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	for(int i = 0; i < N; i++){
		tar[i] = i;
		s[i] = S[i];
	}
	for(int i = 0; i < M; i++){
		x[i] = X[i];
		y[i] = Y[i];
	}
	build(M);
	int k = get_sequence(N, M);
	for(int i = 0; i < k; i++){
		P[i] = p[i];
		Q[i] = q[i];
	}
	for(int i = 0; i < N; i++){
		S[i] = i;
	}
	return k;
}

Compilation message

sorting.cpp: In function 'int get_sequence(int, int)':
sorting.cpp:19:29: warning: unused parameter 'M' [-Wunused-parameter]
   19 | int get_sequence(int N, int M){
      |                         ~~~~^

Subtask #1

8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	360 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct

Subtask #3

0 / 16.0

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

Subtask #4

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	360 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Incorrect	1 ms	348 KB	Output isn't correct
15	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

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

Subtask #6

0 / 26.0

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