oj.uz

Submission #959597

# Submission time Handle Problem Language Result Execution time Memory
959597 2024-04-08T13:35:39 Z 8pete8 Sorting (IOI15_sorting) C++17
100 / 100
 193 ms 27032 KB 
#include "sorting.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
using namespace std;
//#define int long long
#define double long double
const int mod=1e9+7,mxn=3e5+5,lg=60,inf=1e9,minf=-1e9;
int n;
int findSwapPairs(int N, int v[], int m, int x[], int y[], int p[], int q[]) {
	n=N;
	int l=0,r=m;
	vector<int>pos(n);
	for(int i=0;i<n;i++)pos[i]=i;//position that will end up at i
	vector<int>o;
	for(int i=0;i<n;i++)o.pb(v[i]);
	auto get=[&](int mid){
		int ans=0,cur=0;
		vector<int>rev(n);
		for(int i=0;i<n;i++)rev[v[i]]=i;
		vector<int>pos2(n);//where we will end up standing at i
		for(int i=0;i<n;i++)pos2[i]=i;
		for(int i=mid-1;i>=0;i--)swap(pos2[x[i]],pos2[y[i]]);
		for(int i=0;i<n;i++)pos[pos2[i]]=i;
		vector<pii>what(mid);
		for(int i=0;i<mid;i++){
			swap(pos[pos2[x[i]]],pos[pos2[y[i]]]);
			swap(pos2[x[i]],pos2[y[i]]);
			swap(rev[v[x[i]]],rev[v[y[i]]]);
			swap(v[x[i]],v[y[i]]);
			while(cur<n&&pos[cur]==rev[cur])cur++;
			if(cur<n){
				what[i]={pos[cur],rev[cur]};
				swap(rev[v[what[i].f]],rev[v[what[i].s]]);
				swap(v[what[i].f],v[what[i].s]);
				cur++;
				ans++;
			}
			else what[i]={0,0};
		}
		while(cur<n&&pos[cur]==rev[cur])cur++;
		return make_pair((cur>=n),what);
	};
	pair<int,vector<pii>>ans{inf,{}};
	while(l<=r){
		int mid=l+(r-l)/2;
		int cnt=0;
		pair<int,vector<pii>>bru=get(mid);
		if(bru.f)r=mid-1,ans=min(ans,{mid,bru.s});
		else l=mid+1;
		for(int i=0;i<n;i++)v[i]=o[i];
	}
	for(int i=0;i<ans.f;i++)p[i]=ans.s[i].f,q[i]=ans.s[i].s;
	return ans.f;
}/*
int32_t main(){
	int n;cin>>n;
	int v[n];
	for(int i=0;i<n;i++)cin>>v[i];
	int m;cin>>m;
	int x[m],y[m];
	for(int i=0;i<m;i++)cin>>x[i]>>y[i];
	int p[m],q[m];
	int g=findSwapPairs(n,v,m,x,y,p,q);
	cout<<g<<'\n';
	for(int i=0;i<g;i++){
		swap(v[x[i]],v[y[i]]);
		swap(v[p[i]],v[q[i]]);
	}
	for(int i=0;i<n;i++)cout<<v[i]<<" ";
	cout<<'\n';
}*/
/*
observation:
each starting element will end up somewhere after swapping
each element have distinct path to the end position
we can swap element to swap their path
swap can be made in any order?
if the min num of swap <= num of action
then its doable
min num of swap can increase by at most 1 per action (swapping it back to same pos)
so num of action-min num of swap is monotone
we can do bs? and check o(n)?
finding min num of swap: greedy?
*/

Compilation message

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:76:7: warning: unused variable 'cnt' [-Wunused-variable]
   76 |   int cnt=0;
      |       ^~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 444 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 444 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 452 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 860 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 856 KB Output is correct
24 Correct 1 ms 612 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 2 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 552 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 452 KB Output is correct
6 Correct 1 ms 608 KB Output is correct
7 Correct 2 ms 608 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 1 ms 608 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 552 KB Output is correct
15 Correct 120 ms 22872 KB Output is correct
16 Correct 173 ms 23356 KB Output is correct
17 Correct 189 ms 25992 KB Output is correct
18 Correct 71 ms 21356 KB Output is correct
19 Correct 124 ms 23448 KB Output is correct
20 Correct 143 ms 24124 KB Output is correct
21 Correct 144 ms 23964 KB Output is correct
22 Correct 119 ms 20104 KB Output is correct
23 Correct 141 ms 25700 KB Output is correct
24 Correct 184 ms 25088 KB Output is correct
25 Correct 175 ms 24896 KB Output is correct
26 Correct 142 ms 24308 KB Output is correct
27 Correct 135 ms 23396 KB Output is correct
28 Correct 179 ms 25304 KB Output is correct
29 Correct 169 ms 24756 KB Output is correct
30 Correct 101 ms 23280 KB Output is correct
31 Correct 187 ms 27032 KB Output is correct
32 Correct 132 ms 24584 KB Output is correct
33 Correct 193 ms 26592 KB Output is correct
34 Correct 153 ms 26608 KB Output is correct
35 Correct 131 ms 26468 KB Output is correct
36 Correct 53 ms 22800 KB Output is correct
37 Correct 181 ms 26044 KB Output is correct
38 Correct 173 ms 24772 KB Output is correct
39 Correct 178 ms 25120 KB Output is correct