oj.uz

답안 #135299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135299 2019-07-24T02:39:37 Z Boxworld 정렬하기 (IOI15_sorting) C++14
20 / 100
 3 ms 376 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int ooo=1;
	for (int i=0;i<N;i++)
	if (S[i]!=i)ooo=0;
	if (ooo)return 0;
    for (int i=0;i<M;i++){
        int p1=X[i],p2=Y[i],start=0,ok=1;
        swap(S[p1],S[p2]);
     //   printf("Now:");for (int i=0;i<N;i++)printf("%d ",S[i]);printf("\n");
        if (p1+p2==1&&S[p1]+S[p2]==1)start=2;
        for (int j=start;j<N;j++)
        if (S[j]!=j){
            P[i]=j;Q[i]=S[j];
      //      printf("SWAP#%d:S[%d]=%d S[%d]=%d\nNOW:",i,j,S[j],S[j],S[S[j]]);
            swap(S[j],S[S[j]]);
        //    for (int i=0;i<N;i++)printf("%d ",S[i]);printf("\n");
            ok=0;
            int oo=1;
            for (int i=0;i<N;i++)
            if (S[i]!=i){oo=0;break;}
            if (oo)return i+1;
            break;
        }
        if (ok){
            if (S[0]>S[1]){
                P[i]=0;Q[i]=1;
       //         printf("SWAP%d:S[%d]=%d S[%d]=%d\nNOW:",i,0,S[0],1,S[1]);
                swap(S[0],S[1]);
       //         for (int j=0;j<N;i++)printf("%d ",S[i]);printf("\n");
                return i+1;
            }else {
                P[i]=Q[i]=0;
       //         printf("SWAP#%d:S[%d]=%d S[%d]=%d\nNOW:",i,0,0,0,0);
                return i+1;
            }
        }
    }
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:23:22: warning: declaration of 'i' shadows a previous local [-Wshadow]
             for (int i=0;i<N;i++)
                      ^
sorting.cpp:10:14: note: shadowed declaration is here
     for (int i=0;i<M;i++){
              ^
sorting.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Incorrect 3 ms 376 KB Output isn't correct
4 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 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Incorrect 3 ms 376 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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