제출 #135345

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
135345		TuGSGeReL	정렬하기 (IOI15_sorting)	C++17	0 / 100	3 ms	504 KiB

sorting

#include "sorting.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key
#define lb lower_bound
#define ub upper_bound

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

int erm[200001], aiz[200001], n, x[600001], y[600001], s[200001], dta[200001], rdata[200001];
vector <pii> ans;

bool can(int k)
{
	ans.clear();
	
	for (int i = 0; i < n; i++)
		aiz[i] = s[i];
		
	for (int i = 0; i < k; i++)
		swap(aiz[x[i]], aiz[y[i]]);
	
	for (int i = 0; i < n; i++)
		dta[aiz[i]] = i;
	
	int p = 0;
	
	for (int i = 0; i < n; i++)
	{
		if ( aiz[i] != i )
		{
			p++;
			ans.pub(mp(i, aiz[i]));
			swap(aiz[dta[i]], aiz[dta[aiz[i]]]);
			swap(dta[i], dta[aiz[i]]);
		}
	}
	
	if ( p <= k )
		return 1;
	
	return 0;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	int l = 0, r = M, n = N;
	
	for (int i = 0; i < M; i++)
	{
		x[i] = X[i];
		y[i] = Y[i];
	}
	
	for (int i = 0; i < n; i++)
		s[i] = S[i];
	
	while (l + 1 < r)
	{
		int mid = (l + r) / 2;
		
		if ( can(mid) )
			r = mid;
		
		else
			l = mid;
	}
	
	if ( can(l) )
	{
		for (int i = 0; i < ans.size(); i++)
		{
			P[i] = ans[i].ff;
			Q[i] = ans[i].ss;
		}
		
		return l;
	} else {
		can(r);
		
		for (int i = 0; i < ans.size(); i++)
		{
			P[i] = ans[i].ff;
			Q[i] = ans[i].ss;
		}
		
		return r;
	}
}

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:61:20: warning: declaration of 'n' shadows a global declaration [-Wshadow]
  int l = 0, r = M, n = N;
                    ^
sorting.cpp:25:31: note: shadowed declaration is here
 int erm[200001], aiz[200001], n, x[600001], y[600001], s[200001], dta[200001], rdata[200001];
                               ^
sorting.cpp:85:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < ans.size(); i++)
                   ~~^~~~~~~~~~~~
sorting.cpp:95:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < ans.size(); i++)
                   ~~^~~~~~~~~~~~

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