제출 #602621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
602621		Vanilla	곤돌라 (IOI14_gondola)	C++17	35 / 100	18 ms	2588 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"
typedef long long int64;
using namespace std;

int valid(int n, int a[]){
	const int maxv = 2e5 + 5e4 + 3;

	int mp [maxv] = {};
	int in [n];
	int ps = -1;
	for (int i = 0; i < n; i++){
		if (a[i] <= n) ps = i;
	}
	if (ps == -1){
		for (int i = 0; i < n; i++) in[i] = i + 1;
	}
	else {
		for (int i = ps, v = a[ps]; !in[i]; i = (i + 1) % n, v = v % n + 1) in[i] = v;
	}
	for (int i = 0; i < n; i++){
		mp[a[i]]++;
		if (mp[a[i]] > 1) return 0;
	}
	for (int i = 0; i < n; i++){
		if (a[i] <= n && a[i] != in[i]) return 0;
	}
	return 1;
}

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

int replacement(int n, int a[], int rs[]){
	const int maxv = 2e5 + 5e4;

	int in[n] = {};
	int l = 0;
	int ct = n + 1;
	int ps = -1;
	vector <pair <int, int> > v;
	for (int i = 0; i < n; i++){
		v.push_back({a[i], i});
		if (a[i] <= n) ps = i;
	}
	sort(v.begin(), v.end());
	if (ps == -1){
		for (int i = 0; i < n; i++) in[i] = i + 1;
	}
	else {
		for (int i = ps, v = a[ps]; !in[i]; i = (i + 1) % n, v = v % n + 1) in[i] = v;
	}
	for (auto [val, pos]: v) {
		while (in[pos] != val) {
			rs[l++] = in[pos];
			in[pos] = ct++;
		}
	}

	return l;
}

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

int countReplacement(int n, int a[]){
	const int maxv = 1e6 + 2;
	const int64 mod = 1e9 + 9;
	return -3;
}

컴파일 시 표준 에러 (stderr) 메시지

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:34:12: warning: unused variable 'maxv' [-Wunused-variable]
   34 |  const int maxv = 2e5 + 5e4;
      |            ^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:65:12: warning: unused variable 'maxv' [-Wunused-variable]
   65 |  const int maxv = 1e6 + 2;
      |            ^~~~
gondola.cpp:66:14: warning: unused variable 'mod' [-Wunused-variable]
   66 |  const int64 mod = 1e9 + 9;
      |              ^~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10