oj.uz

Submission #866842

# Submission time Handle Problem Language Result Execution time Memory
866842 2023-10-27T08:39:51 Z Onur_Ilgaz Gondola (IOI14_gondola) C++17
75 / 100
 40 ms 4956 KB 
#include "gondola.h"
#include <bits/stdc++.h>
#define inf INT_MAX
#define ll long long
using namespace std;

int valid(int n, int arr[])
{
  int ind = 0, mn = inf;
  set <int> st;
  for(int i = 0; i < n; i++) {
    if(arr[i] < mn) ind = i, mn = arr[i];
    if(st.count(arr[i])) return 0;
    st.insert(arr[i]);
  }
  int now = mn + 1;
  // cout<<ind<<" "<<now<<" ";
  for(int i = (ind + 1) % n; i % n != ind; i = (i + 1) % n, now++) {
    if(arr[i] <= n and arr[i] != now) {
        return 0;
    }
  }
  return 1;
}

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

int replacement(int n, int arr[], int ans[])
{
  map <int, int> mp;
  int mxi = 0, mx = 0;
  int shift = 0;
  for(int i = 0; i < n; i++) {
    mp[arr[i]] = i;
    if(arr[i] > mx) mxi = i, mx = arr[i];
    if(arr[i] <= n) {
      shift = (arr[i] - i - 1) % n;
    }
  }
  int l = mx;
  mxi = (mxi + shift + n) % n + 1;
  for(int i = n + 1; i <= l; i++) {
    int val;
    if(mp.count(i)) {
      if(i == mx) val = mxi;
      else val = (mp[i] + shift + n) % n + 1;
    }
    else {
      val = mxi;
      mxi = i;
    }
    // cout<<val<<" "<<shift<<"\n";
    ans[i - (n + 1)] = val;
  }
  return l - n;
}

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

const int mod = 1000000009;

void duzelt(int n, int arr[]) {
  vector <int> brr(n);
  int ind = 0, mn = inf;
  for(int i = 0; i < n; i++) {
    if(arr[i] < mn and arr[i] <= n) ind = i, mn = arr[i];
  }
  if(mn == inf) mn = 1;
  ind = (ind - (mn - 1) + n) % n;
  int to = 0, i;
  for(i = (ind + 1) % n; i != ind; i = (i + 1) % n, to++) {
    brr[to] = arr[(i - 1 + n) % n];
  }
  brr[to] = arr[(i - 1 + n) % n];
  for(int i = 0; i < n; i++) arr[i] = brr[i];
}

int binpow(ll x, ll y) {
  ll ret = 1;
  while(y) {
    if(y & 1) {
       ret *= x;
       ret %= mod;
    }
    x *= x;
    x %= mod;
    y /= 2;
  }
  return ret;
}

int countReplacement(int n, int arr[])
{
    if(!valid(n, arr)) return 0;
    duzelt(n, arr);
    set <int> st;
    for(int i = 0; i < n; i++) {
      if(arr[i] > n) st.insert(arr[i]);
    }
    ll prev = n, len = st.size();
    ll ret = 1;
    for(auto till:st) {
      ll diff = till - prev - 1;
      ret *= binpow(len, diff);
      ret %= mod;
      prev = till;
      len--;
    }
    return ret;
}

Subtask #1
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 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 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 10 ms 2136 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 20 ms 3932 KB Output is correct
9 Correct 6 ms 1372 KB Output is correct
10 Correct 24 ms 4444 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 10 ms 2140 KB Output is correct
7 Correct 6 ms 580 KB Output is correct
8 Correct 19 ms 3840 KB Output is correct
9 Correct 6 ms 1624 KB Output is correct
10 Correct 24 ms 4444 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 12 ms 2140 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 32 ms 4776 KB Output is correct

Subtask #4
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 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #5
10.0 / 10.0

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

Subtask #6
20.0 / 20.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 0 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 17 ms 4340 KB Output is correct
12 Correct 20 ms 4956 KB Output is correct
13 Correct 20 ms 2908 KB Output is correct
14 Correct 18 ms 4188 KB Output is correct
15 Correct 23 ms 3028 KB Output is correct

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 0 ms 348 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 344 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

Subtask #9
0 / 15.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 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 40 ms 3932 KB Output is correct
10 Correct 33 ms 3416 KB Output is correct
11 Correct 12 ms 1540 KB Output is correct
12 Correct 16 ms 1828 KB Output is correct
13 Incorrect 4 ms 600 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 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 0 ms 348 KB Output is correct
9 Correct 40 ms 3932 KB Output is correct
10 Correct 33 ms 3372 KB Output is correct
11 Correct 13 ms 1796 KB Output is correct
12 Correct 14 ms 1716 KB Output is correct
13 Incorrect 3 ms 604 KB Output isn't correct
14 Halted 0 ms 0 KB -