Submission #1063711

# Submission time Handle Problem Language Result Execution time Memory
1063711 2024-08-18T00:03:26 Z pawned Gondola (IOI14_gondola) C++17
20 / 100
17 ms 5972 KB
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "gondola.h"

int valid(int N, int inputSeq[]) {
	vi a;
	for (int i = 0; i < N; i++) {
		a.pb(inputSeq[i] - 1);
	}
	int fpos = -1;	// fixed position
	int fval = -1;	// fixed val at position
	for (int i = 0; i < N; i++) {
		if (a[i] < N) {
			fpos = i;
			fval = a[i];
		}
	}
	vi b;
	if (fval > fpos) {
		int s = fval - fpos;
		for (int i = N - s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < N - s; i++) {
			b.pb(a[i]);
		}
	}
	else {
		int s = fpos - fval;
		for (int i = s; i < N; i++) {
			b.pb(a[i]);
		}
		for (int i = 0; i < s; i++) {
			b.pb(a[i]);
		}
	}
	for (int i = 0; i < N; i++) {
		if (b[i] < N) {
			if (b[i] != i)
				return 0;
		}
	}
	// all values must be diff
	set<int> allv;
	for (int x : b)
		allv.insert(x);
	if (allv.size() != N)
		return 0;
	return 1;
}

int replacement(int N, int gondolaSeq[], int replacementSeq[]) {
	return -2;
}

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

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:57:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   57 |  if (allv.size() != N)
      |      ~~~~~~~~~~~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 7 ms 2732 KB Output is correct
7 Correct 8 ms 3024 KB Output is correct
8 Correct 15 ms 5204 KB Output is correct
9 Correct 5 ms 1884 KB Output is correct
10 Correct 17 ms 5876 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 9 ms 2780 KB Output is correct
7 Correct 8 ms 3020 KB Output is correct
8 Correct 17 ms 5204 KB Output is correct
9 Correct 5 ms 1872 KB Output is correct
10 Correct 17 ms 5972 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 1824 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 8 ms 3280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Integer -3 violates the range [0, 1000000008]
2 Halted 0 ms 0 KB -