oj.uz

Submission #96284

# Submission time Handle Problem Language Result Execution time Memory
96284 2019-02-07T20:00:28 Z figter001 Gondola (IOI14_gondola) C++14
100 / 100
 77 ms 6744 KB 
#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int maxs = 3e5;
const int maxn = 1e5;
const int mod = 1e9+9;

int o[maxn];
map<int,int> f;

int valid(int n, int s[]){
	int st = -1,mn = n+1;
	for(int i=0;i<n;i++){
		if(f[s[i]])return 0;
		f[s[i]] = 1;
		if(s[i] < mn){
			st = i;
			mn = s[i];
		}
	}
	if(st == -1)return 1;
	for(int i=st;i<n;i++){
		if(s[i] <= n && s[i] != mn)return 0;
		mn++;
	}
	for(int i=0;i<st;i++){
		if(s[i] <= n && s[i] != mn)return 0;
		mn++;
	}
	return 1;
}

//----------------------

int replacement(int n, int s[], int rep[]){
	int l=0;
	int st = -1,mn = n+1;
	vector<pair<int,int>> to;
	for(int i=0;i<n;i++){
		if(s[i] <= mn){
			st = i;
			mn = s[i];
		}
		if(s[i] > n)to.push_back({s[i],i});
	}
	sort(to.begin(),to.end());
	if(st == -1){
		st = 0;
		mn = 1;
	}
	for(int i=st;i<n;i++){
		o[i] = mn++;
		mn%=(n+1);
		if(!mn)mn++;
	}
	for(int i=0;i<st;i++){
		o[i] = mn++;
		mn%=(n+1);
		if(!mn)mn++;
	}
	int cur = n+1;
	for(int i=0;i<(int)to.size();i++){
		int id = to[i].second;
		while(o[id] < to[i].first){
			rep[l++] = o[id];
			o[id] = cur;
			cur++;
		}
	}
	return l;
}

//----------------------

ll Pow(ll a,ll b){
	if(!b)return 1;
	ll res = Pow(a,b/2);
	if(b%2)return ((res*res)%mod*a)%mod;
	return (res*res)%mod;
}

int countReplacement(int n, int s[]){
	if(!valid(n,s))return 0;
	vector<int> v;
	for(int i=0;i<n;i++)
		if(s[i] > n)
			v.push_back(s[i]);
	sort(v.begin(),v.end());
	int L = n + 1,sz = v.size();
	ll ans = 1;
	for(int i=0;i<v.size();i++){
		ans = (ans * Pow(sz,v[i] - L)) % mod;
		L = v[i] + 1;
		sz--;
	}
	if(v.size() == n)ans = (ans * n)%mod;
	return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:94:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<v.size();i++){
              ~^~~~~~~~~
gondola.cpp:99:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v.size() == n)ans = (ans * n)%mod;
     ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 16 ms 2168 KB Output is correct
7 Correct 16 ms 632 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 40 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 16 ms 2168 KB Output is correct
7 Correct 12 ms 632 KB Output is correct
8 Correct 29 ms 3960 KB Output is correct
9 Correct 10 ms 1528 KB Output is correct
10 Correct 43 ms 4728 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 20 ms 2088 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 47 ms 4728 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 10 ms 1016 KB Output is correct
12 Correct 12 ms 1016 KB Output is correct
13 Correct 15 ms 1408 KB Output is correct
14 Correct 11 ms 1016 KB Output is correct
15 Correct 19 ms 2276 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 59 ms 4992 KB Output is correct
10 Correct 41 ms 4216 KB Output is correct
11 Correct 15 ms 1784 KB Output is correct
12 Correct 18 ms 2168 KB Output is correct
13 Correct 5 ms 760 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 424 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 51 ms 4964 KB Output is correct
10 Correct 40 ms 4348 KB Output is correct
11 Correct 15 ms 1788 KB Output is correct
12 Correct 18 ms 2168 KB Output is correct
13 Correct 6 ms 760 KB Output is correct
14 Correct 64 ms 6176 KB Output is correct
15 Correct 77 ms 6744 KB Output is correct
16 Correct 13 ms 1656 KB Output is correct
17 Correct 46 ms 4600 KB Output is correct
18 Correct 25 ms 2936 KB Output is correct