oj.uz

답안 #247522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
247522 2020-07-11T14:44:03 Z Evirir 곤돌라 (IOI14_gondola) C++17
40 / 100
 34 ms 2436 KB 
#include "gondola.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;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 1e9+9;

bool DEBUG = 0;
const int MAXN = 100005;
const int MAXA = 250005;

ll add(ll a, ll b){
	a+=b;
	a%=MOD;
	return a;
}

ll mult(ll a, ll b){
	if(a>=MOD) a%=MOD;
	if(b>=MOD) b%=MOD;
	return (a*b)%MOD;
}

int valid(int n, int inputSeq[])
{
	int minid=0;
	forn(i,0,n){
		if(inputSeq[minid]>inputSeq[i]){
			minid=i;
		}
	}
	
	int tmp[n];
	forn(i,0,n){
		tmp[i]=inputSeq[(minid+i)%n];
	}
	forn(i,0,n) inputSeq[i]=tmp[i];
	
	bool used[MAXA]{};
	int last=-1;
	for(int i=0;i<n;i++){
		if(used[inputSeq[i]]) return 0;
		used[inputSeq[i]]=1;
		
		if(inputSeq[i]<=n){
			if(last!=-1 && inputSeq[i]-inputSeq[last]!=i-last) return 0;
			last=i;
		}
	}
	
	return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	assert(valid(n, gondolaSeq));
	
	int loc[MAXA];
	mset(loc,-1);
	
	int large=0;
	for(int i=0;i<n;i++){
		loc[gondolaSeq[i]]=i;
		if(gondolaSeq[i]>gondolaSeq[large]){
			large=i;
		}
	}
	
	int a[n];
	int start=0,startval=1;
	for(int i=0;i<n;i++){
		if(gondolaSeq[i]<=n){
			start=i;
			startval=gondolaSeq[i];
			break;
		}
	}
	for(int i=start;;){
		a[i]=startval+(i-start+n)%n;
		
		i=(i+1)%n;
		if(i==start) break;
	}
	
	int ptr=0;
	for(int i=n+1;i<=gondolaSeq[large];i++){
		if(loc[i] == -1){
			//cout<<"Not found\n";
			replacementSeq[ptr++]=a[large];
			a[large]=i;
		}
		else{
			//cout<<"Found\n";
			replacementSeq[ptr++] = a[loc[i]];
			a[loc[i]]=i;
		}
	}
	
	return ptr;
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq)) return 0;
	
	ll ans=1;
	int cnt[MAXA]{}, loc[MAXA];
	mset(loc,-1);
	for(int i=0;i<n;i++){
		loc[inputSeq[i]]=i;
	}
	
	int Max=-1;
	forn(i,0,n){
		Max=max(Max, inputSeq[i]);
		cnt[inputSeq[i]]++;
	}
	
	int cur=0;
	forn(i,0,n){
		if(inputSeq[i]>n) cur++;
	}
	for(int i=n+1;i<=Max;i++){
		if(loc[i]!=-1){
			cur--;
			continue;
		}
		ans=mult(ans, cur);
	}
	
	return ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 512 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 512 KB Output is correct
6 Correct 10 ms 1024 KB Output is correct
7 Correct 18 ms 1664 KB Output is correct
8 Correct 15 ms 1536 KB Output is correct
9 Correct 8 ms 896 KB Output is correct
10 Correct 17 ms 1536 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 11 ms 1152 KB Output is correct
7 Correct 18 ms 1676 KB Output is correct
8 Correct 15 ms 1536 KB Output is correct
9 Correct 8 ms 820 KB Output is correct
10 Correct 17 ms 1536 KB Output is correct
11 Correct 5 ms 512 KB Output is correct
12 Correct 5 ms 640 KB Output is correct
13 Correct 11 ms 1152 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 34 ms 1656 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1536 KB Output is correct
2 Incorrect 6 ms 1536 KB Integer 3 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Incorrect 5 ms 1536 KB Integer 3 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Incorrect 5 ms 1536 KB Integer 3 violates the range [1, 2]
3 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 5 ms 1536 KB Output is correct
6 Correct 5 ms 1536 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 5 ms 1536 KB Output is correct
9 Correct 19 ms 2436 KB Output is correct
10 Correct 17 ms 2304 KB Output is correct
11 Correct 10 ms 1920 KB Output is correct
12 Correct 11 ms 1920 KB Output is correct
13 Incorrect 8 ms 1664 KB Output isn't correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1536 KB Output is correct
2 Correct 5 ms 1536 KB Output is correct
3 Correct 5 ms 1536 KB Output is correct
4 Correct 5 ms 1536 KB Output is correct
5 Correct 6 ms 1536 KB Output is correct
6 Correct 5 ms 1536 KB Output is correct
7 Correct 5 ms 1536 KB Output is correct
8 Correct 5 ms 1536 KB Output is correct
9 Correct 18 ms 2432 KB Output is correct
10 Correct 16 ms 2432 KB Output is correct
11 Correct 10 ms 1840 KB Output is correct
12 Correct 11 ms 1920 KB Output is correct
13 Incorrect 8 ms 1664 KB Output isn't correct
14 Halted 0 ms 0 KB -