oj.uz

Submission #421211

# Submission time Handle Problem Language Result Execution time Memory
421211 2021-06-08T21:26:52 Z Pbezz Sorting (IOI15_sorting) C++14
0 / 100
 2 ms 332 KB 
#include "sorting.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;

const ll MAXN=2e5+5;
const ll INF=1e9+7;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int i,k,R=0;
	if(N==1)return 0;

if(M>0 && Y[0]==1){
swap(S[0],S[1]);

for(k=0;k<N;k++){
if(S[k]==0)break;
}

P[R]=k;
Q[R]=1;
R++;
swap(S[k],S[1]);
swap(S[0],S[1]);
//agora, 1 esta em posiçao e vamos meter o 2

for(k=0;k<N;k++){
if(S[k]==1)break;
}

P[R]=k;
Q[R]=1;
R++;
swap(S[k],S[1]);
//esta tudo bem, continuar

for(i=3;i<=N;i++){//find i, send it to ith position

for(k=0;k<N;k++){
if(S[k]==i-1)break;
}

P[R]=k;
Q[R]=i-1;
R++;
swap(S[k],S[i-1]);

}

if(R%2==1){
P[R]=0;
Q[R]=0;
R++;
}

}else{//his moves are redundant

for(i=0;i<N-1;i++){//find i, send it to ith position

for(k=0;k<N;k++){
if(S[k]==i)break;
}

P[R]=k;
Q[R]=i;
R++;
swap(S[k],S[i]);

}
/*
for(i=0;i<N;i++){
cout<<S[i]<<" ";
}cout<<endl;*/

}

while(R>0&&P[R-1]==Q[R-1])R--;

	return R;
}

Compilation message

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

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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