제출 #289410

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
289410		Shafin666	곤돌라 (IOI14_gondola)	C++14	100 / 100	81 ms	6768 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define pii pair<ll, ll>
#define nyan "(=^･ω･^=)"
#define read_input         freopen("in.txt","r", stdin)
#define print_output       freopen("out.txt","w", stdout)
typedef long long ll;
typedef long double ld;
using namespace std;
 
const int maxn = 3e5+10;
 
int next(int p, int n) {
	int ret = (p + 1) % n;
	return (ret == 0)? n : ret;
}
 
int prev(int p, int n) {
	if(p == 0) return n-1;
	else return p-1;
}

int valid(int n, int inputSeq[])
{
	set<int> s;
	for(int i = 0; i < n; i++) s.insert(inputSeq[i]);
	if(s.size() != n) return 0;

	vector<pii> v;
	for(int i = 0; i < n; i++) {
		if(inputSeq[i] <= n) v.pb({inputSeq[i], i});
	}

	if(v.empty()) return 1;

	sort(v.begin(), v.end());
	for(int i = 0; i < v.size() - 1; i++) {
		int del = v[i+1].first - v[i].first;
		int del2 = v[i+1].second - v[i].second;
		if(del2 < 0) del2 += n;

		if(del != del2) return 0;
	}
  	return 1;
}
 
//----------------------
 
int pos[maxn];
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	memset(pos, -1, sizeof pos);
 
	vector<int> v, dummy, target(n);
	int mx = 0, none = 1;
 
	for(int i = 0; i < n; i++) {
		if(gondolaSeq[i] > n) {
			dummy.pb(i);
			pos[gondolaSeq[i]] = i;
			mx = max(mx, gondolaSeq[i]);
		}
		else none = 0;
	}

	for(int i = 0; i < n; i++) target[i] = gondolaSeq[i];
 
	if(!none) {
		for(int i = 0; i < n; i++) {
			if(gondolaSeq[prev(i, n)] >= 1 && gondolaSeq[prev(i, n)] <= n)
				gondolaSeq[i] = next(gondolaSeq[prev(i, n)], n);
		}
 
		for(int i = 0; i < n; i++) {
			if(gondolaSeq[prev(i, n)] >= 1 && gondolaSeq[prev(i, n)] <= n)
				gondolaSeq[i] = next(gondolaSeq[prev(i, n)], n);
		}
	}
	else {
		for(int i = 0; i < n; i++) gondolaSeq[i] = i+1;
	}
 
	for(int i = n+1, d = 0; i <= mx; i++) {
		if(pos[i] == -1) {
			while(gondolaSeq[dummy[d]] == target[dummy[d]]) d++;
			v.pb(gondolaSeq[dummy[d]]), gondolaSeq[dummy[d]] = i;
		}
		else v.pb(gondolaSeq[pos[i]]), gondolaSeq[pos[i]] = i;
	} 
 
	int idx = 0;
	for(auto i : v) replacementSeq[idx++] = i;
 
  	return v.size();
}
 
//----------------------
 
const ll mod = 1e9+9;

ll bigmod(ll a, ll b) {
	if(b == 0) return 1;
	ll x = bigmod(a, b/2);
	x = (x * x) % mod;
	if(b & 1) x = (x * a) % mod;
	return x;
}

int countReplacement(int n, int inputSeq[])
{
	if(!valid(n, inputSeq)) return 0;

	vector<ll> v;
	for(ll i = 0; i < n; i++) v.pb(inputSeq[i]);

	sort(v.begin(), v.end(), greater<ll>());

	ll ret = 1;
	if(v[n-1] > n) {
		v.pb(1);
		ret = (ret * n) % mod;
	}
	

	for(ll i = 0; i < v.size() - 1; i++) {
		ll now = v[i]; 
		if(v[i] <= n+1) break;
		ll nxt = max(n * 1LL, v[i+1]);

		ll btn = now - nxt - 1;
		ret = (ret * bigmod(i+1, btn)) % mod;
	}

  	return ret;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:28:14: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |  if(s.size() != n) return 0;
      |     ~~~~~~~~~^~~~
gondola.cpp:38:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for(int i = 0; i < v.size() - 1; i++) {
      |                 ~~^~~~~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:127:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |  for(ll i = 0; i < v.size() - 1; i++) {
      |                ~~^~~~~~~~~~~~~~

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