oj.uz

Submission #474208

# Submission time Handle Problem Language Result Execution time Memory
474208 2021-09-17T11:24:37 Z jwvg0425 Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 17552 KB 
#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 k)
{
	int n = s.size();
	r.resize(k);
	int m = r.size();
	vector<ii> res;

	vector<int> rev(n), idx(n), pos(n);
	for (int j = 0; j < n; j++)
		pos[s[j]] = j;

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

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

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

	for (int i = 0; i < m; i++)
	{
		swap(s[r[i].xx], s[r[i].yy]);
		swap(pos[s[r[i].xx]], pos[s[r[i].yy]]);
		int a = idx[r[i].xx], b = idx[r[i].yy];
		swap(rev[a], rev[b]);
		swap(idx[rev[a]], idx[rev[b]]);

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

			int y = pos[idx[x]];
			res.emplace_back(x, y);
			swap(s[x], s[y]);
			swap(pos[s[x]], pos[s[y]]);
			f = true;
		}

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

	if (!sorted(s))
	{
		res.clear();
		res.emplace_back(-1, -1);
	}

	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];
	}

	int lo = 0, hi = M;
	vector<ii> res;

	while (lo <= hi)
	{
		int mid = (lo + hi) / 2;
		auto now = solve(s, r, mid);

		if (!now.empty() && now[0].xx == -1)
		{
			lo = mid + 1;
		}
		else
		{
			res = now;
			hi = mid - 1;
		}
	}

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

	return res.size();
}

Compilation message

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> >, int)':
sorting.cpp:41:16: warning: conversion from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   41 |  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: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:127: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]
  127 |  for (int i = 0; i < res.size(); i++)
      |                  ~~^~~~~~~~~~~~
sorting.cpp:133:17: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
  133 |  return res.size();
      |         ~~~~~~~~^~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 400 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 400 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 11 ms 772 KB Output is correct
22 Correct 13 ms 716 KB Output is correct
23 Correct 11 ms 780 KB Output is correct
24 Correct 13 ms 780 KB Output is correct
25 Correct 11 ms 716 KB Output is correct
26 Correct 10 ms 716 KB Output is correct
27 Correct 10 ms 760 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 524 KB Output is correct
2 Correct 31 ms 460 KB Output is correct
3 Correct 30 ms 532 KB Output is correct
4 Correct 8 ms 460 KB Output is correct
5 Correct 9 ms 540 KB Output is correct
6 Correct 10 ms 532 KB Output is correct
7 Correct 21 ms 544 KB Output is correct
8 Correct 30 ms 460 KB Output is correct
9 Correct 24 ms 528 KB Output is correct
10 Correct 31 ms 460 KB Output is correct
11 Correct 25 ms 556 KB Output is correct
12 Correct 22 ms 532 KB Output is correct
13 Correct 28 ms 532 KB Output is correct
14 Correct 14 ms 536 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 524 KB Output is correct
2 Correct 31 ms 460 KB Output is correct
3 Correct 30 ms 532 KB Output is correct
4 Correct 8 ms 460 KB Output is correct
5 Correct 9 ms 540 KB Output is correct
6 Correct 10 ms 532 KB Output is correct
7 Correct 21 ms 544 KB Output is correct
8 Correct 30 ms 460 KB Output is correct
9 Correct 24 ms 528 KB Output is correct
10 Correct 31 ms 460 KB Output is correct
11 Correct 25 ms 556 KB Output is correct
12 Correct 22 ms 532 KB Output is correct
13 Correct 28 ms 532 KB Output is correct
14 Correct 14 ms 536 KB Output is correct
15 Execution timed out 1090 ms 17552 KB Time limit exceeded
16 Halted 0 ms 0 KB -