oj.uz

Submission #1090661

# Submission time Handle Problem Language Result Execution time Memory
1090661 2024-09-18T15:07:35 Z owoovo Sorting (IOI15_sorting) C++17
20 / 100
 1 ms 604 KB 
#include "sorting.h"

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int u=1;
	for(int i=0;i<M;i++)if(X[i]!=0||Y[i]!=0)u=0;
	int ans=0,vis[110]={0};
	if(u==1){
		for(int i=0;i<N;i++){
			if(vis[i]||S[i]==i)continue;
			int now=S[i];
			vis[i]=1;
			while(now!=i){
				vis[now]=1;
				P[ans]=now;
				Q[ans]=i;
				now=S[now];
				ans++;
			}
		}
		return ans;

	}else{
		int p[110];
		for(int i=0;i<N;i++){
			p[S[i]]=i;
		}
		for(int i=0;i<N;i++){
			if(vis[i]||S[i]==i)continue;
			int now=p[i];
			vis[i]=1;
			while(now!=i){
				ans++;
				vis[now]=1;
				if(now==0||now==1){
					P[ans-1]=now^(ans%2);
				}
				if(i==0||i==1){
					Q[ans-1]=i^(ans%2);
				}
				now=p[now];
			}
		}
		if(ans%2==1){
			P[ans]=0;
			Q[ans]=0;
			ans++;
		}
		return ans;

	}
}

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 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 1 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 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 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 1 ms 344 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 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 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 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -