oj.uz

Submission #746158

# Submission time Handle Problem Language Result Execution time Memory
746158 2023-05-21T14:18:17 Z Username4132 Gondola (IOI14_gondola) C++14
60 / 100
 16 ms 2892 KB 
#include "gondola.h"
#include<algorithm>
#include<iostream>
#include<map>
using namespace std;
using ll = long long;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define forsn(i, s, n) for(int i=s; i<(int)n; ++i)

const int MAXN=250010, MOD=1000000009;
int arr[MAXN], pos[MAXN], cp[100010];

int valid(int n, int inputSeq[])
{

  forn(i, n) cp[i]=inputSeq[i];
  sort(cp, cp+n);
  forn(i, n-1) if(cp[i]==cp[i+1]) return 0;

  auto itr=min_element(inputSeq, inputSeq+n);
  if(*itr>=n) return 1;
  auto tmp=itr, last=itr;
  while(true){
    if(*tmp<=n){
      int d1=*tmp-*last, d2=tmp-last;
      if(d2<0) d2+=n;
      if(d1!=d2) return 0;
      last=tmp;
    }
    tmp++;
    if(tmp==inputSeq+n) tmp=inputSeq;
    if(tmp==itr) break;
  }
  return 1;
}

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

int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  int offset=0;
  forn(i, n) if(gondolaSeq[i]<=n) offset=i-gondolaSeq[i]+1;
  if(offset<0) offset+=n;
  int cur=offset, num=1;
  while(true){
    arr[cur++]=num++;
    if(cur>=n) cur-=n;
    if(cur==offset) break;
  }

  int mx=max_element(gondolaSeq, gondolaSeq+n)-gondolaSeq;
  forn(i, gondolaSeq[mx] + 1) pos[i]=-1;
  forn(i, n) pos[gondolaSeq[i]]=i;

  int ans=0;
  forsn(i, n+1, gondolaSeq[mx] + 1){
    int p=pos[i];
    if(p==-1) p=mx;
    replacementSeq[ans++]=arr[p];
    arr[p]=i;
  }

  return ans;
}

//----------------------
ll ex(ll b, ll e){
  ll ret=1;
  while(e>0){
    if(e&1) ret = (ret*b)%MOD;
    b = (b*b)%MOD;
    e>>=1;
  }
  return ret;
}

int countReplacement(int n, int inputSeq[])
{
  if(!valid(n, inputSeq)) return 0;
  ll ans=1;
  int pr=n;
  forn(i, n) if(cp[i]>n) ans=(ans*ex(n-i, cp[i]-pr-1))%MOD;
  if(cp[0]>n) ans=(ans*n)%MOD;
  return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 6 ms 524 KB Output is correct
7 Correct 12 ms 980 KB Output is correct
8 Correct 8 ms 852 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 13 ms 852 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 12 ms 976 KB Output is correct
8 Correct 10 ms 772 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 13 ms 852 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 5 ms 484 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 12 ms 860 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 8 ms 1264 KB Output is correct
12 Correct 11 ms 1404 KB Output is correct
13 Correct 11 ms 1620 KB Output is correct
14 Correct 7 ms 1236 KB Output is correct
15 Correct 16 ms 2892 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 212 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 1 ms 312 KB Output isn't correct
6 Halted 0 ms 0 KB -