oj.uz

Submission #745622

# Submission time Handle Problem Language Result Execution time Memory
745622 2023-05-20T16:21:53 Z Dan4Life Sorting (IOI15_sorting) C++17
20 / 100
 1 ms 340 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;
    if(is_sorted(a,a+n)) return 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(pos[i]==i) continue;
        P[num] = i, Q[num++] = pos[i];
        swp(a,i,pos[i]);
    }
    for(int i = 0; i < m; i++) swp(a,x[i],y[i]);
    for(int i = 0; i < num; i++) swp(a,P[i],Q[i]);
    for(int i = 0; i < num; i++){
        swp(a,x[i],y[i]);
        if(is_sorted(a,a+n)){
            P[i]=Q[i]=0; return i+1;
        }
        swp(a,P[i],Q[i]);
        if(is_sorted(a,a+n)) return i+1;
    }
	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
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Incorrect 0 ms 212 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -