oj.uz

답안 #16664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16664 2015-09-04T01:24:19 Z suhgyuho_william 정렬하기 (IOI15_sorting) C++
0 / 100
 30 ms 384 KB 
#include "sorting.h"
#include <algorithm>
using namespace std;

int a[200002],location[200002];
int where[200002],last[200002];

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int i,n=N,R;
    int left,right;
    int cnt;

    left=0;
    right=M;
    for(R=0;R<=M;R++){

        for(i=0;i<n;i++){
            a[i]=S[i];
            location[a[i]]=i;
            where[a[i]]=i;
        }
        for(i=0;i<R;i++){
            location[a[X[i]]]=Y[i];
            location[a[Y[i]]]=X[i];
            swap(a[X[i]],a[Y[i]]);
        }
        cnt=-1;
        for(i=0;i<n;i++) last[i]=a[i];
        for(i=0;i<n;i++) a[i]=S[i];
        for(i=0;i<n;i++){
            if(location[i]==i) continue;
            cnt++;
            if(cnt>=R) break;
            where[a[X[cnt]]]=Y[cnt];
            where[a[Y[cnt]]]=X[cnt];
            swap(a[X[cnt]],a[Y[cnt]]);

            P[cnt]=where[i];
            Q[cnt]=where[last[i]];
            location[last[i]]=location[i];
            location[i]=i;

            where[a[P[cnt]]]=Q[cnt];
            where[a[Q[cnt]]]=P[cnt];
            swap(a[P[cnt]],a[Q[cnt]]);
        }
        for(i=cnt+1;i<R;i++) P[i]=Q[i]=0;
        if(cnt>=R) continue;
        break;
    }

	return R;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:10:9: warning: variable 'left' set but not used [-Wunused-but-set-variable]
     int left,right;
         ^~~~
sorting.cpp:10:14: warning: variable 'right' set but not used [-Wunused-but-set-variable]
     int left,right;
              ^~~~~

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 4 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Incorrect 2 ms 384 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 30 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -