oj.uz

답안 #321755

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
321755 2020-11-13T09:40:58 Z zaneyu 정렬하기 (IOI15_sorting) C++14
8 / 100
 4 ms 748 KB 
/*input
5
4 3 2 1 0
6
0 1
1 2
2 3
3 4
0 1
1 2

*/
#include "sorting.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e3+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int d1[maxn],d2[maxn];
int posf[maxn],at[maxn];
int s[maxn],x[maxn],y[maxn];
int f[maxn],inv[maxn];
int p[maxn],q[maxn];
int n;
bool wk(int m){
	REP(i,n) d1[i]=d2[i]=s[i];
	REP(i,m){
		swap(d1[x[i]],d1[y[i]]);
	}
	REP(i,n) posf[d1[i]]=i,at[d2[i]]=i;
	REP(i,n) f[at[i]]=posf[i];
	REP(i,n) inv[f[i]]=i;
	int cur=0;
	REP(i,m){
		swap(f[x[i]],f[y[i]]);
		swap(at[d2[x[i]]],at[d2[y[i]]]);
		swap(d2[x[i]],d2[y[i]]);
		inv[f[x[i]]]=x[i],inv[f[y[i]]]=y[i];
		bool swp=0;
		while(cur<n){
			if(inv[cur]!=at[cur]){
				int a=inv[cur],b=at[cur];
				swap(at[d2[a]],at[d2[b]]);
				swap(d2[a],d2[b]);
				p[i]=a,q[i]=b;
				swp=1;
				++cur;
				break;
			}
			++cur;
		}
		if(!swp){
			p[i]=q[i]=0;
		}
	}
	REP(i,n){
		if(d2[i]!=i) return false;
	}
	return true;
}
int findSwapPairs(int _n, int S[], int m, int X[], int Y[], int P[], int Q[]) {
	n=_n;
	REP(i,n) s[i]=S[i];
	REP(i,m) x[i]=X[i],y[i]=Y[i];
	int l=0,r=m;
	while(l<r){
		//cout<<l<<' '<<r<<'\n';
		int mid=(l+r)/2;
		if(wk(mid)) r=mid;
		else l=mid+1;
	}
	wk(l);
	REP(i,l) P[i]=p[i],Q[i]=q[i];
	return l;
}

Compilation message

sorting.cpp: In function 'll mypow(ll, ll, ll)':
sorting.cpp:50:26: warning: declaration of 'MOD' shadows a global declaration [-Wshadow]
   50 | ll mypow(ll a,ll b,ll MOD){
      |                          ^
sorting.cpp:38:10: note: shadowed declaration is here
   38 | const ll MOD=(1e9+7);
      |          ^~~
sorting.cpp: In function 'bool wk(int)':
sorting.cpp:71:23: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   71 |  REP(i,n) posf[d1[i]]=i,at[d2[i]]=i;
      |                       ^
sorting.cpp:71:35: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   71 |  REP(i,n) posf[d1[i]]=i,at[d2[i]]=i;
      |                                   ^
sorting.cpp:73:21: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   73 |  REP(i,n) inv[f[i]]=i;
      |                     ^

Subtask #1
8.0 / 8.0

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

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 2 ms 492 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

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

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Incorrect 2 ms 492 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 26.0

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