제출 #124505

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

sorting

/// In The Name Of God

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

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

const int MAXN = (int)2e5 + 7;

using namespace std;

int n, m;
int a[MAXN], b[MAXN], x[MAXN], y[MAXN];

bool check(int len) {
	rep(i, 0, n) {
		b[i] = a[i];
	}
	rep(i, 0, min(len, m)) {
		swap(b[x[i]], b[y[i]]);
	}
	int cnt = 0;
	rep(i, 0, n) {
		if (b[i] != i) {
			++cnt;
			swap(b[i], b[b[i]]);
		}
	}
	if (cnt > len) return 0;
	return 1;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	{
		n = N;
		m = M;
		rep(i, 0, n) {
			a[i] = S[i];
		}
		rep(i, 0, m) {
			x[i] = X[i];
			y[i] = Y[i];
		}
	} 
	// copying
	
	int l = 1, r = n * 2, res = -1;	
	while (l <= r) {
		int mid = (l + r) >> 1;
		if (check(mid)) res = mid, r = mid - 1;
		else l = mid + 1;
	}
	assert(res != -1);
	// opt len found

	rep(i, 0, n) {
		b[i] = a[i];
	}
	rep(i, 0, min(m, res)) {
		swap(b[x[i]], b[y[i]]);
	}
	vector <int> st;
	int go[n];
	rep(i, 0, n) {
		go[b[i]] = i;
	}
	rep(i, 0, n) {
		if (b[i] != i) {
			//if (go[b[i]] == b[i]) assert(0);
			//st.pb(b[i]);
			swap(b[i], b[b[i]]);
		}
		if (go[i] != i) st.pb(i);
	}

	int ptr = 0;
	if (!sz(st)) {
		ptr = 0;
		P[ptr] = X[ptr];
		Q[ptr] = Y[ptr];
		return 1;
	}
	swap(a[X[ptr]], a[Y[ptr]]);
	for (auto x : st) {
		if (go[x] == x) {
			//cerr << "BAD -> " << x << nl;
			/*
			cerr << " -> " << x << nl;
		rep(i, 0, n) cerr << a[i] << ' ';
		cerr << nl;
		rep(i, 0, n) cerr << go[i] << ' ';
		cerr << nl << nl;*/
			continue;
		}
		
	
		

		int p1 = find(a, a + n, x) - a;

		rep(i, 0, n) {
			if (go[i] == x) {
				int p2 = find(a, a + n, i) - a;
				P[ptr] = p1;
				Q[ptr] = p2;
				swap(go[x], go[i]);
				swap(a[p1], a[p2]);
				ptr++;
			}
		}

		/*		
		cerr << " -> " << x << nl;
		rep(i, 0, n) cerr << a[i] << ' ';
		cerr << nl;
		rep(i, 0, n) cerr << go[i] << ' ';
		cerr << nl << nl;*/
		

		if (ptr < m) {
			swap(a[X[ptr]], a[Y[ptr]]);
			///// don't use/// swap(go[a[X[ptr]]], go[a[Y[ptr]]]);
		}
	}
	/*
	rep(i, 0, n) cerr << a[i] << ' ';
		cerr << nl;*/
	

	return ptr;
}

#ifdef IOI2018

namespace gen {


	void gen() {
		int N, M;
		N = rand() % 5 + 1;
		int *S = (int*)malloc(sizeof(int) * (unsigned int)N);
		for (int i = 0; i < N; ++i)
			S[i] = i;
		random_shuffle(S, S + N);

		printf ("%d\n", N);
		fflush(stdout);
		int A[N];
		for (int i = 0; i < N; i++) {
				A[i] = S[i];
				printf ("%d ", A[i]);
		}
		printf ("\n");
		fflush(stdout);

		M = rand() % 5 + 1;
		printf ("%d\n", M);
		fflush(stdout);
		int *X = (int*)malloc(sizeof(int) * (unsigned int)M), *Y = (int*)malloc(sizeof(int) * (unsigned int)M);
		for (int i = 0; i < M; ++i) {
				X[i] = rand() % N;
				Y[i] = rand() % N;
				printf ("%d %d\n", X[i], Y[i]);
				fflush(stdout);
		}
		int *P = (int*)malloc(sizeof(int) * (unsigned int)M), *Q = (int*)malloc(sizeof(int) * (unsigned int)M);
		int ans = findSwapPairs(N, S, M, X, Y, P, Q);
		printf("%d\n", ans);
		fflush(stdout);

		//assert(ans <= 30 * N);
		for (int i = 0; i < ans; ++i) {
					if (i < M) swap(A[X[i]], A[Y[i]]);
					swap(A[P[i]], A[Q[i]]);
			}
			for (int i = 0; i < N; i++) {
				//assert(A[i] == i);
					printf("%d ", A[i]);
			}
	}

}

int main() {
	rep(i, 1, 100) {
		printf ("Case: %d\n", i);
		fflush(stdout);
		srand(i);
		gen :: gen();
		printf ("\n");
		fflush(stdout);
	}
}

#endif

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

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:100:12: warning: declaration of 'x' shadows a global declaration [-Wshadow]
  for (auto x : st) {
            ^
sorting.cpp:30:23: note: shadowed declaration is here
 int a[MAXN], b[MAXN], x[MAXN], y[MAXN];
                       ^
sorting.cpp:115:30: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
   int p1 = find(a, a + n, x) - a;
            ~~~~~~~~~~~~~~~~~~^~~
sorting.cpp:119:32: warning: conversion to 'int' from 'long int' may alter its value [-Wconversion]
     int p2 = find(a, a + n, i) - a;
              ~~~~~~~~~~~~~~~~~~^~~

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