Submission #122254

#	Time	Username	Problem	Language	Result	Execution time	Memory
122254		liwi	Gondola (IOI14_gondola)	C++11	0 / 100	3 ms	768 KiB

gondola

#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 1000000007
#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] = {2,3,4,12,6,7,1};
set<int> s;

vector<int> getSequence(int n, int seq[MAXN]){
	int mx = 0; for(int i=0; i<n; i++) mx = max(mx,seq[i]);
	for(int i=1; i<=mx; i++) s.insert(i);

	priority_queue<pii> q;
	for(int i=0; i<n; i++){
		q.push(mp(seq[i],i));
		s.erase(seq[i]);
	}
	while(q.size()){
		pii t = q.top(); q.pop();
		if(t.first <= n) continue;
		int nxt = *s.rbegin();
		q.push(mp(nxt,t.second));
		s.erase(nxt);
		seq[t.second] = nxt;
	}
	vector<int> v(MAXN,0);
	for(int i=0; i<n; i++)
		v[i] = 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);
	int idx = -1;
	for(int i=0; i<n; i++)
		if(v[i] == 1)
			idx = i;
	rotate(v.begin(),v.begin()+idx,v.end());
	for(int i=1; i<n; i++)
		if(v[i] != v[i-1]+1)
			return 0;
	for(int i=0; i<n; i++) seq[i] = v[i];
	return 1;
}

int replacement(int n, int gondolaSeq[MAXN], int replacementSeq[MAXV]){
	vector<int> v = getSequence(n,gondolaSeq);
	set<int> not_done;
	for(int i=0; i<n; i++)
		not_done.insert(i);
	priority_queue<pii,vector<pii>,greater<pii>> q;
	for(int i=0; i<n; i++)
		q.push(mp(replacementSeq[i],i));
	int cnt = 0;
	for(int i=0; i<n; i++)
		cnt = max(cnt,v[i]);
	vector<int> res;
	while(q.size()){
		int rand_idx = *not_done.begin();
		while(cnt < q.top().first-1) replacementSeq[cnt++] = rand_idx;
		replacementSeq[cnt++] = q.top().second;
		q.pop();
	}
	return cnt-1;
}

int countReplacement(int n, int inputSeq[MAXN]){

}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:116:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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