제출 #1321366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1321366		nikaa123	곤돌라 (IOI14_gondola)	C++20	5 / 100	1 ms	336 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;

int valid(int n, int inputSeq[]){
  vector <pair<int,int>> s;
  map <int,int> m;
  for (int i = 0; i < n; i++) {
    m[inputSeq[i]]++;
    if (m[inputSeq[i]] == 2) {return 0;}
    if (inputSeq[i] <= n) {
      s.push_back({inputSeq[i],i+1});
    }
  }
  int cnt = 0;
  for (int i = 1; i < (s).size(); i++) {
    if (s[i].first < s[i-1].first) {
      cnt++;
      if (s[i].first - s[i].second - n != (s[i-1].first - s[i-1].second)) {return 0;}
    } else {
      if (s[i].first - s[i].second != s[i-1].first - s[i-1].second) {return 0;}
    }
  } 
  // cout << cnt << endl;
  return (cnt <= 1);
}



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

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

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

• 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: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10