Submission #340482

#	Time	Username	Problem	Language	Result	Execution time	Memory
340482		Kerim	곤돌라 (IOI14_gondola)	C++17	75 / 100	28 ms	3308 KiB

gondola

#include "gondola.h"
#include "bits/stdc++.h"
#define MAXN 300009
#define INF 1000000009
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
int vis[MAXN];
int valid(int n, int arr[]){
	memset(vis,0,sizeof vis);
	int mn=INF,who;
	for(int i=0;i<n;i++){
		if(vis[arr[i]])return 0;
		if(arr[i]<=n){
			if(umin(mn,arr[i]))
				who=i;
		}
		vis[arr[i]]=1;
	}
	if(mn>n)
		return 1;
	int res=1;
	for(int i=0;i<n;i++){
		int to=(who+i)%n;
		res&=((arr[to]>n) or arr[to]==mn+i);	
	}
  	return res;
}

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

int replacement(int n, int arr[], int ans[]){
  	assert(valid(n,arr));
  	memset(vis,0,sizeof vis);
  	int mn=INF,mx=0,who,am;
  	for(int i=0;i<n;i++){
  		if(umin(mn,arr[i]))
  			who=i;
  		umax(mx,arr[i]);
  	}
  	if(mx<=n)
  		return 0;
  	if(mn>n)who=0,mn=1;
  	who=(who-(mn-1)+n)%n;
  	int last,res=0;
	for(int i=0;i<n;i++){
		int to=(who+i)%n;
		if(arr[to]>n){
			if(arr[to]==mx)
				last=i+1;	
			else
				vis[arr[to]]=i+1;
		}
	}
	for(int i=n+1;i<=mx;i++){
		if(!vis[i])
			ans[res++]=last,last=i;
		else
			ans[res++]=vis[i];
	}
	return res;
}

//----------------------
int mod(ll x){
	return (x%INF);
}
int Fe(int x,int y){
	if(!y)
		return 1;
	int h=Fe(x,y/2);
	h=mod(h*1LL*h);
	if(y&1)h=mod(h*1LL*x);
	return h;	
}
int countReplacement(int n, int arr[]){
	if(!valid(n,arr))return 0;
	sort(arr,arr+n);int ans=1;
	int cnt=0;
	for(int j=0;j<n;j++)cnt+=(arr[j]>n);
	if(arr[0]>n)ans=mod(ans*1LL*Fe(cnt,arr[0]-n-1)),cnt--;
	for(int i=0;i<n-1;i++)
		if(arr[i+1]>n)
			ans=mod(ans*1LL*Fe(cnt--,arr[i+1]-max(n,arr[i])-1));
	return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:48:24: warning: unused variable 'am' [-Wunused-variable]
   48 |    int mn=INF,mx=0,who,am;
      |                        ^~
gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:24:13: warning: 'who' may be used uninitialized in this function [-Wmaybe-uninitialized]
   24 |  int mn=INF,who;
      |             ^~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:70:14: warning: 'last' may be used uninitialized in this function [-Wmaybe-uninitialized]
   70 |    ans[res++]=last,last=i;
      |    ~~~~~~~~~~^~~~~
gondola.cpp:48:20: warning: 'who' may be used uninitialized in this function [-Wmaybe-uninitialized]
   48 |    int mn=INF,mx=0,who,am;
      |                    ^~~

• 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: 0 / 15
• Subtask 10: 0 / 10