oj.uz

답안 #745618

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745618 2023-05-20T16:13:18 Z Dan4Life 정렬하기 (IOI15_sorting) C++17
0 / 100
 1 ms 384 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = (int)2e5+10;
int n, m, a[mxN], pos[mxN];

void swp(int a[], int i, int j){
    if(i==j) return;
    swap(pos[a[i]],pos[a[j]]), swap(a[i],a[j]);
}

int findSwapPairs(int N, int a[], int M, int x[], int y[], int P[], int Q[]) {
    n = N, m = M; int num = 0;
    for(int i = 0; i < n; i++) pos[a[i]] = i;
    for(int i = 0; i < m; i++) swp(a,x[i],y[i]);
    for(int i = 0; i < n; i++){
        if(a[i]==i) continue;
        P[num] = i, Q[num++] = pos[a[i]];
        swp(a,i,pos[a[i]]);
    }
    for(int i = 0; i < m; i++) swp(a,x[i],y[i]);
    for(int i = 0; i < num; i++){
        if(is_sorted(a,a+n)) return i;
        swp(a,P[i],Q[i]); swp(a,x[i],y[i]);
    }
	return num;
}

Compilation message

sorting.cpp: In function 'void swp(int*, int, int)':
sorting.cpp:7:14: warning: declaration of 'a' shadows a global declaration [-Wshadow]
    7 | void swp(int a[], int i, int j){
      |          ~~~~^~~
sorting.cpp:5:11: note: shadowed declaration is here
    5 | int n, m, a[mxN], pos[mxN];
      |           ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:12:30: warning: declaration of 'a' shadows a global declaration [-Wshadow]
   12 | int findSwapPairs(int N, int a[], int M, int x[], int y[], int P[], int Q[]) {
      |                          ~~~~^~~
sorting.cpp:5:11: note: shadowed declaration is here
    5 | int n, m, a[mxN], pos[mxN];
      |           ^

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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