oj.uz

답안 #891547

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891547 2023-12-23T08:16:53 Z AkibAzmain 곤돌라 (IOI14_gondola) C++17
90 / 100
 1000 ms 2580 KB 
#include <bits/stdc++.h>
#include "gondola.h"
using namespace std;
using ll = long long;

int valid(int n, int a[])
{
  bool y = true;
  for (int i = 1; y && i < n; ++i) y = (a[i] - a[i - 1] + n) % n == 1;
  return y;
}

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

int replacement(int n, int a[], int ans[])
{
  int org = -1;
  for (int i = 0; i < n; ++i)
    if (a[i] <= n)
      {
        int norg = (i - a[i] + 1 + n) % n;
        assert (org == -1 || org == norg);
        org = norg;
      }
  if (org == -1) org = 0;
  vector < pair < int, int > > v;
  for (int i = 0; i < n; ++i) if (a[i] > n) v.push_back ({ a[i], (i - org + n) % n + 1 });
  sort (v.begin (), v.end ());
  int i = 0;
  for (auto &x : v)
    {
      while (x.first != x.second)
        {
          ans[i] = x.second;
          x.second = i + n + 1;
          ++i;
        }
    }
  return i;
}

//----------------------
int countReplacement(int n, int a[])
{
  int org = -1;
  for (int i = 0; i < n; ++i)
    if (a[i] <= n)
      {
        int norg = (i - a[i] + 1 + n) % n;
        if (org != -1 && org != norg) return 0;
        org = norg;
      }
  bool ind = false;
  if (org == -1) org = 0, ind = true;
  vector < ll > v;
  for (int i = 0; i < n; ++i) if (a[i] > n) v.push_back (a[i]);
  sort (v.begin (), v.end ());
  ll vs = v.size (), ans = 1, p = n, MOD = 1000000009;
  for (auto &x : v)
    {
      ll m = 1;
      for (int i = 0; i < x - p - 1; ++i) (m *= vs) %= MOD;
      (ans *= m) %= MOD;
      --vs;
      p = x;
    }
  if (ind) (ans *= n) %= MOD;
  return ans;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 344 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 3 ms 348 KB Output is correct
7 Correct 6 ms 764 KB Output is correct
8 Correct 6 ms 860 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 1 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 1 ms 600 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 6 ms 604 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 2 ms 344 KB Output is correct
10 Correct 8 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 6 ms 604 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 0 ms 348 KB Output is correct
5 Correct 0 ms 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 0 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 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 6 ms 604 KB Output is correct
12 Correct 7 ms 604 KB Output is correct
13 Correct 10 ms 1256 KB Output is correct
14 Correct 6 ms 604 KB Output is correct
15 Correct 15 ms 2388 KB Output is correct

Subtask #7
5.0 / 5.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

Subtask #8
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 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 344 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 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 10 ms 1240 KB Output is correct
10 Correct 8 ms 1240 KB Output is correct
11 Correct 4 ms 1112 KB Output is correct
12 Correct 4 ms 860 KB Output is correct
13 Correct 2 ms 344 KB Output is correct

Subtask #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 344 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 352 KB Output is correct
9 Correct 10 ms 1240 KB Output is correct
10 Correct 8 ms 1212 KB Output is correct
11 Correct 4 ms 868 KB Output is correct
12 Correct 4 ms 864 KB Output is correct
13 Correct 2 ms 608 KB Output is correct
14 Execution timed out 1091 ms 2580 KB Time limit exceeded
15 Halted 0 ms 0 KB -