oj.uz

답안 #1019321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019321 2024-07-10T17:20:20 Z presko 곤돌라 (IOI14_gondola) C++14
90 / 100
 13 ms 2588 KB 
#include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include "gondola.h"
#define MAXN 300010
#define MOD 1000000009
using namespace std;
bool used[MAXN];
int valid(int n, int inputSeq[])
{
    for(long long i=0;i<n;i++)
    {
        if(used[inputSeq[i]])return 0;
        used[inputSeq[i]]=1;
        if(inputSeq[i]<=n)
        {
            long long prev=i-1,valp=inputSeq[i]-1;
            if(prev<0)prev=n-1;
            if(valp<1)valp=n;

            long long next=i+1,valn=inputSeq[i]+1;
            if(next>=n)next=0;
            if(valn>n)valn=1;

            if(inputSeq[prev]<=n && inputSeq[prev]!=valp)return 0;
            if(inputSeq[next]<=n && inputSeq[next]!=valn)return 0;
        }
    }
    return 1;
}

//----------------------
vector<pair<long long,long long>> order;
int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  order.clear();
  long long ans=0,pos=-1;
  for(long long i=0;i<n;i++)if(gondolaSeq[i]<=n){pos=i;break;}

  if(pos==-1)for(long long i=0;i<n;i++)order.push_back({gondolaSeq[i],i+1});
  else
  {
      long long curr=gondolaSeq[pos];
      for(long long i=pos-1;i>=0;i--)
      {
          curr--;
          if(curr==0)curr=n;
          if(gondolaSeq[i]>n)order.push_back({gondolaSeq[i],curr});
          gondolaSeq[i]=curr;
      }
      for(long long i=n-1;i>pos;i--)
      {
          curr--;
          if(curr==0)curr=n;
          if(gondolaSeq[i]>n)order.push_back({gondolaSeq[i],curr});
          gondolaSeq[i]=curr;
      }
  }
  sort(order.begin(),order.end());
  long long last=n;
  for(long long i=0;i<(long long)order.size();i++)
  {
      long long ind=order[i].first;
      long long frst=order[i].second;
      replacementSeq[ans++]=frst;
      for(long long j=last+2;j<=ind;j++)
      {
          replacementSeq[ans++]=j-1;
      }
      last=ind;
  }
  return ans;
}

//----------------------
long long power(long long x, long long n)
{
    if(n==0)return 1;
    if(n==1)return x;
    long long half=power(x,n/2);
    long long ne=(half*half)%MOD;
    if(n&1){ne*=x;ne%=MOD;}
    return ne%MOD;
}
int countReplacement(int n, int inputSeq[])
{
    order.clear();
    if(!valid(n,inputSeq))return 0;

    long long pos=-1;
    for(long long i=0;i<n;i++)if(inputSeq[i]<=n){pos=i;break;}

    if(pos==-1)for(long long i=0;i<n;i++)order.push_back({inputSeq[i],i+1});
    else
    {
        long long curr=inputSeq[pos];
        for(long long i=pos-1;i>=0;i--)
        {
            curr--;
            if(curr==0)curr=n;
            if(inputSeq[i]>n)order.push_back({inputSeq[i],curr});
            inputSeq[i]=curr;
        }
        for(long long i=n-1;i>pos;i--)
        {
            curr--;
            if(curr==0)curr=n;
            if(inputSeq[i]>n)order.push_back({inputSeq[i],curr});
            inputSeq[i]=curr;
        }
    }
    if(order.size()==0)return 1;
    sort(order.begin(),order.end());

    long long ans=1;
    if(pos==-1)ans=n;
    long long last=n;
    for(long long i=0;i<(long long)order.size();i++)
    {
        long long ind=order[i].first;
        long long use=power(order.size()-i,ind-last-1)%MOD;
        ans*=use;
        ans%=MOD;
        last=ind;
    }
    return (int)ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 6 ms 620 KB Output is correct
8 Correct 5 ms 728 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 6 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 7 ms 704 KB Output is correct

Subtask #4
5.0 / 5.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 5 ms 604 KB Output is correct
12 Correct 6 ms 604 KB Output is correct
13 Correct 9 ms 1748 KB Output is correct
14 Correct 5 ms 856 KB Output is correct
15 Correct 13 ms 2588 KB Output is correct

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

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

Subtask #9
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 11 ms 2004 KB Output is correct
10 Correct 10 ms 1748 KB Output is correct
11 Correct 6 ms 1240 KB Output is correct
12 Correct 5 ms 1240 KB Output is correct
13 Correct 2 ms 604 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 10 ms 1908 KB Output is correct
10 Correct 8 ms 1748 KB Output is correct
11 Correct 4 ms 1240 KB Output is correct
12 Correct 4 ms 1240 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Runtime error 8 ms 1116 KB Execution killed with signal 11
15 Halted 0 ms 0 KB -