제출 #204796

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204796		awlintqaa	곤돌라 (IOI14_gondola)	C++14	55 / 100	30 ms	2676 KiB

gondola

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "gondola.h"
int z=0;
int done[100009];
int valid(int N, int a[]){
        int n=N;
        int st=-1,mn=1e9;vi ret;
        for(int i=0;i<n;i++){
                if(a[i]<=n && a[i]<mn){
                        mn=a[i];
                        st=i;
                }
                else if(a[i]>n)ret.pb(a[i]);
        }
        sort(ret.begin(),ret.end());
  		if(!z){
        	for(int i=1;i<ret.size();i++){
        	        if(ret[i]!=ret[i-1]+1)return 0;
        	}
        }
        if(st==-1)return 1;
        int goal=a[st];
        while(!done[st]){
                if(a[st]<=n && a[st]!=goal)return 0;
                done[st]=1;
                st++;
                goal++;
                st%=n;
                if(goal>n)goal=1;
        }
        return 1;
}

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

int replacement(int n, int a[], int replacementSeq[]){
  		z=1;
        if(!valid(n,a))while(1){}
        int st=0,mn=1e9;
        for(int i=0;i<n;i++){
                if(a[i]<=n && mn>a[i])mn=a[i],st=i;
        }mem(done,0);
        int goal=1;if(a[st]<=n)goal=a[st];
        vpi ret;vi ans;
        while(!done[st]){
                if(a[st]>n)ret.pb({a[st],goal});
                done[st]=1;
                st++,goal++;
                st%=n;if(goal>n)goal=1;
        }sort(ret.begin(),ret.end());
        int last=n;
        for(auto u:ret){
                while(u.se!=u.fi){
                        ans.pb(u.se);
                        if(u.se<=n)u.se=last+1;
                        else u.se++;
                }
                last=u.fi;
        }
        for(int i=0;i<ans.size();i++)replacementSeq[i]=ans[i];
        return (int)ans.size();
}
//----------------------

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

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

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:44:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          for(int i=1;i<ret.size();i++){
                      ~^~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:87:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0;i<ans.size();i++)replacementSeq[i]=ans[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: 0 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10