oj.uz

답안 #560353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
560353 2022-05-11T10:16:41 Z Koosha_mv 정렬하기 (IOI15_sorting) C++14
0 / 100
 2 ms 852 KB 
#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#include "sorting.h"
 
const int N=2020;
 
int n,m,a[N],b[N],s[N],t[N],pos[N],mark[N];
vector<pair<int,int>> ans;

int findSwapPairs(int _n, int _a[], int _m, int _s[], int _t[], int P[], int Q[]) {
  n=_n,m=_m;
  f(i,0,n) a[i]=_a[i];
  f(i,0,m) P[i]=Q[i]=0,s[i]=_s[i],t[i]=_t[i];
  int cnt=0;
	f(i,0,n){
		/*if(pos[i]!=i){
			P[cnt]=i;
			Q[cnt]=pos[i];
			swap(pos[i],pos[a[i]]);
			swap(a[P[cnt]],a[Q[cnt]]);
			cnt++;
		}*/
		while(a[i]!=i){
			P[cnt]=i;
			Q[cnt]=a[i];
			swap(a[P[cnt]],a[Q[cnt]]);
			cnt++;
		}
	}
	if(cnt<m) P[cnt]=Q[cnt]=n-1,cnt++;
	return cnt;
}
/*
int32_t main(){
	srand(time(NULL));
	int n,m,a[100],s[100],t[100],p[100],q[100];
	cin>>n;
	m=n*n;
	//f(i,0,n) cin>>a[i];
	iota(a,a+n,0); //random_shuffle(a,a+n);
	do{
		cout<<endl<<endl;
		f(i,0,m) s[i]=t[i]=0;
		dbga(a,0,n);
		cout<<findSwapPairs(n,a,m,s,t,p,q)<<"R"<<'\n';
	} while(next_permutation(a,a+n));
}*/

Subtask #1
0 / 8.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 852 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 852 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -