제출 #780221

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780221		NothingXD	곤돌라 (IOI14_gondola)	C++17	100 / 100	30 ms	4192 KiB

gondola

#include "gondola.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef complex<ld> point;

void debug_out(){cerr << endl;}

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cout << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)



int valid(int n, int a[]){
	int idx = -1;
	vector<int> num;
	for (int i = 0; i < n; i++){
		if (a[i] <= n) idx = i;
		num.push_back(a[i]);
	}
	sort(all(num));
	num.resize(distance(num.begin(), unique(all(num))));
	if (num.size() < n) return 0;
	if (idx == -1) return 1;
	vector<int> v;
	idx -= (a[idx] - 1);
	if (idx < 0) idx += n;
	for (int i = 0; i < n; i++){
		v.push_back(a[(idx+i)%n]);
	}
	for (int i = 0; i < n; i++){
		if (v[i] <= n && v[i] != i+1) return 0;
	}
	return 1;
}

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

const int maxn = 3e5 + 10;

int val[maxn];
int mark[maxn];

int replacement(int n, int a[], int res[]){
	memset(mark, -1, sizeof mark);
	int mx = *max_element(a, a + n);
	int ans = mx - n;
	if (ans == 0) return ans;
	int idx =  min_element(a, a + n) - a;
	if (a[idx] > n){
		for (int i = 0; i < n; i++){
			val[i] = i+1;
		}
	}
	else{
		idx -= (a[idx] - 1);
		if (idx < 0) idx += n;
		for (int i = 0; i < n; i++){
			val[(idx+i)%n] = i+1;
		}
	}
	set<int> st;
	for (int i = 0; i < n; i++){
		if (a[i] != val[i]) st.insert(i);
		mark[a[i]] = i;
	}
	for (int i = n+1; i <= mx; i++){
		if (mark[i] != -1){
			res[i-n-1] = val[mark[i]];
			val[mark[i]] = i;
			st.erase(mark[i]);
			continue;
		}
		int idx = *(st.begin());
		res[i-n-1] = val[idx];
		val[idx] = i;
	}
	return ans;
}

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

const int mod = 1e9 + 9;

int pwr(int a, int b){
	int res = 1;
	for (; b; b >>= 1, a = 1ll * a * a % mod) if (b & 1) res = 1ll * res * a % mod;
	return res;
}

int countReplacement(int n, int a[]){
	vector<int> v;
	for (int i = 0; i < n; i++){
		if (a[i] > n) v.push_back(a[i]);
	}
	sort(all(v));
	int ans = 1;
	int lst = n, cnt = v.size();
	for (auto x: v){
		ans = 1ll * ans * pwr(cnt, x - lst - 1) % mod;
		lst = x;
		cnt--;
	}
	if (v.size() == n){
		ans = 1ll * ans * n % mod;
	}

	return ans;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:37:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |  if (num.size() < n) return 0;
      |      ~~~~~~~~~~~^~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:118:15: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  118 |  if (v.size() == n){
      |      ~~~~~~~~~^~~~

• 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