Submission #1135740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135740		Ak_16	곤돌라 (IOI14_gondola)	C++20	5 / 100	1094 ms	796 KiB

gondola

#include <iostream>
#include "gondola.h"
using namespace std;



int b[300005];
int cnt[300005];
int cha[300005];

bool cmp(int x, int y){
  return b[x]<b[y];
}

int valid(int n, int a[]){
  int cn=0;
  
  int bruh=0;
  int sp=0;
  for(int i=0; i<n; i++){
    cnt[a[i]]++; if(cnt[a[i]]>1){bruh=1;}
    if(a[i]<=n){cn++; sp = i;}
    
    for(int i=0; i<n; i++){
      b[(2*n+a[sp]-sp+i-1)%n] = a[i];
    }
  }
  
  if(bruh==1){return 0;}
  if(cn==0){return 1;}
  
  else {
    
    
    
    int bru=0;
    
    for(int i=0; i<n; i++){
      if(b[i]<=n&&b[i]!=i+1){bru=1;}
    }
    
    return (1-bru);
  }
}

int replacement(int n, int a[], int c[]){
  return 0;
}

int countReplacement(int n, int a[]){
  return 0;
}

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