Submission #1344419

#	Time	Username	Problem	Language	Result	Execution time	Memory
1344419		nathlol2	곤돌라 (IOI14_gondola)	C++20	25 / 100	35 ms	4600 KiB

gondola

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

int valid(int n, int a[]){
  int mn = INT_MAX, p;
  set<int> s;
  for(int i = 0;i<n;i++){
    if(s.find(a[i]) != s.end()) return 0;
    s.insert(a[i]);
    if(a[i] < mn){
      mn = a[i];
      p = i;
    }
  }
  if(mn > n) return 1;
  for(int i = 0;i<n;i++){
    int pos = (i + p) % n;
    if(a[pos] <= n && a[pos] != mn + i) return 0;
  }
  return 1;
}

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

int replacement(int n, int a[], int r[]){
  int l = 0, mx = 0;
  set<int> s;
  for(int i = 0;i<n;i++){
    mx = max(mx, a[i]);
    s.insert(a[i]);
  }
  for(int i = 1;i<mx;i++){
    if(s.find(i) == s.end()) r[l++] = i;
  }
  return l;
}

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

int countReplacement(int n, int a[]){
  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