oj.uz

Submission #318043

# Submission time Handle Problem Language Result Execution time Memory
318043 2020-10-31T10:25:37 Z lukameladze Sorting (IOI15_sorting) C++14
100 / 100
 446 ms 45756 KB 
# include <bits/stdc++.h>
using namespace std;
long long  xx,idx[600005],a1[600005],a[600005],n,m,X[600005],Y[600005],a3[600005],ww,le,ri,mid,a2[600005],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]+1;
	}
	for (int i=1; i<=m; i++)
	{
		X[i]=x[i-1]+1;
		Y[i]=y[i-1]+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;
    	while (ans1.size()<anss)
    	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 anss;
}

Compilation message

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:83:25: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   83 |               swapp1(X[i],Y[i]);
      |                      ~~~^
sorting.cpp:83:30: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   83 |               swapp1(X[i],Y[i]);
      |                           ~~~^
sorting.cpp:88:39: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   88 |                swapp1(idx[v[i-1].first],idx[v[i-1].second]);
      |                       ~~~~~~~~~~~~~~~~^
sorting.cpp:88:58: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   88 |                swapp1(idx[v[i-1].first],idx[v[i-1].second]);
      |                                         ~~~~~~~~~~~~~~~~~^
sorting.cpp:91: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]
   91 |         if (v.size()<=mid)
      |             ~~~~~~~~^~~~~
sorting.cpp:96: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]
   96 |              for (int j=0; j<ans.size(); j++)
      |                            ~^~~~~~~~~~~
sorting.cpp:103:24: 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]
  103 |      while (ans1.size()<anss)
      |             ~~~~~~~~~~~^~~~~
sorting.cpp:106: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]
  106 |     for (int i=0; i<ans1.size(); i++)
      |                   ~^~~~~~~~~~~~
sorting.cpp:108:25: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  108 |       P[i]=ans1[i].first-1;
sorting.cpp:109:26: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  109 |       Q[i]=ans1[i].second-1;
sorting.cpp:112:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  112 |     return anss;
      |            ^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

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

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 748 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 3 ms 748 KB Output is correct
4 Correct 1 ms 620 KB Output is correct
5 Correct 2 ms 748 KB Output is correct
6 Correct 2 ms 748 KB Output is correct
7 Correct 2 ms 876 KB Output is correct
8 Correct 3 ms 876 KB Output is correct
9 Correct 3 ms 876 KB Output is correct
10 Correct 3 ms 876 KB Output is correct
11 Correct 3 ms 876 KB Output is correct
12 Correct 2 ms 876 KB Output is correct
13 Correct 3 ms 876 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 300 ms 40380 KB Output is correct
16 Correct 325 ms 41276 KB Output is correct
17 Correct 385 ms 43452 KB Output is correct
18 Correct 55 ms 26596 KB Output is correct
19 Correct 286 ms 43212 KB Output is correct
20 Correct 302 ms 44108 KB Output is correct
21 Correct 282 ms 44236 KB Output is correct
22 Correct 304 ms 39100 KB Output is correct
23 Correct 353 ms 45116 KB Output is correct
24 Correct 410 ms 44476 KB Output is correct
25 Correct 382 ms 43836 KB Output is correct
26 Correct 301 ms 39236 KB Output is correct
27 Correct 274 ms 37472 KB Output is correct
28 Correct 361 ms 43580 KB Output is correct
29 Correct 390 ms 42300 KB Output is correct
30 Correct 226 ms 35280 KB Output is correct
31 Correct 446 ms 43196 KB Output is correct
32 Correct 354 ms 43636 KB Output is correct
33 Correct 413 ms 44348 KB Output is correct
34 Correct 368 ms 44220 KB Output is correct
35 Correct 279 ms 42444 KB Output is correct
36 Correct 119 ms 31588 KB Output is correct
37 Correct 406 ms 45756 KB Output is correct
38 Correct 400 ms 43748 KB Output is correct
39 Correct 388 ms 44224 KB Output is correct