oj.uz

Submission #230683

# Submission time Handle Problem Language Result Execution time Memory
230683 2020-05-11T04:12:11 Z monus1042 Gondola (IOI14_gondola) C++17
55 / 100
 31 ms 4752 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
#define ii pair<int, int>
#define vi vector<int>
#define vii vector<ii>
#define eb emplace_back
#define all(x) x.begin(), x.end()

int valid(int n, int inputSeq[])
{
	unordered_set<int> ch;
	for (int i=0; i<n; i++){
		ch.insert(inputSeq[i]);
	}
	if ((int)ch.size()==n){
		int fi=1000000, se=1000000;
		for (int i=0; i<n; i++){
			if (1<=inputSeq[i] && inputSeq[i]<=n && inputSeq[i]<fi){
				fi=inputSeq[i];
				se=i;
			}
		}
		if (fi==1000000){
			return 1;
		}else{
			bool check=1;
			for (int i=se, track=fi; i<se+n; i++, track++){
				if (1<=inputSeq[i%n] && inputSeq[i%n]<=n){
					if (inputSeq[i%n] == track){
						
					}else{
						check=0;
						break;
					}
				}
			}
			if (check) return 1;
			return 0;
		}
	}else{
		return 0;
	}
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	vii delta;
	int cnt=0;
	for (int i=0; i<n; i++){
		if (1<=gondolaSeq[i] && gondolaSeq[i]<=n){
			cnt++;
		}
	}
	if (!cnt){
		for (int i=0; i<n; i++){
			delta.eb(ii(gondolaSeq[i], i+1)); //del, #
		}
		sort(all(delta));

		vi ret;
		int curr=n+1;
		for (int i=0; i<n; i++){
			while(1){
				if (curr>delta[i].first) break;
				ret.eb(delta[i].second);
				delta[i].second=curr;
				curr++;
			}
		}
		int si=ret.size();
		for (int i=0; i<si; i++){
			replacementSeq[i]=ret[i];
		}
		return si;
	}else if (cnt==n){
		return 0;
	}else{
		//cout<<"XD\n";
		int mini=1000000, pos=0;
		for (int i=0; i<n; i++){
			if (gondolaSeq[i]<mini){
				mini=gondolaSeq[i];
				pos=i;
			}
		}
		int diff=mini-1;
		pos-=diff;
		pos%=n;
		pos+=n;
		pos%=n;

		//cout<<pos<<endl;
		vi ret;
		for (int i=pos, track=1; i<n+pos; i++, ++track){
			if (gondolaSeq[i%n]>n)
				delta.eb(ii(gondolaSeq[i%n], track));
		}

		sort(all(delta));
		//cout<<delta[0].second<<endl;
		int curr=n+1, dels=delta.size();
		for (int i=0; i<dels; i++){
			while(1){
				if (curr>delta[i].first) break;
				ret.eb(delta[i].second);
				delta[i].second=curr;
				curr++;
			}
		}
		int si=ret.size();
		for (int i=0; i<si; i++){
			replacementSeq[i]=ret[i];
		}
		return si;
	}
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 13 ms 2224 KB Output is correct
7 Correct 26 ms 4136 KB Output is correct
8 Correct 21 ms 4112 KB Output is correct
9 Correct 10 ms 1408 KB Output is correct
10 Correct 23 ms 4624 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 13 ms 2224 KB Output is correct
7 Correct 28 ms 4144 KB Output is correct
8 Correct 21 ms 4112 KB Output is correct
9 Correct 10 ms 1408 KB Output is correct
10 Correct 24 ms 4624 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 4 ms 384 KB Output is correct
13 Correct 15 ms 2224 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 31 ms 4752 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 15 ms 1024 KB Output is correct
12 Correct 18 ms 1280 KB Output is correct
13 Correct 20 ms 1532 KB Output is correct
14 Correct 16 ms 1024 KB Output is correct
15 Correct 28 ms 2516 KB Output is correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 384 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -