제출 #926836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926836		NintsiChkhaidze	곤돌라 (IOI14_gondola)	C++17	60 / 100	33 ms	6992 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define pb push_back
#define s second
#define f first
#define ll long long
using namespace std;
int b[200005],c[200005],a[200005];
const int mod = 1e9 + 9;
 
int valid(int n, int gondolaSeq[]){
	map <int,int> mp;
	
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
		if (mp.find(a[i]) != mp.end()) return 0;
		mp[a[i]] = 1;
 		if (a[i] > n) continue;
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	if (k==-1) return 1;
		
	int m = 0;
	int st = a[k];
	for (int j = k; j < n; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (j - k);
	
	for (int j = 0; j < k; j++)
		if (a[j] <= n) b[++m] = a[j],c[m] = st + (n - k) + j;
	
	for (int i = 1; i <= m; i++){
		if (b[i] != c[i]) return 0;
	}
  	return 1;
}
 
//----------------------
 
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
	int k = -1;
	for (int i=0;i<n;i++){
		a[i] = gondolaSeq[i];
 		if (a[i] > n) continue;
 		
		if (k == -1) k= i;
		else if (a[k] > a[i]) k = i;
	}
	int st;
	if (k == -1) k = 0,st = 1;
	else st = a[k];
		
	for (int j = k; j < n; j++) b[j] = st + (j - k);	
	for (int j = 0; j < k; j++) b[j] = st + (n - k) + j;
	for (int j = 0; j < n; j++) if (b[j] > n)  b[j] -= n;
	
	int x = n + 1,m = -1;
	vector <pair <int,int> > vec;
	for (int i=0;i<n;i++){
		if (gondolaSeq[i] > n) vec.pb({gondolaSeq[i],i});
	}
	sort(vec.begin(),vec.end());
	
	for (int j=0;j<vec.size();j++){
		int final = vec[j].f,i = vec[j].s;
		int cur = b[i];
		while (cur != final){
			replacementSeq[++m] = cur;
			cur = x++;
		}
	}
	
	return m + 1;
}
 
//----------------------
 
ll pwr(ll a,ll b){
 	ll c=1;
 	while (b){
 		if (b&1) c=c*a%mod;
 		a=a*a%mod;
 		b/=2;
	}
 	return c;
}
 
int countReplacement(int n, int inputSeq[]){
	int chk = valid(n,inputSeq);
	if (!chk) return 0;
	
	vector <int> vec;
	vec.pb(n);
	for (int i = 0; i < n; i++)
		if(inputSeq[i] > n) vec.pb(inputSeq[i]);
	sort(vec.begin(),vec.end());
	
	ll ans = 1,len = vec.size() - 1;
	for (int i = 1; i < vec.size(); i++){
		ll dist = vec[i] - vec[i - 1];
		ans = ans * pwr(dist,len - i) % mod;
	}
	return ans;
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  for (int j=0;j<vec.size();j++){
      |               ~^~~~~~~~~~~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:101:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |  for (int i = 1; i < vec.size(); 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: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10