제출 #705819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
705819		penguin133	곤돌라 (IOI14_gondola)	C++17	45 / 100	1087 ms	1016 KiB

gondola

#include <bits/stdc++.h>
using namespace std;
#include "gondola.h"
//#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int valid(int n, int inputSeq[])
{
  for(int i=1;i<n;i++){
	  if(inputSeq[i] - inputSeq[i-1] != 1 && (inputSeq[i-1] != n || inputSeq[i] != 1))return 0;
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  vector <pi> stuf;
  int rot = 0;
  for(int i=0;i<n;i++){
	  if(gondolaSeq[i] <= n)rot = gondolaSeq[i] - i - 1;
  }
  if(rot < 0)rot += n;
  for(int i=0;i<n;i++){
	  if(gondolaSeq[i] > n){
		  int tmp = i + rot + 1;
		  if(tmp > n)tmp -= n;
		  stuf.push_back({gondolaSeq[i], tmp});
	  }
  }
  sort(stuf.begin(), stuf.end());
  int prv = n;
  int in = 0;
  for(auto [i, j] : stuf){
	  replacementSeq[in++] = j;
	  prv++;
	  for(int x = prv + 1; x <= i; x++)replacementSeq[in++] = x;
	  prv = i;
  }
  return in;
}

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

const int mod = 1e9 + 9;

long long expo(long long a, int b){
	long long ans = 1;
	while(b){
		if(b&1)ans *= a, ans %= mod;
		a *= a, a *= mod;
		b >>= 1;
	}
	return ans;
}

int countReplacement(int n, int inputSeq[])
{
  vector <pi> stuf;
  int rot = -1;
  for(int i=0;i<n;i++){
	  if(inputSeq[i] <= n){
		  int tmp = inputSeq[i] - i - 1;
		  if(tmp < 0)tmp += n;
		  if(rot == -1)rot = tmp;
		  else if(rot != tmp)return 0;
	  }
  }
  long long ans = 1, cur = n + 1;
  while(1){
	  int cnt = 0, cnt2 = 0;
	  for(int i=0;i<n;i++){
		  if(inputSeq[i] == cur){
			  cnt2++;
		  }
		  if(inputSeq[i] > cur)cnt++;
	  }
	  if(cnt2 > 1)return 0;
	  else if(!cnt)break;
	  else if(cnt2 == 1){
		  cur++;
		  continue;
	  }
	  else ans *= cnt, ans %= mod, cur++;
  }
  return ans;
}

• 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: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10