제출 #239327

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
239327		kshitij_sodani	곤돌라 (IOI14_gondola)	C++17	25 / 100	58 ms	5492 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#include "gondola.h"
int valid(int n,int aa[]){
	vector<int> ind;
	set<int> ss;
	for(int i=0;i<n;i++){
		ss.insert(aa[i]);
	}
	if(ss.size()!=n){
		return 0;
	}
	for(int i=0;i<n;i++){
		if(aa[i]<=n){
			ind.pb(i);
		}
	}
	if(ind.size()<2){
		return 1;
	}
	int st=0;
	int bb[n];
	int co=aa[ind[0]];
	for(int i=ind[0];i<n;i++){
		bb[i]=co;
		co+=1;
		if(co==n+1){
			co=1;
		}
	}
	for(int i=0;i<ind[0];i++){
		bb[i]=co;
		co+=1;
		if(co==n+1){
			co=1;
		}
	}
	for(int i=0;i<n;i++){
		if(bb[i]!=aa[i] and aa[i]<=n){
			return 0;
		}
	}
	return 1;
}
int replacement(int n,int aa[],int bb[]){
	int vis[250001];
	int ma=0;
	for(int i=0;i<n;i++){
		vis[aa[i]]=1;
		ma=max(ma,aa[i]);
	}
	vector<int> ind;

	for(int i=0;i<n;i++){
		if(aa[i]<=n){
			ind.pb(i);
		}
	}
	//if(ind.size()==0){
		int co=0;
		for(int i=1;i<=ma;i++){
			if(vis[i]==0){
				bb[co]=i;
				co+=1;
			}
		}
		/*for(int i=0;i<co;i++){
			cout<<bb[i]<<",";
		}
		cout<<endl;*/
		return co;
/*		return co;
	}*/

}
int countReplacement(int n,int aa[]){

}
/*int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n;
	cin>>n;
	int it[n];
	for(int i=0;i<n;i++){
		cin>>it[i];
	}
	int ac[25000];
	cout<<replacement(n,it,ac)<<endl;



	return 0;
}*/

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(ss.size()!=n){
     ~~~~~~~~~^~~
gondola.cpp:26:6: warning: unused variable 'st' [-Wunused-variable]
  int st=0;
      ^~
gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:83:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 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