oj.uz

답안 #960164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
960164 2024-04-09T19:04:47 Z Nelt 곤돌라 (IOI14_gondola) C++17
75 / 100
 34 ms 6572 KB 
#include "gondola.h"
#include <bits/stdc++.h>

#define ll long long
#define endl "\n"

using namespace std;
const ll mod = 1e9 + 9;

int valid(int n, int a[])
{
    set<ll> s;
    for (ll i = 0; i < n; i++)
        s.insert(a[i]);
    if (s.size() != n)
        return 0;
    ll st = -1, b[n];
    for (ll i = 0; i < n; i++)
        if (a[i] <= n)
            st = i;
    if (st == -1)
        return 1;
    b[st] = a[st];
    for (ll i = st + 1; i < st + n; i++)
        b[i % n] = b[(i - 1 + n) % n] % n + 1;
    // for (ll i = 0; i < n; i++)
    //     cout << b[i] << " ";
    // cout << endl;
    for (ll i = 0; i < n; i++)
        if (a[i] <= n and a[i] != b[i])
            return 0;
    return 1;
}

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

int replacement(int n, int a[], int replacementSeq[])
{
    ll st = -1, b[n];
    for (ll i = 0; i < n; i++)
        if (a[i] <= n)
            st = i;
    if (st == -1)
        iota(b, b + n, 1);
    else
    {
        b[st] = a[st];
        for (ll i = st + 1; i < st + n; i++)
            b[i % n] = b[(i - 1 + n) % n] % n + 1;
    }
    ll ptr = 0, mx = max_element(a, a + n) - a;
    ll ind[a[mx] + 1];
    for (ll i = 0; i <= a[mx]; i++)
        ind[i] = -1;
    for (ll i = 0; i < n; i++)
        ind[a[i]] = i;
    for (ll i = n + 1; i <= a[mx]; i++)
        if (ind[i] != -1)
            replacementSeq[ptr++] = b[ind[i]], b[ind[i]] = i;
        else
            replacementSeq[ptr++] = b[mx], b[mx] = i;
    return ptr;
}

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

int countReplacement(int n, int a[])
{
    if (!valid(n, a))
        return 0;
    ll ans = 1, mx = max_element(a, a + n) - a;
    ll ind[a[mx] + 1];
    for (ll i = 0; i <= a[mx]; i++)
        ind[i] = -1;
    for (ll i = 0; i < n; i++)
        ind[a[i]] = i;
    ll b[n];
    for (ll i = 0; i < n; i++)
        b[i] = a[i];
    sort(b, b + n);
    for (ll i = n + 1; i <= a[mx]; i++)
        if (ind[i] == -1)
            ans = ans * (n - (lower_bound(b, b + n, i) - b)) % mod;
    return ans;
}

Compilation message

gondola.cpp: In function 'int valid(int, int*)':
gondola.cpp:15:18: warning: comparison of integer expressions of different signedness: 'std::set<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |     if (s.size() != n)
      |         ~~~~~~~~~^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 444 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 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 440 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 19 ms 4152 KB Output is correct
8 Correct 16 ms 5044 KB Output is correct
9 Correct 5 ms 1884 KB Output is correct
10 Correct 19 ms 5580 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 444 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 344 KB Output is correct
6 Correct 8 ms 2652 KB Output is correct
7 Correct 19 ms 4196 KB Output is correct
8 Correct 15 ms 5044 KB Output is correct
9 Correct 5 ms 1880 KB Output is correct
10 Correct 22 ms 5776 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 10 ms 2648 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 25 ms 5856 KB Output is correct

Subtask #4
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 548 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

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 356 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

Subtask #6
20.0 / 20.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 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 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 ms 2356 KB Output is correct
12 Correct 8 ms 2652 KB Output is correct
13 Correct 11 ms 2396 KB Output is correct
14 Correct 7 ms 2392 KB Output is correct
15 Correct 15 ms 3932 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 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 344 KB Output is correct
3 Correct 0 ms 444 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 440 KB Output is correct
2 Correct 1 ms 600 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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 34 ms 6572 KB Output is correct
10 Correct 23 ms 5208 KB Output is correct
11 Correct 11 ms 3420 KB Output is correct
12 Correct 12 ms 3164 KB Output is correct
13 Incorrect 6 ms 2396 KB Output isn't correct
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 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 29 ms 6448 KB Output is correct
10 Correct 23 ms 5388 KB Output is correct
11 Correct 12 ms 3672 KB Output is correct
12 Correct 12 ms 3096 KB Output is correct
13 Incorrect 5 ms 2392 KB Output isn't correct
14 Halted 0 ms 0 KB -