제출 #832327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
832327		ttamx	정렬하기 (IOI15_sorting)	C++14	100 / 100	223 ms	28356 KiB

sorting

#include "sorting.h"
#include<bits/stdc++.h>

using namespace std;

int n,m;
vector<int> s,x,y;
vector<pair<int,int>> ans;

bool chk(int val,bool gen=false){
	vector<pair<int,int>> res;
	vector<int> id(n),pos(n),pos2(n),tar(n);
	iota(id.begin(),id.end(),0);
	iota(tar.begin(),tar.end(),0);
	iota(pos2.begin(),pos2.end(),0);
	for(int i=0;i<val;i++)swap(tar[x[i]],tar[y[i]]);
	for(int i=0;i<n;i++)pos[s[i]]=i;
	auto seq=s;
	auto doswap=[&](int u,int v){
		swap(seq[u],seq[v]);
		swap(pos[seq[u]],pos[seq[v]]);
		swap(id[u],id[v]);
		swap(pos2[id[u]],pos2[id[v]]);
	};
	int cnt=0;
	for(int i=0;i<n;i++){
		if(id[pos[i]]!=tar[i]){
			doswap(x[cnt],y[cnt]);
			int u=pos[i],v=pos2[tar[i]];
			res.emplace_back(u,v);
			swap(seq[u],seq[v]);
			swap(pos[seq[u]],pos[seq[v]]);
			cnt++;
		}
	}
	if(gen){
		ans=res;
		while(ans.size()<val)ans.emplace_back(0,0);
	}
	return res.size()<=val;
}

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]);
		x.emplace_back(X[i]);
		y.emplace_back(Y[i]);
	}
	int l=0,r=n-1;
	while(l<r){
		int mid=(l+r)/2;
		auto seq=s;
		if(chk(mid))r=mid;
		else l=mid+1;
	}
	chk(l,true);
	for(int i=0;i<l;i++)tie(P[i],Q[i])=ans[i];
	return l;
}

컴파일 시 표준 에러 (stderr) 메시지

sorting.cpp: In function 'bool chk(int, bool)':
sorting.cpp:38:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   38 |   while(ans.size()<val)ans.emplace_back(0,0);
      |         ~~~~~~~~~~^~~~
sorting.cpp:40:19: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |  return res.size()<=val;
      |         ~~~~~~~~~~^~~~~

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