Submission #831876

#	Time	Username	Problem	Language	Result	Execution time	Memory
831876		ttamx	정렬하기 (IOI15_sorting)	C++14	0 / 100	2 ms	468 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>
 
using namespace std;
 
int n,m;
vector<int> s;
 
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++)s.emplace_back(S[i]);
	for(int i=0;i<m;i++)swap(s[X[i]],s[Y[i]]);
	vector<pair<int,int>> ans;
	for(int i=0;i<n;i++){
		while(s[i]!=i){
			ans.emplace_back(i,s[i]);
			swap(s[i],s[s[i]]);
		}
	}
	while(ans.size()<m)ans.emplace_back(0,0);
	for(int i=0;i<m;i++)tie(P[i],Q[i])=ans[i];
	return m;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:20:18: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |  while(ans.size()<m)ans.emplace_back(0,0);
      |        ~~~~~~~~~~^~

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