제출 #340471

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
340471		Kerim	Gondola (IOI14_gondola)	C++17	20 / 100	14 ms	3564 KiB

gondola

#include "gondola.h"
#include "bits/stdc++.h"
#define MAXN 300009
#define INF 1000000007
#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 ok[MAXN],vis[MAXN];
int valid(int n, int arr[]){
	memset(vis,0,sizeof vis);
	memset(ok,0,sizeof ok);
	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;
		}
		else
			ok[i]=1;
		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&=(ok[to] or arr[to]==mn+i);	
	}
  	return res;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

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

int countReplacement(int n, int inputSeq[])
{
  return -3;
}

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:26:13: warning: 'who' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |  int mn=INF,who;
      |             ^~~

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