oj.uz

답안 #138286

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
138286 2019-07-29T16:50:37 Z MvC 정렬하기 (IOI15_sorting) C++11
20 / 100
 3 ms 508 KB 
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include "sorting.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e6+50;
const int mod=1e9+7;
using namespace std;
int s[nmax],x[nmax],y[nmax],p[nmax],px[nmax],py[nmax],cr[nmax],i,n,m,ss[nmax],vl[nmax];
//int rx[nmax],ry[nmax];
int findSwapPairs(int N,int S[],int M,int X[],int Y[],int rx[],int ry[])
{
	n=N,m=M;
	for(i=0;i<n;i++)s[i]=S[i];
	for(i=0;i<m;i++)
	{
		x[i]=X[i];
		y[i]=Y[i];
	}
	for(i=0;i<n;i++)
	{
		p[i]=i;
		px[s[i]]=i;
		py[i]=i;
		ss[i]=s[i];
		vl[i]=s[i];
		cr[i]=i;
	}
	for(i=0;i<n;i++)
	{
		swap(p[x[i]],p[y[i]]);
	}
	int j=0;
	for(i=0;i<n;i++)
	{
		swap(py[x[i]],py[y[i]]);
		cr[py[x[i]]]=x[i];
		cr[py[y[i]]]=y[i];
      	if(px[i]==i)continue;
		rx[j]=cr[p[i]];
		ry[j]=cr[px[i]];
		j++;
		swap(px[i],px[ss[p[i]]]);
		swap(ss[px[ss[p[i]]]],ss[p[i]]);
	}
	return j;
}

Compilation message

sorting.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("O3")
 
sorting.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization("unroll-loops")

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 508 KB Output is correct

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 508 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Incorrect 2 ms 376 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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