Submission #560302

#	Time	Username	Problem	Language	Result	Execution time	Memory
560302		Koosha_mv	Sorting (IOI15_sorting)	C++14	0 / 100	1 ms	852 KiB

sorting

#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;
  f(i,0,n) pos[a[i]]=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++;
		}
	}
	return cnt;
}

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:20:11: warning: unused parameter 'second' [-Wunused-parameter]
   20 | #define S second
      |           ^
sorting.cpp:29:48: note: in expansion of macro 'S'
   29 | int findSwapPairs(int _n, int A[], int _m, int S[], int T[], int P[], int Q[]) {
      |                                                ^
sorting.cpp:29:57: warning: unused parameter 'T' [-Wunused-parameter]
   29 | int findSwapPairs(int _n, int A[], int _m, int S[], int T[], int P[], int Q[]) {
      |                                                     ~~~~^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 12
• Subtask 3: 0 / 16
• Subtask 4: 0 / 18
• Subtask 5: 0 / 20
• Subtask 6: 0 / 26