Submission #722589

#	Time	Username	Problem	Language	Result	Execution time	Memory
722589		Yell0	Gondola (IOI14_gondola)	C++17	20 / 100	12 ms	1500 KiB

gondola

#include <bits/stdc++.h>
#include "gondola.h"

using namespace std;
const int MOD=1e9+9;
 
int valid(int n,int inputSeq[]) {
  int st=-1;
  vector<int> ogIdx(n+2);
  set<int> usedNew;
  for(int i=0;i<n;++i) {
    if(st<0&&inputSeq[i]<=n) {
      st=i;
      ogIdx[inputSeq[i]]=i;
      for(int j=1;j<n;++j) ogIdx[(inputSeq[i]-1+j)%n+1]=j;
    } else if(inputSeq[i]<=n) {
      if(ogIdx[inputSeq[i]]!=i) return 0;
    } else {
      if(usedNew.count(inputSeq[i])) return 0;
      usedNew.insert(inputSeq[i]);
    }
  }
  return 1;
}
 
int replacement(int n,int gondolaSeq[],int replacementSeq[]) {return 0;}
int countReplacement(int n,int inputSeq[]) {return 0;}

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