답안 #866838

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
866838	2023-10-27T08:34:49 Z	Onur_Ilgaz	곤돌라 (IOI14_gondola)	C++17	75 / 100	40 ms	4956 KB

gondola

#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) ind = i, mn = arr[i];
  }
  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

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	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	1 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	2136 KB	Output is correct
7	Correct	6 ms	604 KB	Output is correct
8	Correct	20 ms	4060 KB	Output is correct
9	Correct	6 ms	1368 KB	Output is correct
10	Correct	24 ms	4672 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	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	0 ms	348 KB	Output is correct
5	Correct	1 ms	504 KB	Output is correct
6	Correct	10 ms	2392 KB	Output is correct
7	Correct	10 ms	572 KB	Output is correct
8	Correct	19 ms	3928 KB	Output is correct
9	Correct	6 ms	1372 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	11 ms	2012 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	29 ms	4700 KB	Output is correct

Subtask #4
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct

Subtask #5
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	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

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	1 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	344 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	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	16 ms	4440 KB	Output is correct
12	Correct	18 ms	4956 KB	Output is correct
13	Correct	20 ms	2904 KB	Output is correct
14	Correct	17 ms	4188 KB	Output is correct
15	Correct	20 ms	2904 KB	Output is correct

Subtask #7
5.0 / 5.0

#	결과	메모리	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct

Subtask #8
15.0 / 15.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	344 KB	Output is correct

Subtask #9
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	1 ms	344 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	39 ms	4148 KB	Output is correct
10	Correct	31 ms	3420 KB	Output is correct
11	Correct	11 ms	1540 KB	Output is correct
12	Correct	14 ms	1836 KB	Output is correct
13	Runtime error	3 ms	1116 KB	Execution killed with signal 11
14	Halted	0 ms	0 KB	-

Subtask #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	0 ms	348 KB	Output is correct
7	Correct	1 ms	344 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	40 ms	4136 KB	Output is correct
10	Correct	30 ms	3672 KB	Output is correct
11	Correct	14 ms	1540 KB	Output is correct
12	Correct	14 ms	1628 KB	Output is correct
13	Runtime error	3 ms	1116 KB	Execution killed with signal 11
14	Halted	0 ms	0 KB	-

답안 #866838

Compilation message