Submission #71569

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
71569	2018-08-25 07:22:21	Sa1378	Sorting (IOI15_sorting)	C++17	100 / 100	312 ms	14440 KiB

sorting

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
#define N ((int)201*1000)
int b[N],pos[N];
bool mark[N];
int findSwapPairs(int n, int a[], int m, int x[], int y[], int p[], int q[])
{
  bool flg=1;
  for(int i=0;i<n;i++)if(a[i]!=i)flg=0;
  if(flg)return 0;
    int l=0,r=m+1;
  vector <pair<int,int> > res;
  while(l<r-1)
  {
    int mid=(l+r)/2;
    for(int i=0;i<n;i++)b[i]=a[i],mark[i]=0;
    for(int i=0;i<mid;i++)swap(b[x[i]],b[y[i]]);
    vector <pair<int,int> > vec;
    for(int i=0;i<n;i++)
      if(!mark[i])
      {
        mark[i]=1;
        if(b[i]==i)continue;
        int j=b[i];vec.push_back({i,j});
        while(!mark[j])
        {
          mark[j]=1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:35:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(vec.size()>mid)l=mid;
      ~~~~~~~~~~^~~~
sorting.cpp:41:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(res.size()<=i){p[i]=q[i]=0;continue;}
      ~~~~~~~~~~^~~

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