oj.uz

Submission #385926

# Submission time Handle Problem Language Result Execution time Memory
385926 2021-04-05T08:44:30 Z aarr Gondola (IOI14_gondola) C++14
25 / 100
 43 ms 5732 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 100 * 1000 + 5, M = 300 * 1000 + 5;

int b[N];
int pos[M];
int c[N];
bool mark[M];

int valid(int n, int a[]) {
	vector <pair <int, int> > vec;
	set <int> s;
	for (int i = 0; i < n; i++) {
		if (a[i] <= n) {
			vec.push_back({a[i], i});
		}
		s.insert(a[i]);
	}
	if (s.size() != n) {
		return 0;
	}
	int cnt = 0;
	for (int i = 1; i < vec.size(); i++) {
		if (vec[i].second - vec[i - 1].second != (vec[i].first - vec[i - 1].first + n) % n) {
			return 0;
		}
	}
	return 1;
}

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

int replacement(int n, int a[], int ans[]) {
	int maxi = 0, x = -1;
	for (int i = 0; i < n; i++) {
		maxi = max(maxi, a[i]);
		if (x <= n) {
			x = i;
		}
	}
	if (maxi == n) {
		return 0;
	}
	if (x == -1) {
		for (int i = 0; i < maxi - n; i++) {
			ans[i] = 1;
		}
		return maxi - n;
	}
	else {
		for (int i = 0; i < n; i++) {
			b[(i + a[x] - 1) % n] = a[(i + x) % n];
		}
	//	int mxpos = 0;
		for (int i = 0; i < n; i++) {
			mark[b[i]] = true;
			pos[b[i]] = i;
			c[i] = i + 1;
	//		if (b[i] == maxi) {
	//			mxpos = n;
	//		}
		}
		for (int i = n + 1; i <= maxi; i++) {
			if (!mark[b[i]]) {
				ans[i - n - 1] = c[pos[maxi]];
				c[pos[maxi]] = i;
			}
			else {
				ans[i - n - 1] = c[pos[i]];
				c[pos[i]] = i;				
			}
		}
		return maxi - n;
	}
}

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

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:21:15: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |  if (s.size() != n) {
      |      ~~~~~~~~~^~~~
gondola.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |  for (int i = 1; i < vec.size(); i++) {
      |                  ~~^~~~~~~~~~~~
gondola.cpp:24:6: warning: unused variable 'cnt' [-Wunused-variable]
   24 |  int cnt = 0;
      |      ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 13 ms 2792 KB Output is correct
7 Correct 33 ms 4832 KB Output is correct
8 Correct 26 ms 5092 KB Output is correct
9 Correct 8 ms 1768 KB Output is correct
10 Correct 30 ms 5728 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 14 ms 2792 KB Output is correct
7 Correct 34 ms 4832 KB Output is correct
8 Correct 26 ms 5092 KB Output is correct
9 Correct 8 ms 1768 KB Output is correct
10 Correct 30 ms 5728 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 16 ms 2412 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 43 ms 5732 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 2 ms 512 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 384 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 1 ms 364 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 1 ms 364 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 2 ms 364 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -