oj.uz

Submission #405882

# Submission time Handle Problem Language Result Execution time Memory
405882 2021-05-17T02:33:12 Z jk410 Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 14524 KB 
#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;
int A[200000],tmp[200000],tmp_P[200000],tmp_Q[200000];
bool Visited[200000];
bool f(int N,int S[],int X[],int Y[],int k){
    for (int i=0; i<N; i++){
        tmp[i]=S[i];
        Visited[i]=false;
    }
    for (int i=0; i<k; i++){
        swap(tmp[X[i]],tmp[Y[i]]);
        tmp_P[i]=tmp_Q[i]=0;
    }
    int cnt=0;
    for (int i=0; i<N; i++){
        if (tmp[i]!=i&&!Visited[i]){
            Visited[i]=true;
            for (int j=tmp[i]; !Visited[j]; j=tmp[j]){
                Visited[j]=true;
                tmp_P[cnt]=j;
                tmp_Q[cnt]=tmp[j];
                cnt++;
                if (cnt>k)
                    return false;
            }
        }
    }
    return true;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int ans;
    for (int i=0; i<N; i++)
        A[S[i]]=i;
    for (ans=0; ans<=N; ans++){
        if (f(N,S,X,Y,ans))
            break;
    }
    for (int i=0; i<ans; i++){
        swap(A[S[X[i]]],A[S[Y[i]]]);
        swap(S[X[i]],S[Y[i]]);
        P[i]=A[tmp_P[i]];
        Q[i]=A[tmp_Q[i]];
        swap(S[A[tmp_P[i]]],S[A[tmp_Q[i]]]);
        swap(A[tmp_P[i]],A[tmp_Q[i]]);
    }
    return ans;
}

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:31:39: warning: unused parameter 'M' [-Wunused-parameter]
   31 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                   ~~~~^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 288 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 288 KB Output is correct
17 Correct 1 ms 312 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 460 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 3 ms 460 KB Output is correct
24 Correct 3 ms 460 KB Output is correct
25 Correct 2 ms 460 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 3 ms 460 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 392 KB Output is correct
2 Correct 21 ms 476 KB Output is correct
3 Correct 19 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 13 ms 468 KB Output is correct
8 Correct 20 ms 456 KB Output is correct
9 Correct 22 ms 464 KB Output is correct
10 Correct 20 ms 468 KB Output is correct
11 Correct 18 ms 460 KB Output is correct
12 Correct 13 ms 440 KB Output is correct
13 Correct 27 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 392 KB Output is correct
2 Correct 21 ms 476 KB Output is correct
3 Correct 19 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 4 ms 460 KB Output is correct
7 Correct 13 ms 468 KB Output is correct
8 Correct 20 ms 456 KB Output is correct
9 Correct 22 ms 464 KB Output is correct
10 Correct 20 ms 468 KB Output is correct
11 Correct 18 ms 460 KB Output is correct
12 Correct 13 ms 440 KB Output is correct
13 Correct 27 ms 460 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Execution timed out 1084 ms 14524 KB Time limit exceeded
16 Halted 0 ms 0 KB -