제출 #204785

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204785		awlintqaa	곤돌라 (IOI14_gondola)	C++14	0 / 100	6 ms	376 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 n;
int a[100009];
int done[100009];
int valid(int N, int inputSeq[]){
        n=N;
        for(int i=0;i<n;i++)a[i]=inputSeq[i];
        int st=-1,mn=1e9;
        for(int i=0;i<n;i++){
                if(a[i]<=n && a[i]<mn){
                        mn=a[i];
                        st=i;
                }
        }
        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;
          		goal%=n;
        }
        return 1;
}
//----------------------

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

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

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

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