oj.uz

Submission #68021

# Submission time Handle Problem Language Result Execution time Memory
68021 2018-08-15T18:46:35 Z MKopchev Sorting (IOI15_sorting) C++14
36 / 100
 7 ms 1280 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[])
{
    int ok=N,not_ok=-1;
    while(ok-not_ok>1)
    {
        int av=(ok+not_ok)/2;
        //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)ok=av;
        else not_ok=av;
    }
    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)});
            }

        }
    int SZ=change.size();
    //reverse(change.begin(),change.end());

    for(int i=0;i<SZ;i++)
    {
        pair<int,int> now=change[i];
        for(int j=ok-1;j>i;j--)
        {
            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++)
        assert(arr[i]==i);

    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];

int main()
{
    int val=findSwapPairs(n,S,m,X,Y,P,Q);
    cout<<val<<endl;
    for(int j=0;j<val;j++)
        cout<<P[j]<<" "<<Q[j]<<endl;
}
*/

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:58: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:8:37: warning: unused parameter 'M' [-Wunused-parameter]
 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 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 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 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 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 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 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 4 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 ms 512 KB Output is correct

Subtask #4
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 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 3 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 2 ms 512 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 3 ms 512 KB Output is correct
21 Runtime error 4 ms 1280 KB Execution killed with signal 11 (could be triggered by violating memory limits)
22 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Runtime error 7 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Runtime error 7 ms 1152 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -