Submission #1135682

#	Time	Username	Problem	Language	Result	Execution time	Memory
1135682		Ak_16	Gondola (IOI14_gondola)	C++20	0 / 100	0 ms	328 KiB

gondola

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



int b[300005];

int valid(int n, int a[]){
  int cnt=0;
  int sp;
  for(int i=0; i<n; i++){
    if(a[i]<=n){cnt++; sp = i;}
  }
  if(cnt==0){return 1;}
  
  else {
    
    for(int i=0; i<n; i++){
      a[(n+a[sp]-sp+i-1)%n] = b[i];
    }
    
    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: 0 / 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