oj.uz

답안 #1018886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1018886 2024-07-10T10:38:50 Z amirhoseinfar1385 정렬하기 (IOI15_sorting) C++17
16 / 100
 2 ms 600 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000000+10;
int all[maxn],n,q,fake[maxn],vis[maxn],lnk[maxn];
pair<int,int>alltagh[maxn];

void khor(){
	for(int i=0;i<n;i++){
		cout<<fake[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		cout<<all[i]<<" ";
	}
	cout<<endl;
	for(int i=0;i<n;i++){
		cout<<lnk[i]<<endl;
	}
	cout<<endl;
	cout<<endl;
}

vector<vector<int>> besaz(int ind){
	vector<vector<int>>ret;
	for(int i=0;i<n;i++){
		fake[i]=all[i];
		vis[i]=0;
	}
	for(int i=1;i<=ind;i++){
		swap(fake[alltagh[i].first],fake[alltagh[i].second]);
	}
	for(int i=0;i<n;i++){
		if(vis[i]==0){
			ret.push_back({});
			int now=i;
			while(vis[now]==0){
		//		cout<<now<<" "<<fake[now]<<endl;
				vis[now]=1;
				ret.back().push_back(now);
				now=fake[now];
			}
		}
	}
	return ret;
}

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++){
    	all[i]=S[i];
    	lnk[all[i]]=i;
    }
    q=M;
    for(int i=1;i<=q;i++){
    	alltagh[i]=make_pair(X[i-1],Y[i-1]);
    }
   	vector<vector<int>>ger=besaz(q);
   	int now=0;
   	for(int i=0;i<(int)ger.size();i++){
   		//cout<<i<<" "<<(int)ger[i].size()<<endl;
   		//int tof=ger[i][0];
   		for(int j=1;j<(int)ger[i].size();j++){
   			P[now]=min(ger[i][j],ger[i][j-1]);
   			Q[now]=max(ger[i][j],ger[i][j-1]);
   			now++;
   		}
   	}
   	for(int i=now;i<q;i++){
   		P[i]=Q[i]=0;
   	}
   	for(int i=1;i<=q;i++){
   		swap(lnk[all[alltagh[i].first]],lnk[all[alltagh[i].second]]);
   		swap(all[alltagh[i].first],all[alltagh[i].second]);
   	//	khor();
   	//	cout<<"wtf: "<<fake[P[i-1]]<<" "<<fake[Q[i-1]]<<" "<<P[i-1]<<" "<<Q[i-1]<<endl;
   		P[i-1]=lnk[fake[P[i-1]]];
   		Q[i-1]=lnk[fake[Q[i-1]]];
   		swap(lnk[all[P[i-1]]],lnk[all[Q[i-1]]]);
   		swap(all[P[i-1]],all[Q[i-1]]);
   	//	khor();
   	}
	return q;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 1 ms 344 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 600 KB Output isn't correct
2 Halted 0 ms 0 KB -