제출 #88240

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
88240		Pajaraja	Sorting (IOI15_sorting)	C++17	0 / 100	25 ms	512 KiB

sorting

#include <bits/stdc++.h>
#define MAXN 200007
using namespace std;
int s[MAXN],p[MAXN],n,m,x[3*MAXN],y[3*MAXN],pi[MAXN];
bool vi[MAXN];
vector<int> z[2];
void copy() {for(int i=0;i<n;i++) p[i]=s[i];}
bool provera(int a)
{
	copy();
	int brc=0;
	for(int r=0;r<a;r++)
	{
		fill(vi,vi+n,false);
		swap(p[x[r]],p[y[r]]);
		for(int i=0;i<n;i++) if(!vi[i]) {brc++; while(!vi[i]) {vi[i]=true; i=p[i];}}
	}
	return brc+a>n;
}
int binarna(int l,int r)
{
	if(l==r) return l;
	int s=(l+r)/2;
	if(provera(s)) return binarna(l,s);
	return binarna(s+1,r);
}
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[i]=S[i]; for(int i=0;i<m;i++) {x[i]=X[i]; y[i]=Y[i];}
	int r=binarna(0,n);
	copy();
	fill(vi,vi+n,false);
	for(int i=0;i<r;i++) swap(p[X[r]],p[Y[r]]);
	for(int i=0;i<n;i++) if(!vi[i]) while(!vi[i]) {vi[i]=true; if(!vi[p[i]]) {z[0].push_back(i); z[1].push_back(p[i]);} i=p[i];}
	for(int i=0;i<n;i++) pi[S[i]]=i;
	for(int i=0;i<r;i++)
	{
		swap(S[X[i]],S[Y[i]]);
		pi[S[X[i]]]=X[i];
		pi[S[Y[i]]]=Y[i];
		if(i>=z[0].size()) P[i]=Q[i]=0;
		else 
		{
			if(z[0][i]<z[1][i]) swap(z[0][i],z[1][i]);
			P[i]=pi[z[0][i]]; 
			Q[i]=pi[z[1][i]];
			swap(S[P[i]],S[Q[i]]);
			pi[S[P[i]]]=P[i];
			pi[S[Q[i]]]=Q[i];
		
		}
	}
	return r;
}

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

sorting.cpp: In function 'int binarna(int, int)':
sorting.cpp:23:6: warning: declaration of 's' shadows a global declaration [-Wshadow]
  int s=(l+r)/2;
      ^
sorting.cpp:4:5: note: shadowed declaration is here
 int s[MAXN],p[MAXN],n,m,x[3*MAXN],y[3*MAXN],pi[MAXN];
     ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:41:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(i>=z[0].size()) P[i]=Q[i]=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