제출 #285519

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
285519		ToMmyDong	곤돌라 (IOI14_gondola)	C++11	20 / 100	44 ms	4848 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define first X
#define second Y
#define eb emplace_back
#define ALL(i) i.begin(),i.end()
#define SZ(i) int(i.size())
#ifdef tmd
#define debug(...) fprintf(stderr,"#%d-(%s)=",__LINE__,#__VA_ARGS__);_do(__VA_ARGS__);
template<typename T> void _do (T &&x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y) {cerr<<x<<",";_do(y...);}
#else
#define debug(...)
#endif

#include "gondola.h"

int valid(int n, int inputSeq[])
{
    
    vector<int> sm;
    set<int> val;
    for (int i=0; i<n; i++) {
        if (inputSeq[i] <= n) {
            sm.push_back(inputSeq[i]);
            val.insert(inputSeq[i]);
        }
    }
    if (SZ(val) != n) return 0;
    int st = min_element(ALL(sm)) - sm.begin();
    for (int i=0; i<SZ(sm)-1; i++) {
        if (inputSeq[(st+i)%SZ(sm)] >= inputSeq[(st+i+1)%SZ(sm)]) {
            return 0;
        }
    }

    return 1;
}

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

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

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

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

• 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