제출 #398022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398022		prvocislo	곤돌라 (IOI14_gondola)	C++17	65 / 100	66 ms	6772 KiB

gondola

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include "gondola.h"
typedef long long ll;
using namespace std;

int valid(int n, int v[])
{
	vector<int> o(n, -1);
	for (int i = 0; i < n; i++) v[i]--;
	set<int> s(v, v + n);
	for (int i = 0; i < n; i++)
	{
		if (v[i] >= n) continue;
		o[i] = v[i];
		for (int j = 0; j < n; j++) o[j] = (v[i] - i + j + n) % n;
		break;
	}
	if (s.size() != n) return 0;
	for (int i = 0; i < n; i++) if (v[i] < n && o[i] != v[i]) return 0;
	return 1;
}
int replacement(int n, int v[], int r[]) { return 0; }
const ll mod = 1e9 + 9;
int mul(const int& a, const int& b) { return (a * 1ll * b) % mod; }
int add(const int& a, const int& b) { return (a + b) % mod; }
void upd(int& a, const int& b) { a = (a + b) % mod; }
int pwr(const int& a, const int& b)
{
	if (!b) return 1;
	int m = pwr(a, b >> 1); m = mul(m, m);
	if (b & 1) m = mul(m, a);
	return m;
}
int countReplacement(int n, int v[])
{
	int *v2 = new int[n];
	for (int i = 0; i < n; i++)v2[i] = v[i];
	if (!valid(n, v2)) return 0;
	int m = 1;
	if (*min_element(v, v + n) > n)
		m = n;
	int num = 0;
	vector<int> e;
	for (int i = 0; i < n; i++)
	{
		if (v[i] > n) num++, e.push_back(v[i]);
	}
	sort(e.begin(), e.end()); int pv = n;
	for (int i = 0; i < e.size(); i++)
	{
		m = mul(m, pwr(num, e[i] - pv - 1));
		num--; pv = e[i];
	}
	return m;
}

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

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) return 0;
      |      ~~~~~~~~~^~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:52:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |  for (int i = 0; i < e.size(); i++)
      |                  ~~^~~~~~~~~~

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