oj.uz

Submission #345667

# Submission time Handle Problem Language Result Execution time Memory
345667 2021-01-07T19:53:31 Z ogibogi2004 Sorting (IOI15_sorting) C++14
20 / 100
 2 ms 748 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;
const int MAXN=2e5+6;
vector<pair<int,int> >swaps;
int seq[MAXN],seq1[MAXN];
bool vis[MAXN];
int n;
vector<pair<int,int> >moves;
bool check(int x)
{
	for(int i=0;i<n;i++)
	{
		seq1[i]=seq[i];
	}
	for(int j=0;j<x&&j<swaps.size();j++)
	{
		swap(seq1[swaps[j].first],seq1[swaps[j].second]);
	}
	int cnt=0;
	memset(vis,0,sizeof(vis));
	moves.clear();
	/*cout<<x<<":";
	for(int i=0;i<n;i++)
	{
		cout<<seq1[i]<<" ";
	}
	cout<<endl;*/
	for(int i=0;i<n;i++)
	{
		if(vis[i]==0)
		{
			int u=i;
			while(vis[u]==0)
			{
				vis[u]=1;
				moves.push_back({i,seq1[u]});
				u=seq1[u];
			}
			cnt++;
			moves.pop_back();
		}
	}
	//cout<<x<<" "<<cnt<<endl;
	if(moves.size()<=x)
	{
		while(moves.size()<x)moves.push_back({0,0});
		return 1;
	}
	else return 0;
}
int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    n=N;
    for(int i=0;i<n;i++)seq[i]=S[i];
    for(int i=0;i<M;i++)swaps.push_back({X[i],Y[i]});
    int low=0,high=n,mid,ans;
    while(low<=high)
    {
		mid=(low+high)/2;
		if(check(mid))
		{
			ans=mid;
			high=mid-1;
		}
		else low=mid+1;
	}
	//cout<<ans<<endl;
	check(ans);
	for(int i=0;i<moves.size();i++)
	{
		P[i]=moves[i].first;Q[i]=moves[i].second;
	}
	return moves.size();
}

Compilation message

sorting.cpp: In function 'bool check(int)':
sorting.cpp:16: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]
   16 |  for(int j=0;j<x&&j<swaps.size();j++)
      |                   ~^~~~~~~~~~~~~
sorting.cpp:45:17: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   45 |  if(moves.size()<=x)
      |     ~~~~~~~~~~~~^~~
sorting.cpp:47:21: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |   while(moves.size()<x)moves.push_back({0,0});
      |         ~~~~~~~~~~~~^~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:69:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for(int i=0;i<moves.size();i++)
      |              ~^~~~~~~~~~~~~
sorting.cpp:73:19: warning: conversion from 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} to 'int' may change value [-Wconversion]
   73 |  return moves.size();
      |         ~~~~~~~~~~^~
sorting.cpp:68:7: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   68 |  check(ans);
      |  ~~~~~^~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 1 ms 492 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 492 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 1 ms 620 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Incorrect 1 ms 492 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -