oj.uz

답안 #152509

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
152509 2019-09-08T08:50:08 Z Nightlight 곤돌라 (IOI14_gondola) C++14
60 / 100
 22 ms 2804 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define MOD 1000000009;
using namespace std;

int exist[250001];

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<int> replaced;

long long int pow( long long int a, long long int x ){
	
	if( x == 0 || a == 1 )
		return 1;
	if( x % 2 )
		return ( pow( a, x - 1 ) * a ) % MOD;
	long long int h = pow( a, x/2 );
	return ( h * h ) % MOD;	
	
}

int countReplacement(int n, int inputSeq[])
{
  int idx = 0;
  replaced.push_back(n);
  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){
        replaced.push_back(inputSeq[i]);
      }else if(inputSeq[i] <= n && inputSeq[i] != idx)
        return 0;
      if(idx)idx++;
    }
  }
  sort(replaced.begin(), 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

gondola.cpp: In function 'int countReplacement(int, int*)':
gondola.cpp:107: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:61:33: warning: 'MAXid' may be used uninitialized in this function [-Wmaybe-uninitialized]
           replacementSeq[i-n-1] = MAXid;
           ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 760 KB Output is correct
7 Correct 15 ms 760 KB Output is correct
8 Correct 11 ms 1016 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1016 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 7 ms 636 KB Output is correct
7 Correct 14 ms 760 KB Output is correct
8 Correct 11 ms 1016 KB Output is correct
9 Correct 5 ms 632 KB Output is correct
10 Correct 13 ms 1144 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 380 KB Output is correct
13 Correct 8 ms 892 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 14 ms 760 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 376 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 252 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 12 ms 760 KB Output is correct
12 Correct 13 ms 764 KB Output is correct
13 Correct 16 ms 1528 KB Output is correct
14 Correct 12 ms 760 KB Output is correct
15 Correct 22 ms 2804 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Incorrect 2 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 404 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Halted 0 ms 0 KB -