oj.uz

답안 #921724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921724 2024-02-04T09:32:55 Z coding_snorlax 정렬하기 (IOI15_sorting) C++14
0 / 100
 2 ms 348 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(S[j]==i){
                P[i]=j;
                Q[i]=i;
                S[j]=S[i];
                S[i]=i;
                break;
            }
        }
    }
	return N;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:5:73: warning: declaration of 'Q' shadows a global declaration [-Wshadow]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                                     ~~~~^~~
sorting.cpp:4:73: note: shadowed declaration is here
    4 | int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
      |                                                                         ^
sorting.cpp:5:64: warning: declaration of 'P' shadows a global declaration [-Wshadow]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                            ~~~~^~~
sorting.cpp:4:65: note: shadowed declaration is here
    4 | int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
      |                                                                 ^
sorting.cpp:5:55: warning: declaration of 'Y' shadows a global declaration [-Wshadow]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                   ~~~~^~~
sorting.cpp:4:45: note: shadowed declaration is here
    4 | int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
      |                                             ^
sorting.cpp:5:46: warning: declaration of 'X' shadows a global declaration [-Wshadow]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:4:25: note: shadowed declaration is here
    4 | int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
      |                         ^
sorting.cpp:5:30: warning: declaration of 'S' shadows a global declaration [-Wshadow]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                          ~~~~^~~
sorting.cpp:4:5: note: shadowed declaration is here
    4 | int S[1000]={4,3,2,1,0},X[1000]={0,0,0,0,0},Y[1000]={0,0,0,0,0},P[1000],Q[1000];
      |     ^
sorting.cpp:5:39: warning: unused parameter 'M' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^
sorting.cpp:5:46: warning: unused parameter 'X' [-Wunused-parameter]
    5 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                          ~~~~^~~
sorting.cpp:5:55: warning: unused parameter 'Y' [-Wunused-parameter]
    5 | 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 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 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

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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