oj.uz

답안 #958590

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958590 2024-04-06T05:19:13 Z 12345678 정렬하기 (IOI15_sorting) C++17
0 / 100
 3 ms 348 KB 
#include "sorting.h"
#include <bits/stdc++.h>
 
using namespace std;
 
const int nx=505;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int idx[nx], s[nx], cnt=0;
    for (int i=0; i<N; i++) idx[i]=i, s[i]=S[i];
    for (int i=N-1; i>=0; i--) swap(idx[X[i]], idx[Y[i]]);
    for (int i=0; i<N; i++)
    {
        //swap(idx[X[i]], idx[Y[i]]);
        //swap(s[X[i]], s[Y[i]]);
        for (int j=0; j<N; j++) 
        {
            if (S[j]==i)
            {
                P[cnt]=i;
                Q[cnt]=j;
                //cout<<"cnt "<<cnt<<' '<<i<<' '<<j<<'\n';
                cnt++;
                swap(S[i], S[j]);
                break;
            }
        }
    }
    return cnt;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:9:18: warning: variable 's' set but not used [-Wunused-but-set-variable]
    9 |     int idx[nx], s[nx], cnt=0;
      |                  ^
sorting.cpp:8:39: warning: unused parameter 'M' [-Wunused-parameter]
    8 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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