Submission #318027

#	Time	Username	Problem	Language	Result	Execution time	Memory
318027		lukameladze	Sorting (IOI15_sorting)	C++14	0 / 100	2 ms	748 KiB

sorting

# include <bits/stdc++.h>
using namespace std;
long long  xx,idx[300005],a1[300005],a[300005],n,m,X[300005],Y[300005],a3[300005],ww,le,ri,mid,a2[300005],anss;
vector < pair < long long, long long > > v,ans,ans1;
void swapp(int idx1, int idx2)
{
     idx[a1[idx1]]=idx2;
     idx[a1[idx2]]=idx1;
     swap(a1[idx1],a1[idx2]);
}
void swapp1(int idx1, int idx2)
{
     idx[a[idx1]]=idx2;
     idx[a[idx2]]=idx1;
     swap(a[idx1],a[idx2]);
}
int findSwapPairs(int N, int A[], int M, int x[], int y[], int P[], int Q[]) 
{
	n=N;
	m=M;
	for (int i=1; i<=n; i++)
	{
		a2[i]=A[i-1];
	}
	for (int i=1; i<=m; i++)
	{
		X[i]=x[i-1];
		Y[i]=y[i-1];
	}
    for (int i=1; i<=n; i++)
    {
         a1[i]=a2[i];
         a3[i]=a2[i];
    }
    sort(a3+1, a3+n+1);
    for (int i=1; i<=n; i++)
    {
        if(a3[i]!=a2[i]) ww=1;
    }
    if (!ww)
    {
        return 0;
    }
    le=1;
    ri=m;
     while(le<=ri)
    {
        ans.clear();
        v.clear();
        mid=(le+ri)/2;
        for (int i=1; i<=n; i++)
        {
        a1[i]=a2[i];
        a[i]=a2[i];
        }
         for (int i=1; i<=mid; i++)
         {
              swap(a1[x[i]], a1[y[i]]);
         }
         for (int i=1; i<=n; i++)
         {
              idx[a1[i]]=i;
         }
         for (int i=1; i<=n; i++)
         {
              if (idx[i]!=i)
              {
                   v.push_back({i, a1[i]});
              }
              swapp(idx[a1[i]], idx[i]);
         }
         if (v.size()>mid)
         {
             le=mid+1;
             continue;
        }
         
        
         for (int i=1; i<=n; i++)
         {
              idx[a[i]]=i;
         }
         for (int i=1; i<=mid; i++)
         {
              swapp1(x[i],y[i]);
              xx=v.size();
              if (i<=xx)
              {
              ans.push_back({idx[v[i-1].first], idx[v[i-1].second]}),
              swapp1(idx[v[i-1].first],idx[v[i-1].second]);
              }
         }
        if (v.size()<=mid)
         {
             anss=mid;
             ri=mid-1;
             ans1.clear();
             for (int j=0; j<ans.size(); j++)
             {
                 ans1.push_back({ans[j].first, ans[j].second});
            }
        }
    }
    //cout<<anss<<endl;
    if (anss>ans1.size()) ans1.push_back({1,1});
    
    for (int i=0; i<ans1.size(); i++)
    {
    		P[i]=ans1[i].first-1;
    		Q[i]=ans1[i].second-1;
        //cout<<ans1[i].first<<" "<<ans1[i].second<<endl;
    }return ans1.size();
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:70:30: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   70 |               swapp(idx[a1[i]], idx[i]);
      |                     ~~~~~~~~~^
sorting.cpp:70:38: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   70 |               swapp(idx[a1[i]], idx[i]);
      |                                 ~~~~~^
sorting.cpp:72:22: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   72 |          if (v.size()>mid)
      |              ~~~~~~~~^~~~
sorting.cpp:90:38: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   90 |               swapp1(idx[v[i-1].first],idx[v[i-1].second]);
      |                      ~~~~~~~~~~~~~~~~^
sorting.cpp:90:57: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   90 |               swapp1(idx[v[i-1].first],idx[v[i-1].second]);
      |                                        ~~~~~~~~~~~~~~~~~^
sorting.cpp:93:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   93 |         if (v.size()<=mid)
      |             ~~~~~~~~^~~~~
sorting.cpp:98:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   98 |              for (int j=0; j<ans.size(); j++)
      |                            ~^~~~~~~~~~~
sorting.cpp:105:13: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |     if (anss>ans1.size()) ans1.push_back({1,1});
      |         ~~~~^~~~~~~~~~~~
sorting.cpp:107:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for (int i=0; i<ans1.size(); i++)
      |                   ~^~~~~~~~~~~~
sorting.cpp:109:25: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  109 |       P[i]=ans1[i].first-1;
sorting.cpp:110:26: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  110 |       Q[i]=ans1[i].second-1;
sorting.cpp:112:22: warning: conversion from 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  112 |     }return ans1.size();
      |             ~~~~~~~~~^~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26