Submission #152542

#	Time	Username	Problem	Language	Result	Execution time	Memory
152542		Nightlight	곤돌라 (IOI14_gondola)	C++14	100 / 100	48 ms	6224 KiB

gondola

#include "gondola.h"
#include <bits/stdc++.h>
#define MOD 1000000009;
using namespace std;

int exist[250001];
unordered_set<int> existA;

int valid(int n, int inputSeq[])
{
  int idx = 0;
  for(int i = 0; i < n; i++){
    if(exist[inputSeq[i]] == 1)return 0;
    exist[inputSeq[i]] = 1;
    if(!idx && inputSeq[i] <= n)
      idx = inputSeq[i] + 1;
    else{
      if(idx > n)idx = 1;
      if(inputSeq[i] <= n && inputSeq[i] != idx)
        return 0;
      if(idx)idx++;
    }
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int idx = 0, MAX = 0, MAXid;
  for(int i = 0; i < n; i++){
    if(gondolaSeq[i] <= n){
      idx = gondolaSeq[i] - i;
      if(idx < 1) idx += n;
      break;
    }
  }
  if(!idx)idx = 1;
  for(int i = 0; i < n; i++){
    if(idx > n)idx = 1;
    if(gondolaSeq[i] > MAX){
      MAX = gondolaSeq[i];
      MAXid = idx;
    }
    if(gondolaSeq[i] > n){
      exist[gondolaSeq[i]] = idx;
//      cout << gondolaSeq[i] << " " << exist[gondolaSeq[i]] << "\n";
    }
    idx++;
  }
  if(MAX == n)return 0;
  else{
    int MAXin = 0, last = 0;
    exist[MAX] = 0;
    for(int i = n+1; i <= MAX; i++){
//      cout << i << " " << exist[i] << "\n";
      if(exist[i]){
        replacementSeq[i-n-1] = exist[i];
      }else{
        if(!MAXin){
          replacementSeq[i-n-1] = MAXid;
          MAXin = 1; 
        }else{
          replacementSeq[i-n-1] = last;
        }
        last = i;
      }
    }
  }
  return MAX - n;
}

//----------------------
vector<long long> replaced;

long long int POW( long long int a, long long int x ){
	long long res = 1;
	while(x){
    if(x&1)
      res = res * a % MOD;
    x >>= 1;
    a = a * a % MOD;
  }
  res %= MOD;
  return res;
}

int countReplacement(int n, int inputSeq[])
{
  int idx = 0;
  replaced.push_back(n);
  for(int i = 0; i < n; i++){
    if(existA.count(inputSeq[i]))
      return 0;
    existA.insert(inputSeq[i]);
    if(inputSeq[i] > n)
      replaced.push_back(inputSeq[i]);
    if(!idx && inputSeq[i] <= n){
      idx = inputSeq[i] + 1;
    }else{
      if(idx > n)idx = 1;
      if(inputSeq[i] <= n && inputSeq[i] != idx)
        return 0;
      if(idx)idx++;
    }
  }
  sort(replaced.begin() + 1, replaced.end());
  long long ans = (idx ? 1 : n);
  for(int i = 1; i < replaced.size(); i++){
    ans *= POW(replaced.size() - i,replaced[i] - replaced[i-1] - 1);
    ans %= MOD;
  }
  return ans;
}

Compilation message (stderr)

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:110:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < replaced.size(); i++){
                  ~~^~~~~~~~~~~~~~~~~
gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:62:33: warning: 'MAXid' may be used uninitialized in this function [-Wmaybe-uninitialized]
           replacementSeq[i-n-1] = MAXid;
           ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 10 / 10
• Subtask 6: 20 / 20
• Subtask 7: 5 / 5
• Subtask 8: 15 / 15
• Subtask 9: 15 / 15
• Subtask 10: 10 / 10