Submission #789963

#	Time	Username	Problem	Language	Result	Execution time	Memory
789963		PoonYaPat	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	340 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;

int n,m,a[200005],pos[200005];
vector<pii> v;

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n=N; m=M;
	for (int i=0; i<n; ++i) a[i]=S[i], pos[a[i]]=i;

	for (int i=n-1; i>=0; --i) {
		if (X[0]==0 && Y[0]==1) swap(pos[a[0]],pos[a[1]]);
		if (i!=pos[i]) {
			v.push_back(pii(i,pos[i]));
			a[pos[i]]=a[i];
			a[i]=i;
			pos[a[i]]=pos[i];
			pos[i]=i;
		}
	}
	if (pos[0]==1 && pos[1]==0) v.push_back(pii(0,0));

	for (int i=0; i<v.size(); ++i) P[i]=v[i].first, Q[i]=v[i].second;
	return v.size();
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:25:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for (int i=0; i<v.size(); ++i) P[i]=v[i].first, Q[i]=v[i].second;
      |                ~^~~~~~~~~
sorting.cpp:26:15: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   26 |  return v.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