oj.uz

Submission #68044

# Submission time Handle Problem Language Result Execution time Memory
68044 2018-08-15T19:47:48 Z MKopchev Sorting (IOI15_sorting) C++14
74 / 100
 1000 ms 6136 KB 
#include<bits/stdc++.h>
#include "sorting.h"
using namespace std;
const int nmax=2e5+42;
int arr[nmax];
bool been[nmax];
vector< pair<int,int> > change;
int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[])
{
    memset(been,0,sizeof(been));
    change={};
    int ok=N,not_ok=-1;
    //while(ok-not_ok>1)
    ok=-1;
    while(1)
    {
        ok++;
        int av=ok;
        //test av
        for(int j=0;j<N;j++)
            arr[j]=S[j];

        for(int j=0;j<av;j++)
            swap(arr[X[j]],arr[Y[j]]);

        memset(been,0,sizeof(been));
        int now=0;
        for(int i=0;i<N;i++)
            if(been[i]==0)
            {
                int j=i,d=0;
                while(been[j]==0)
                {
                    been[j]=1;
                    d++;
                    j=arr[j];
                }
                now=now+d-1;
            }
        //cout<<av<<" -> "<<now<<endl;
        if(now<=av)break;
    }
    for(int j=0;j<N;j++)
        arr[j]=S[j];
    for(int j=0;j<ok;j++)
        swap(arr[X[j]],arr[Y[j]]);

    memset(been,0,sizeof(been));
    for(int i=0;i<N;i++)
        if(been[i]==0)
        {
            int j=i,d=0;
            while(been[j]==0)
            {
                been[j]=1;
                d++;
                j=arr[j];
                if(i!=j)change.push_back({min(i,j),max(i,j)});
            }

        }
    while(change.size()<ok)
    {
        change.push_back({0,0});
    }
    for(auto k:change)
    {
    swap(arr[k.first],arr[k.second]);
    }

    for(int i=0;i<N;i++)
        if(arr[i]!=i)return -1;//???
    int SZ=change.size();
    //reverse(change.begin(),change.end());
    /*
    cout<<"change: "<<endl;
    for(auto k:change)cout<<k.first<<" "<<k.second<<endl;
    */
    for(int i=0;i<SZ;i++)
    {
        pair<int,int> now=change[i];
        for(int j=ok-1;j>i;j--)
        {
            if(X[j]==now.first&&Y[j]==now.second)continue;
            if(X[j]==now.second&&Y[j]==now.first)continue;
            int a=-1,b=-1,q=-1;
            if(X[j]==now.first)a=X[j],b=Y[j],q=now.second;
            else if(Y[j]==now.first)a=Y[j],b=X[j],q=now.second;
            else if(X[j]==now.second)a=X[j],b=Y[j],q=now.first;
            else if(Y[j]==now.second)a=Y[j],b=X[j],q=now.first;
            if(a!=-1)now={b,q};
            //cout<<"after "<<j<<" step, "<<now.first<<" "<<now.second<<endl;
        }
        P[i]=now.first;
        Q[i]=now.second;
        //cout<<i<<" -> "<<now.first<<" "<<now.second<<endl;
    }
    //test
    for(int j=0;j<N;j++)
        arr[j]=S[j];
    for(int i=0;i<ok;i++)
    {
        swap(arr[X[i]],arr[Y[i]]);
        swap(arr[P[i]],arr[Q[i]]);
        //for(int j=0;j<N;j++)cout<<arr[j]<<" ";cout<<endl;
    }

    for(int i=0;i<N;i++)
        if(arr[i]!=i)
        {
            cout<<"---"<<endl;
            cout<<ok<<endl;
            for(int j=0;j<ok;j++)cout<<P[j]<<" "<<Q[j]<<endl;
            for(int j=0;j<N;j++)cout<<arr[j]<<" ";cout<<endl;
            system("pause");
        }

    return ok;
}
/*
int n=5;
int S[5]={4,3,2,1,0};
int m=6;
int X[6]={0,1,2,3,0,1};
int Y[6]={1,2,3,4,1,2};
int P[6];
int Q[6];
*/
/*
int n=3;
int S[3]={0,2,1};
int m=3;
int X[3]={0,1,2};
int Y[3]={1,2,0};
int P[3];
int Q[3];
*/
/*
const int n=4;
int S[n];
const int m=6;
int X[m]={1,4,2,1,0};
int Y[m]={1,0,3,4,4};
int P[m];
int Q[m];
int main()
{
    srand(time(0));
    while(1)
    {
        for(int j=0;j<n;j++)S[j]=j;
        random_shuffle(S,S+n);
        for(int j=0;j<m;j++)
        {
            X[j]=rand()%n;
            Y[j]=rand()%n;
        }
        cout<<n<<" : ";for(int j=0;j<n;j++)cout<<S[j]<<" ";cout<<endl;
        cout<<m<<endl;
        for(int j=0;j<m;j++)cout<<X[j]<<" "<<Y[j]<<endl;
        cout<<findSwapPairs(n,S,m,X,Y,P,Q)<<endl;
        cout<<endl;
    }
}
*/

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:62:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(change.size()<ok)
           ~~~~~~~~~~~~~^~~
sorting.cpp:73:23: warning: conversion to 'int' from 'std::vector<std::pair<int, int> >::size_type {aka long unsigned int}' may alter its value [-Wconversion]
     int SZ=change.size();
            ~~~~~~~~~~~^~
sorting.cpp:114:13: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
             for(int j=0;j<N;j++)cout<<arr[j]<<" ";cout<<endl;
             ^~~
sorting.cpp:114:51: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
             for(int j=0;j<N;j++)cout<<arr[j]<<" ";cout<<endl;
                                                   ^~~~
sorting.cpp:12:14: warning: unused variable 'not_ok' [-Wunused-variable]
     int ok=N,not_ok=-1;
              ^~~~~~
sorting.cpp:8:37: warning: unused parameter 'M' [-Wunused-parameter]
 int findSwapPairs(int N,int S[],int M,int X[],int Y[],int P[],int Q[])
                                     ^
sorting.cpp:115:19: warning: ignoring return value of 'int system(const char*)', declared with attribute warn_unused_result [-Wunused-result]
             system("pause");
             ~~~~~~^~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 648 KB Output is correct
2 Correct 42 ms 632 KB Output is correct
3 Correct 41 ms 632 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 10 ms 612 KB Output is correct
7 Correct 22 ms 640 KB Output is correct
8 Correct 39 ms 632 KB Output is correct
9 Correct 39 ms 640 KB Output is correct
10 Correct 45 ms 732 KB Output is correct
11 Correct 35 ms 632 KB Output is correct
12 Correct 20 ms 640 KB Output is correct
13 Correct 43 ms 632 KB Output is correct
14 Correct 3 ms 512 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 648 KB Output is correct
2 Correct 42 ms 632 KB Output is correct
3 Correct 41 ms 632 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 10 ms 612 KB Output is correct
7 Correct 22 ms 640 KB Output is correct
8 Correct 39 ms 632 KB Output is correct
9 Correct 39 ms 640 KB Output is correct
10 Correct 45 ms 732 KB Output is correct
11 Correct 35 ms 632 KB Output is correct
12 Correct 20 ms 640 KB Output is correct
13 Correct 43 ms 632 KB Output is correct
14 Correct 3 ms 512 KB Output is correct
15 Execution timed out 1052 ms 6136 KB Time limit exceeded
16 Halted 0 ms 0 KB -