oj.uz

Submission #165199

# Submission time Handle Problem Language Result Execution time Memory
165199 2019-11-25T19:34:46 Z cfalas Gondola (IOI14_gondola) C++14
55 / 100
 54 ms 8060 KB 
#include "gondola.h"
#include<bits/stdc++.h>
using namespace std;

int valid(int n, int a[]){
	int cnt=0;
	for(int i=1;i<n;i++){
		if(a[i]!=a[i-1]+1) cnt++;

	}
	return (cnt<=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 countReplacement(int n, int a[]){
	if(!valid(n, a)){
		return 0;
	}
	sort(a, a+n);
	int ans=1;
	for(int i=0;i<n;i++){
		if(a[i]<=n) continue;
		ans += max((a[i+1]-a[i]-3), 0);
	}
	return ans;
}

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 256 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 376 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 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 13 ms 632 KB Output is correct
8 Correct 11 ms 632 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 12 ms 632 KB Output is correct

Subtask #3
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 252 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 14 ms 632 KB Output is correct
8 Correct 10 ms 600 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 12 ms 632 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 7 ms 504 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 14 ms 632 KB Output is correct

Subtask #4
5.0 / 5.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 380 KB Output is correct
4 Correct 2 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 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
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 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

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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 372 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 548 KB Output is correct
11 Correct 11 ms 632 KB Output is correct
12 Correct 13 ms 632 KB Output is correct
13 Correct 31 ms 3844 KB Output is correct
14 Correct 12 ms 632 KB Output is correct
15 Correct 54 ms 8060 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -