제출 #1344412

#제출 시각아이디문제언어결과실행 시간메모리
1344412nathlol2곤돌라 (IOI14_gondola)C++20
20 / 100
30 ms4672 KiB
#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 gondolaSeq[], int replacementSeq[]){
  return -2;
}

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

int countReplacement(int n, int a[]){
  return -3;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...