oj.uz

답안 #204657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204657 2020-02-26T13:10:33 Z a_player 곤돌라 (IOI14_gondola) C++14
100 / 100
 79 ms 5096 KB 
#include <bits/stdc++.h>
#include "gondola.h"
#define f first
#define s second
#define mp make_pair
#define rep replacementSeq
#define MOD 1000000009

using namespace std;

typedef long long ll;
const int MAXN = 1e6+5;

map<int,int> v;

int valid(int n, int inputSeq[])
{
    for(int i=0;i<n;i++){
        if(v[inputSeq[i]])return 0;
        v[inputSeq[i]]=1;
    }
    int mini=min_element(inputSeq,inputSeq+n)-inputSeq;
    int ans=1;
    if(inputSeq[mini]>n)return 1;
    int i=(mini-inputSeq[mini]+1+n)%n;
    for(int j=0;j<n-1;j++){
        if(inputSeq[(i+j)%n]>n||inputSeq[(i+j+1)%n]>n)continue;
        ans*=(inputSeq[(i+j)%n]+1==inputSeq[(i+j+1)%n]);
    }
    
    return ans;
}

//----------------------
vector<pair<int,int> > a;
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int ind=-1;
  for(int i=0;i<n;i++)if(gondolaSeq[i]<=n)ind=i;
  if(ind==-1){
    for(int j=0;j<n;j++)a.push_back(mp(gondolaSeq[j],j+1));
  }else{
  ind=(ind-gondolaSeq[ind]+1+n)%n;
  for(int j=0;j<n;j++)a.push_back(mp(gondolaSeq[(ind+j)%n],j+1));
  }
  sort(a.begin(),a.end());
  int id=0;
  int k=n;
  for(pair<int,int> x:a){
    if(x.f==x.s)continue;
      rep[id++]=x.s;
      for(k+=1;k<x.f;k++)rep[id++]=k;
  }
  return id;
}

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

ll pot(int n, int a){
  if(n==0)return 1;
  ll h=pot(n/2,a)%MOD;
  h=(h*h)%MOD;
  if(n%2)h=(h*(ll)a)%MOD;
  return h;
}

int countReplacement(int n, int inputSeq[])
{
  if(!valid(n,inputSeq))return 0;
  ll ans=1;
  sort(inputSeq,inputSeq+n);
  if(inputSeq[0]>n)ans=n;
  int k=n;
  for(int i=0;i<n;i++){
      if(inputSeq[i]<=k)continue;
      ans=(ans*pot(inputSeq[i]-k-1,n-i))%MOD;
      k=inputSeq[i];
  }
  return ans%MOD;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 20 ms 2168 KB Output is correct
7 Correct 19 ms 632 KB Output is correct
8 Correct 34 ms 4216 KB Output is correct
9 Correct 14 ms 1528 KB Output is correct
10 Correct 41 ms 4600 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 20 ms 2168 KB Output is correct
7 Correct 18 ms 760 KB Output is correct
8 Correct 34 ms 3960 KB Output is correct
9 Correct 14 ms 1528 KB Output is correct
10 Correct 41 ms 4600 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 25 ms 2172 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 55 ms 4856 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 20 ms 1904 KB Output is correct
12 Correct 21 ms 1904 KB Output is correct
13 Correct 21 ms 1520 KB Output is correct
14 Correct 19 ms 1776 KB Output is correct
15 Correct 28 ms 2420 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 57 ms 4216 KB Output is correct
10 Correct 44 ms 3448 KB Output is correct
11 Correct 18 ms 1400 KB Output is correct
12 Correct 22 ms 1656 KB Output is correct
13 Correct 8 ms 632 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 256 KB Output is correct
9 Correct 57 ms 4088 KB Output is correct
10 Correct 46 ms 3448 KB Output is correct
11 Correct 19 ms 1400 KB Output is correct
12 Correct 22 ms 1656 KB Output is correct
13 Correct 9 ms 632 KB Output is correct
14 Correct 68 ms 4600 KB Output is correct
15 Correct 79 ms 5096 KB Output is correct
16 Correct 16 ms 1144 KB Output is correct
17 Correct 50 ms 3576 KB Output is correct
18 Correct 30 ms 2168 KB Output is correct