oj.uz

Submission #122356

# Submission time Handle Problem Language Result Execution time Memory
122356 2019-06-28T05:27:39 Z liwi Gondola (IOI14_gondola) C++11
100 / 100
 80 ms 6520 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#include "gondola.h"

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000009
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 100001
#define MAXV 250001

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int arr[MAXN] = {3,4};
set<int> s;

vector<int> getSequence(int n, int seq[MAXN]){
	int idx = -1;
	for(int i=0; i<n; i++){
		if(seq[i] <= n){
			idx = i;
			break;
		}
	}
	if(idx == -1){
		vector<int> v(n); for(int i=1; i<=n; i++) v[i-1] = i;
		return v;
	}
	for(int i=1; i<n; i++){
		if(seq[(idx+i)%n] > n) continue;
		int req = (seq[idx]+i)%n;
		if(req == 0) req = n;
		if(req != seq[(idx+i)%n]) return {-1};
	}
	for(int i=1; i<n; i++){
		int req = (seq[idx]+i)%n;
		if(req == 0) req = n;
		seq[(idx+i)%n] = req;
	}
	vector<int> v; for(int i=0; i<n; i++) v.pb(seq[i]);
	return v;
}

int valid(int n, int seq[MAXN]){
	for(int i=0; i<n; i++){
		if(s.count(seq[i])) return 0;
		s.insert(seq[i]);
	}
	s.clear();
	vector<int> v = getSequence(n,seq);
	if(v[0] == -1) return 0;
	int idx = -1;
	for(int i=0; i<n; i++)
		if(v[i] == 1)
			idx = i;
	rotate(v.begin(),v.begin()+idx,v.begin()+n);
	for(int i=1; i<n; i++)
		if(v[i] != v[i-1]+1)
			return 0;
	return 1;
}

int replacement(int n, int gondolaSeq[MAXN], int replacementSeq[MAXV]){
	int tmp[MAXN]; memcpy(tmp,gondolaSeq,sizeof tmp);
	vector<int> v = getSequence(n,tmp);
	priority_queue<pii,vector<pii>,greater<pii>> q;
	for(int i=0; i<n; i++)
		q.push(mp(gondolaSeq[i],i));

	int cnt = 0, mx = n;
	while(q.size()){
		int vv = q.top().first, idx = q.top().second; q.pop();
		while(v[idx] < vv){
			replacementSeq[cnt++] = v[idx];
			v[idx] = ++mx;
		}
	}
	return cnt;
}

int countReplacement(int n, int seq[MAXN]){
	int a[MAXN]; memcpy(a,seq,sizeof a);
	if(!valid(n,a)) return 0;
	vector<int> v;
	for(int i=0; i<n; i++)
		if(seq[i] > n)
			v.pb(seq[i]);
	int rem_choose = (int)v.size(), lst = n;
	ll res = (rem_choose==n?n:1);
	sort(all(v));
	for(int i=0; i<v.size(); i++){
		int options = v[i]-lst-1;
		res = ((res*fpow(rem_choose,options,MOD))%MOD+MOD)%MOD;
		rem_choose--;
		lst = v[i];
	}
	return (int)res;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:125:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<v.size(); i++){
               ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 18 ms 2300 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 30 ms 4112 KB Output is correct
9 Correct 10 ms 1536 KB Output is correct
10 Correct 40 ms 4704 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 17 ms 2304 KB Output is correct
7 Correct 12 ms 768 KB Output is correct
8 Correct 31 ms 4164 KB Output is correct
9 Correct 11 ms 1536 KB Output is correct
10 Correct 40 ms 4600 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 20 ms 2176 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 51 ms 4856 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 3 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 3 ms 768 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 3 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 19 ms 2680 KB Output is correct
12 Correct 22 ms 2680 KB Output is correct
13 Correct 17 ms 1788 KB Output is correct
14 Correct 19 ms 2680 KB Output is correct
15 Correct 21 ms 2732 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 53 ms 4560 KB Output is correct
10 Correct 42 ms 3960 KB Output is correct
11 Correct 17 ms 2048 KB Output is correct
12 Correct 19 ms 2176 KB Output is correct
13 Correct 6 ms 1152 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 768 KB Output is correct
2 Correct 2 ms 768 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 2 ms 768 KB Output is correct
5 Correct 2 ms 768 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 56 ms 4600 KB Output is correct
10 Correct 43 ms 3968 KB Output is correct
11 Correct 18 ms 1920 KB Output is correct
12 Correct 19 ms 2176 KB Output is correct
13 Correct 6 ms 1024 KB Output is correct
14 Correct 69 ms 6008 KB Output is correct
15 Correct 80 ms 6520 KB Output is correct
16 Correct 13 ms 1792 KB Output is correct
17 Correct 49 ms 4600 KB Output is correct
18 Correct 26 ms 2944 KB Output is correct