제출 #474196

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
474196		jwvg0425	정렬하기 (IOI15_sorting)	C++17	20 / 100	110 ms	568 KiB

sorting

#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include "sorting.h"
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

template<typename T, typename Pr = less<T>>
using pq = priority_queue<T, vector<T>, Pr>;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

bool sorted(vector<int> s)
{
	for (int i = 0; i < s.size(); i++)
		if (s[i] != i)
			return false;

	return true;
}


vector<ii> solve(vector<int> s, vector<ii> r)
{
	int n = s.size();
	int m = r.size();
	vector<ii> res;

	for (int i = 0; i < m && !sorted(s); i++)
	{
		vector<int> rev(n), idx(n);
		swap(s[r[i].xx], s[r[i].yy]);
		for (int j = 0; j < n; j++)
			rev[j] = j;

		for (int j = i + 1; j < m; j++)
			swap(rev[r[j].xx], rev[r[j].yy]);

		for (int j = 0; j < n; j++)
			idx[rev[j]] = j;

		// s[i] -> idx[i]
		bool f = false;
		for (int x = 0; x < n; x++)
		{
			if (s[x] == idx[x])
				continue;

			int j = find(all(s), idx[x]) - s.begin();

			res.emplace_back(x, j);
			swap(s[x], s[j]);
			f = true;
			break;
		}

		if (!f)
			res.emplace_back(0, 0);
	}

	assert(sorted(s));

	return res;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[])
{
	vector<int> s(N);
	vector<ii> r(M);

	for (int i = 0; i < N; i++)
		s[i] = S[i];

	for (int i = 0; i < M; i++)
	{
		r[i].xx = X[i];
		r[i].yy = Y[i];
	}

	auto res = solve(s, r);

	for (int i = 0; i < res.size(); i++)
	{
		P[i] = res[i].xx;
		Q[i] = res[i].yy;
	}

	return res.size();
}

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

sorting.cpp: In function 'bool sorted(std::vector<int>)':
sorting.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (int i = 0; i < s.size(); i++)
      |                  ~~^~~~~~~~~~
sorting.cpp: In function 'std::vector<std::pair<int, int> > solve(std::vector<int>, std::vector<std::pair<int, int> >)':
sorting.cpp:42:16: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   42 |  int n = s.size();
      |          ~~~~~~^~
sorting.cpp:43:16: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   43 |  int m = r.size();
      |          ~~~~~~^~
sorting.cpp:66:33: warning: conversion from '__gnu_cxx::__normal_iterator<int*, std::vector<int> >::difference_type' {aka 'long int'} to 'int' may change value [-Wconversion]
   66 |    int j = find(all(s), idx[x]) - s.begin();
      |            ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:99:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |  for (int i = 0; i < res.size(); i++)
      |                  ~~^~~~~~~~~~~~
sorting.cpp:105:17: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  105 |  return res.size();
      |         ~~~~~~~~^~

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