제출 #1088581

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1088581		T0p_	곤돌라 (IOI14_gondola)	C++14	25 / 100	20 ms	2784 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>

using namespace std;

int valid(int n, int inputSeq[]) {
  set<int> st;
  vector<pair<int, int>> v;

  for (int i=0 ; i<n ; i++) {
    if (inputSeq[i] <= n) {
      v.push_back({ inputSeq[i], i });
    }
    else {
      if (st.find(inputSeq[i]) != st.end()) {
        return 0;
      }

      st.insert(inputSeq[i]);
    }
  }

  sort(v.begin(), v.end());
  
  int sz_v = v.size();
  for (int i=0 ; i<sz_v-1 ; i++) {
    if (v[i].first == v[i+1].first) {
      return 0;
    }
    if ((v[i].second + v[i+1].first - v[i].first) % n != v[i+1].second) {
      return 0;
    }
  }

  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[]) {
  int l = 0;

  for (int i=0 ; i<n ; i++) {
    if (gondolaSeq[i] > n) {
      int prv_i = i == 0 ? n-1 : i-1;

      replacementSeq[l++] = gondolaSeq[prv_i] == n ? 1 : gondolaSeq[prv_i] + 1;
    }
  }
  
  return l;
}

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

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

• 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