oj.uz

Submission #1098374

# Submission time Handle Problem Language Result Execution time Memory
1098374 2024-10-09T10:52:17 Z alexander707070 Sorting (IOI15_sorting) C++14
20 / 100
 6 ms 600 KB 
#include<bits/stdc++.h>
#include "sorting.h"

#define MAXN 200007
using namespace std;

int n,m,q;
int pos[MAXN],s[MAXN];

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

	if(n==1)return 0;

	for(int i=0;i<n;i++)s[i]=S[i];

	for(int i=0;i<n;i++){
		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);

		for(int f=0;f<n;f++){
			if(s[f]==i){

				P[i]=i; Q[i]=f;
				swap(s[i],s[f]);
			}
		}
	}

	q=n;
	while(q>0 and P[q-1]==Q[q-1]){
		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);
		q--;
	}

	if(s[0]>s[1]){
		q++;
		P[q-1]=Q[q-1]=0;
	}

	for(int i=0;i<n;i++)s[i]=S[i];
	
	for(int i=0;i<q;i++){
		for(int t=0;t<n-1;t++){
			if(s[t]>s[t+1])break;
			else if(t==n-2)return i;
		}

		if(X[0]==0 and Y[0]==1)swap(s[0],s[1]);
		swap(s[P[i]],s[Q[i]]);
	}

	return 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 1 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 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 344 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 0 ms 344 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 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 600 KB Output is correct
10 Correct 0 ms 344 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 0 ms 344 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 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 6 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -