oj.uz

답안 #803030

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
803030 2023-08-02T19:40:50 Z BT21tata 정렬하기 (IOI15_sorting) C++17
0 / 100
 2 ms 596 KB 
#include "sorting.h"
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;

bool used[200005];
int pos[200005], cur[200005];

bool check(int n, int S[], int m, int X[], int Y[], int P[], int Q[])
{
	for(int i=0; i<n; i++)
		cur[i]=S[i];
	for(int i=0; i<m; i++)
		swap(cur[X[i]], cur[Y[i]]);
	memset(used, 0, sizeof(used));
	vector<pair<int,int>>ans;
	cout<<"check "<<m<<endl;
	for(int i=0; i<n; i++)
	{
		if(cur[i]!=i and !used[i])
		{
			vector<int>v; v.pb(i);
			int j=cur[i]; used[i]=1;
			while(j!=i)
			{
				v.pb(j);
				used[j]=1;
				j=cur[j];
			}
			//for(int u : v)cout<<u<<' ';cout<<endl;
			for(int j=0; j+1<v.size(); j++)
				ans.pb({v[j], v[j+1]});
		}
	}
	if(ans.size()>m) return 0;
	for(int i=0; i<n; i++)
		pos[S[i]]=i, cur[i]=S[i];
	for(int i=0; i<m; i++)
	{
		swap(cur[X[i]], cur[Y[i]]);
		swap(pos[cur[X[i]]], pos[cur[Y[i]]]);
		if(i<ans.size())
		{
			P[i]=pos[ans[i].F];
			Q[i]=pos[ans[i].S];
			swap(cur[P[i]], cur[Q[i]]);
			swap(pos[cur[P[i]]], pos[cur[Q[i]]]);
		}
		else P[i]=Q[i]=0;
	}
	return 1;
}

int findSwapPairs(int n, int S[], int M, int X[], int Y[], int P[], int Q[])
{
	int l=0, r=n-1;
	while(l<=r)
	{
		int mid=(l+r)>>1;
		if(check(n, S, mid, X, Y, P, Q))
			r=mid-1;
		else l=mid+1;
	}
	check(n, S, l, X, Y, P, Q);
	return l;
}
// 3 6 2 0 4 1 7 5 
// 1 6 7

Compilation message

sorting.cpp: In function 'bool check(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:33:12: warning: declaration of 'j' shadows a previous local [-Wshadow]
   33 |    for(int j=0; j+1<v.size(); j++)
      |            ^
sorting.cpp:25:8: note: shadowed declaration is here
   25 |    int j=cur[i]; used[i]=1;
      |        ^
sorting.cpp:33:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |    for(int j=0; j+1<v.size(); j++)
      |                 ~~~^~~~~~~~~
sorting.cpp:37:15: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |  if(ans.size()>m) return 0;
      |     ~~~~~~~~~~^~
sorting.cpp:44:7: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   if(i<ans.size())
      |      ~^~~~~~~~~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:56:39: warning: unused parameter 'M' [-Wunused-parameter]
   56 | int findSwapPairs(int n, int S[], int M, int X[], int Y[], int P[], int Q[])
      |                                   ~~~~^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 468 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 596 KB Expected integer, but "check" found
2 Halted 0 ms 0 KB -