oj.uz

Submission #96282

# Submission time Handle Problem Language Result Execution time Memory
96282 2019-02-07T19:29:16 Z figter001 Gondola (IOI14_gondola) C++14
60 / 100
 20 ms 2276 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+7;

int f[maxs],o[maxn];

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;
}

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

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

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:86:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<v.size()-1;i++){
              ~^~~~~~~~~~~
gondola.cpp:89:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(v.size() == n+1)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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
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 252 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 12 ms 1016 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 10 ms 1016 KB Output is correct

Subtask #3
10.0 / 10.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 376 KB Output is correct
6 Correct 6 ms 632 KB Output is correct
7 Correct 12 ms 1016 KB Output is correct
8 Correct 10 ms 888 KB Output is correct
9 Correct 4 ms 504 KB Output is correct
10 Correct 12 ms 980 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 8 ms 1272 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 13 ms 1148 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 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #5
10.0 / 10.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 252 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 2 ms 376 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 380 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 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 11 ms 1016 KB Output is correct
12 Correct 12 ms 1016 KB Output is correct
13 Correct 15 ms 1404 KB Output is correct
14 Correct 19 ms 1016 KB Output is correct
15 Correct 20 ms 2276 KB Output is correct

Subtask #7
5.0 / 5.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

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
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 380 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.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 504 KB Output is correct
5 Incorrect 2 ms 376 KB Output isn't correct
6 Halted 0 ms 0 KB -