oj.uz

Submission #624156

# Submission time Handle Problem Language Result Execution time Memory
624156 2022-08-07T10:38:11 Z mdn2002 Sorting (IOI15_sorting) C++14
54 / 100
 80 ms 720 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;

int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [20004] , wrdis [20004] , wra [20004] , P [20004] , Q [20004];


bool ck ( int xx )
{
    for ( int i = 1 ; i <= n ; i ++ )
    {
        a [i] = aa [i];
        wra [ a [i] ] = i;
    }
    int mm = xx;
    for ( int i = 1 ; i <= n ; i ++ )
    {
        dis [i] = i;
        wrdis [ dis [i] ] = i;
    }
    for ( int j = mm - 1 ; j >= 0 ; j -- )
    {
        swap ( dis [ x [j] ] , dis [ y [j] ] );
        swap ( wrdis [ dis [ x [j] ] ] , wrdis [ dis [ y [j] ] ] );
    }
    set < int > s;
    for ( int i = 1 ; i <= n ; i ++ )
    {
        if ( dis [i] != a [i] ) s . insert ( dis [i] );
    }

    for ( int i = 1 ; i <= mm ; i ++ )
    {

        int f = 0;
        for ( int j = 1 ; j <= n ; j ++ )
        {
            if ( a [j] != j ) f = 1;
        }
        if ( f == 0 ) return 1;

        swap ( a [ x [ i - 1 ] ] , a [ y [ i - 1 ] ] );
        swap ( wra [ a [ x [ i - 1 ] ] ] , wra [ a [ y [ i - 1 ] ] ] );
        swap ( dis [ x [ i - 1 ] ] , dis [ y [ i - 1 ] ] );
        swap ( wrdis [ dis [ x [ i - 1 ] ] ] , wrdis [ dis [ y [ i - 1 ] ] ] );

        if ( s . size () )
        {

            int x = * s . begin () , z = wra [x];
            s . erase ( s . begin () );

            swap ( a [ wrdis [x] ] , a [z] );
            swap ( wra [ a [ wrdis [x] ] ] , wra [ a [z] ] );
            if ( a [z] == dis [z] ) s . erase ( s . lower_bound ( dis [z] ) );
            
        }
    }
    return 0;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {

    n = N;
    for ( int i = 1 ; i <= n ; i ++ )
    {
        a [i] = S [ i - 1 ];
        a [i] ++;
        aa [i] = a [i];
    }
    m = M;
    for ( int i = 0 ; i < m ; i ++ )
    {
        x [i] = X [i] , y [i] = Y [i];
        x [i] ++ , y [i] ++;
    }

    int l = 0 , rr = m + 1 , mid;
    while ( l < rr )
    {
        mid = ( l + rr ) / 2;
        if ( ck ( mid ) ) rr = mid;
        else l = mid + 1;
    }
    m = l;

    for ( int i = 1 ; i <= n ; i ++ )
    {
        a [i] = aa [i];
        wra [ a [i] ] = i;
    }
    for ( int i = 1 ; i <= n ; i ++ )
    {
        dis [i] = i;
        wrdis [i] = i;
    }
    for ( int j = m - 1 ; j >= 0 ; j -- )
    {
        swap ( dis [ x [j] ] , dis [ y [j] ] );
        swap ( wrdis [ dis [ x [j] ] ] , wrdis [ dis [ y [j] ] ] );
    }

    set < int > s;
    for ( int i = 1 ; i <= n ; i ++ )
    {
        if ( dis [i] != a [i] ) s . insert ( dis [i] );
    }

    int r = 0;
    for ( int i = 1 ; i <= m ; i ++ )
    {

        int f = 0;
        for ( int j = 1 ; j <= n ; j ++ )
        {
            if ( a [j] != j ) f = 1;
        }
        if ( f == 0 ) return r;

        swap ( a [ x [ i - 1 ] ] , a [ y [ i - 1 ] ] );
        swap ( wra [ a [ x [ i - 1 ] ] ] , wra [ a [ y [ i - 1 ] ] ] );
        swap ( dis [ x [ i - 1 ] ] , dis [ y [ i - 1 ] ] );
        swap ( wrdis [ dis [ x [ i - 1 ] ] ] , wrdis [ dis [ y [ i - 1 ] ] ] );



        P [ i - 1 ] = -1 , Q [ i - 1 ] = -1;
        if ( s . size () )
        {

            int x = * s . begin () , z = wra [x];
            s . erase ( s . begin () );

            swap ( a [ wrdis [x] ] , a [z] );
            swap ( wra [ a [ wrdis [x] ] ] , wra [ a [z] ] );
            if ( a [z] == dis [z] ) s . erase ( s . lower_bound ( dis [z] ) );

            P [ i - 1 ] = wrdis [x] - 1 , Q [ i - 1 ] = z - 1;
            r ++;

        }

        if ( P [ i - 1 ] == -1 )
        {
            P [ i - 1 ] = 0;
            Q [ i - 1 ] = 0;
            r ++;
        }

    }
    return r;
}

Compilation message

sorting.cpp: In function 'bool ck(int)':
sorting.cpp:50:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   50 |             int x = * s . begin () , z = wra [x];
      |                 ^
sorting.cpp:5:36: note: shadowed declaration is here
    5 | int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [20004] , wrdis [20004] , wra [20004] , P [20004] , Q [20004];
      |                                    ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:61:73: warning: declaration of 'Q' shadows a global declaration [-Wshadow]
   61 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                                     ~~~~^~~
sorting.cpp:5:116: note: shadowed declaration is here
    5 | int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [20004] , wrdis [20004] , wra [20004] , P [20004] , Q [20004];
      |                                                                                                                    ^
sorting.cpp:61:64: warning: declaration of 'P' shadows a global declaration [-Wshadow]
   61 | int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
      |                                                            ~~~~^~~
sorting.cpp:5:104: note: shadowed declaration is here
    5 | int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [20004] , wrdis [20004] , wra [20004] , P [20004] , Q [20004];
      |                                                                                                        ^
sorting.cpp:130:17: warning: declaration of 'x' shadows a global declaration [-Wshadow]
  130 |             int x = * s . begin () , z = wra [x];
      |                 ^
sorting.cpp:5:36: note: shadowed declaration is here
    5 | int n , m , a [2003] , aa [2003] , x [20004] , y [20004] , dis [20004] , wrdis [20004] , wra [20004] , P [20004] , Q [20004];
      |                                    ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 1 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 1 ms 212 KB Output is correct
2 Correct 0 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 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 1 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 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 1 ms 220 KB Output is correct
19 Correct 0 ms 224 KB Output is correct
20 Correct 0 ms 224 KB Output is correct
21 Correct 68 ms 712 KB Output is correct
22 Correct 54 ms 696 KB Output is correct
23 Correct 55 ms 716 KB Output is correct
24 Correct 69 ms 720 KB Output is correct
25 Correct 73 ms 716 KB Output is correct
26 Correct 80 ms 704 KB Output is correct
27 Correct 49 ms 704 KB Output is correct

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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