제출 #238355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
238355		lakshith_	곤돌라 (IOI14_gondola)	C++14	15 / 100	18 ms	1152 KiB

gondola

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

bool visited[250000];

int valid(int n,int input[]){
  int start = -1;
  for(int i=0;i<n;i++)if(input[i]<=n){
    start = i;
    break;
  }
  if(start==-1)return 1;
  int prev = input[start];
  if(prev==n)prev =0;
  for(int i=start+1;i<n;i++){
//     cout << input[i] << "\t" << prev << "\n";
    if(input[i]<=n&&input[i]!=prev+1)return 0;
    if(visited[input[i]-1])return 0;
    visited[input[i]-1] = true;
    if(prev+1==n)prev = 0;
    else
    prev++;
  }
  for(int i=0;i<start;i++){
//     cout << input[i] << "\t" << prev << "\n";
    if(input[i]<=n&&input[i]!=prev+1)return 0;
    if(visited[input[i]-1])return 0;
    visited[input[i]-1] = true;
    if(prev+1==n)prev = 0;
    else
    prev++;
  }
  return 1;
}

int replacement(int n, int gondolaSeq[], int replacementSeq[]){
  int MAX = 0;
  for(int i=0;i<n;i++){
    visited[gondolaSeq[i]]=true;
    MAX = max(MAX,gondolaSeq[i]);
  }
  int l = 0;
  for(int i=1;i<MAX;i++)
    if(!visited[i])replacementSeq[l++]=i;
  return l;
}
int countReplacement(int n, int inputSeq[]){
  return 0;
}


// int main(){
//   while(true){
//     int n;
//     cin >> n;
//     int arr[n];
//     int temp[n];
//     for(int i=0;i<n;i++)cin >> arr[i];
//     cout << replacement(n,arr,temp) << "\n";
//   }
// }

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