Submission #516859

#	Time	Username	Problem	Language	Result	Execution time	Memory
516859		PoPularPlusPlus	Gondola (IOI14_gondola)	C++17	60 / 100	29 ms	4460 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}
#include "gondola.h"


ll multi(ll x , ll y){
	return (x*y)%mod;
}

ll power(ll x , ll y){
	x %= mod;
	ll res = 1;
	while(y > 0){
		if(y&1)res=multi(res,x);
		y=y>>1;
		x = multi(x,x);
	}
	return res;
}

int valid(int n, int arr[]){
	for(int i = 0; i < n; i++){
		if(arr[i] <= n){
			int cur = arr[i];
			int j = i + 1;
			j %= n;
			while(j != i){
				cur = 1 + (cur % n);
				if(cur != arr[j] && arr[j] <= n)return 0;
				j++;
				j %= n;
			}
			break;
		}
	}
	map<int,int> m;
	for(int i = 0; i < n; i++){
		m[arr[i]]++;
		if(m[arr[i]] == 2)return 0;
	}
	return 1;
}

int replacement(int n, int arr[], int res[]){
	vector<pair<int,int>> v;
	for(int i = 0; i < n; i++){
		if(arr[i] > n)v.pb(mp(arr[i] , i));
	}
	int ini[n];
	for(int i = 0; i < n; i++){
		ini[i] = i + 1;
	}
	for(int i = 0; i < n; i++){
		if(arr[i] <= n){
			ini[i] = arr[i];
			int j = i + 1;
			j %= n;
			int cur = 1 + arr[i] % n;
			while(j != i){
				ini[j] = cur;
				cur = 1 + cur % n;
				j++;
				j %=n;
			}
			break;
		}
	}
	int cur = 0;
	int j = 0;
	sv(v);
	while(j < (int)v.size()){
		while(cur + n + 1 < v[j].vf){
			res[cur] = ini[v[j].vs];
			ini[v[j].vs] = cur + n + 1;
			cur++;
		}
		res[cur] = ini[v[j].vs];
		ini[v[j].vs] = v[j].vf;
		cur++;
		j++;
	}
	return cur;
}

int countReplacement(int n, int arr[]){
	if(valid(n , arr) == 0)return 0;
	ll ans = 1;
	vector<pair<ll,int>> v;
	for(int i = 0; i < n; i++){
		if(arr[i] > n)v.pb(mp(arr[i] , i));
	}
	sv(v);
	ll last = n + 1;
	int j = 0;
	while(j < (int)v.size()){
		ll dif = v[j].vf - last;
		ll rem = v.size() - j;
		ans *= power(rem , dif);
		ans %= mod;
		last = v[j].vf + 1;
		j++;
	}
	return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10