oj.uz

Submission #1087020

# Submission time Handle Problem Language Result Execution time Memory
1087020 2024-09-12T04:13:48 Z the_coding_pooh Sorting (IOI15_sorting) C++14
20 / 100
 1 ms 604 KB 
#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;
}
 
void get_sequence(int N, int M){
	for(int i = 0; i < M; i++){
		swap(s[x[i]], s[y[i]]);
		for(int j = 0; j < N; j++){
			pos_of_val[s[j]] = j;
		}
		swap(tar[x[i]], tar[y[i]]);
		for(int j = 0; j < N; j++){
			if(s[j] != tar[j]){
				swap(s[j], s[pos_of_val[tar[j]]]);
				p[i] = j;
				q[i] = pos_of_val[tar[j]];
				break;
			}
		}
	}
	return;
}
 
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int cnt = 0;	
	for(int i = 0; i < N; i++){
		if(S[i] != i){
			for(int j = i + 1; j < N; j++){
				if(S[j] == i){
					P[cnt] = i;
					Q[cnt] = j;
					cnt++;
					swap(S[i], S[j]);
					break;
				}
			}	
		}
	}
	return cnt;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:38:39: warning: unused parameter 'M' [-Wunused-parameter]
   38 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:38:46: warning: unused parameter 'X' [-Wunused-parameter]
   38 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:38:55: warning: unused parameter 'Y' [-Wunused-parameter]
   38 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 16.0

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