oj.uz

Submission #932748

# Submission time Handle Problem Language Result Execution time Memory
932748 2024-02-24T06:13:59 Z vjudge1 Gondola (IOI14_gondola) C++17
55 / 100
 1000 ms 3820 KB 
#include<bits/stdc++.h>
 
#pragma GCC optimize("Ofast")
 
using namespace std;
 
#define F first
#define S second
#define ll long long
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back
#define ull unsigned ll
 
const int MAX=3e6+55;
const int inf=1e9;
const int N=2e5;
const int C=331;
const int C1=431;
const int mod=1e9+9;
const int mod1=1e9+9;
#include "gondola.h"

int pos[MAX];

int valid(int n, int a[])
{
  int mn=0;
  for(int i=0;i<n;i++){
    if(a[i]<a[mn])mn=i;
    // pos[a[i]]=i;
  }
  vector<int> v;
  for(int i=mn;i<n;i++){
    if(a[i]<=n){
      v.pb(a[i]);
      pos[a[i]]=i-mn;
    }
  }
  for(int i=0;i<mn;i++){
    if(a[i]<=n){
      v.pb(a[i]);
      pos[a[i]]=n-mn+i;
    }
  }
  for(int i=1;i<sz(v);i++){
    if(v[i]<=v[i-1]||v[i]-v[i-1]!=pos[v[i]]-pos[v[i-1]])return 0;
  }
  sort(a,a+n);
  for(int i=1;i<n;i++){
    if(a[i]==a[i-1])return 0;
  }
  return 1;
}


int replacement(int n, int gondolaSeq[], int replacementSeq[])
{
  return -2;
}

//----------------------
int countReplacement(int n, int a[])
{
  ll ans=1;
  if(!valid(n,a))return 0;
  vector<int> v;
  for(int i=0;i<n;i++){
    if(a[i]>n){
      v.pb(a[i]);
    }
  }
  sort(all(v));
  int r=n+1;
  for(int i=0;i<sz(v);i++){
    while(r<v[i]){
      ans=ans*1ll*(sz(v)-i)%mod;
      r++;
    }
    r++;
  }
  if(sz(v)==n)ans=ans*1ll*n%mod;
  return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 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

# Verdict Execution time Memory 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 5 ms 972 KB Output is correct
7 Correct 6 ms 3540 KB Output is correct
8 Correct 7 ms 3544 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 12 ms 3544 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory 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 5 ms 1116 KB Output is correct
7 Correct 7 ms 3544 KB Output is correct
8 Correct 8 ms 3544 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 12 ms 3544 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 604 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 7 ms 3276 KB Output is correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Integer -2 violates the range [0, 350000]
2 Halted 0 ms 0 KB -

Subtask #7
5.0 / 5.0

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

Subtask #8
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 376 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 344 KB Output is correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 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 3820 KB Output is correct
10 Correct 9 ms 3604 KB Output is correct
11 Correct 4 ms 860 KB Output is correct
12 Correct 5 ms 844 KB Output is correct
13 Correct 2 ms 348 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory 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 436 KB Output is correct
6 Correct 0 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 3288 KB Output is correct
10 Correct 9 ms 3220 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 5 ms 856 KB Output is correct
13 Correct 2 ms 348 KB Output is correct
14 Execution timed out 1016 ms 2212 KB Time limit exceeded
15 Halted 0 ms 0 KB -