oj.uz

Submission #165376

# Submission time Handle Problem Language Result Execution time Memory
165376 2019-11-26T15:57:23 Z cfalas Gondola (IOI14_gondola) C++14
60 / 100
 63 ms 8248 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long

int valid(int n, int a[]){
	map<int, bool> used;
	for(int i=0;i<n;i++){
		if(used[a[i]]) return 0;
		used[a[i]] = true;

	}
	int s = 0;
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			s = i;
			break;
		}
	}

	for(int i=0;i<n;i++){
		if(a[i]<=n && (a[i]+(s-i) - 1 + n)%n + 1 != a[s]) return 0; }
	return 1;
}

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

int replacement(int n, int a[], int ans[]){
	int apos=-1, av;
	int maxf=0;
	int minf = 0;
	unordered_map<int, int> m;
	for(int i=0;i<n;i++){
		if(a[i]<=n) apos = i, av=a[i];
		else m[a[i]] = i+1;
		maxf = max(maxf, a[i]);
		if(a[minf]>a[i]) minf = i;
	}
	if(apos==-1){
		apos = minf;
		av = 1;
	}
	queue<int> q;
	int l=0;
	for(int i=n+1;i<=maxf;i++){
		if(m[i]){
			int c = l - 1;
			ans[l] = (n + av - (apos - m[i] + 1) - 1) % n + l - c;
			l++;
			//cout<<apos<<" "<<m[i]<<" "<<av<<endl;

			while(!q.empty()){
				ans[l] = q.front();
				q.pop();
				l++;
			}
		}
		else q.push(i);
	}
	return l;
}

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

int mpow(int a, int b){
	if(b==0) return 1;
	if(b==1) return a;
	ll z = mpow(a, b/2);
	z*=z;
	z%=MOD;
	if(b%2) z*=a;
	z%=MOD;
	return z;
}

int countReplacement(int n, int a[]){
	if(!valid(n, a)){
		return 0;
	}
	vector<int> gaps;
	int act=-1;
	int un=0;
	for(int i=0;i<n;i++){
		if(a[i]<=n){
			act = i;
		}
		else un++;
	}
	sort(a, a+n);
	int ans=1;
	if(!act==-1) ans*=n;
	for(int i=0;i<n-1;i++){
		if(a[i+1]<=n) continue;
		//cout<<un<<" "<<mpow(un, a[i+1]-a[i]-1)<<" "<<a[i]<<" "<<a[i+1]<<endl;
		ans *= mpow(un, a[i+1]-a[i]-1);
		ans%=MOD;
		un--;
	}
	return ans;
}

Compilation message

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:92:9: warning: logical not is only applied to the left hand side of comparison [-Wlogical-not-parentheses]
  if(!act==-1) ans*=n;
         ^~
gondola.cpp:92:5: note: add parentheses around left hand side expression to silence this warning
  if(!act==-1) ans*=n;
     ^~~~
     (   )
gondola.cpp:92:9: warning: comparison of constant '-1' with boolean expression is always false [-Wbool-compare]
  if(!act==-1) ans*=n;
     ~~~~^~~~

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 256 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 400 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 504 KB Output is correct
6 Correct 21 ms 2396 KB Output is correct
7 Correct 14 ms 760 KB Output is correct
8 Correct 44 ms 4344 KB Output is correct
9 Correct 13 ms 1656 KB Output is correct
10 Correct 51 ms 5112 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 21 ms 2428 KB Output is correct
7 Correct 14 ms 1144 KB Output is correct
8 Correct 37 ms 4600 KB Output is correct
9 Correct 13 ms 1528 KB Output is correct
10 Correct 50 ms 4984 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 25 ms 2168 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 63 ms 5240 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 380 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 504 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 376 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 3 ms 632 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 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 368 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 12 ms 1016 KB Output is correct
12 Correct 13 ms 1272 KB Output is correct
13 Correct 32 ms 3980 KB Output is correct
14 Correct 12 ms 1144 KB Output is correct
15 Correct 54 ms 8248 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 316 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 252 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 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 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 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 2 ms 256 KB Output isn't correct
8 Halted 0 ms 0 KB -