oj.uz

답안 #995414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
995414 2024-06-09T03:54:47 Z thinknoexit 곤돌라 (IOI14_gondola) C++17
55 / 100
 13 ms 2388 KB 
#include "gondola.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 9;
bool ch[250500];
int p[100100];
int valid(int n, int a[]) {
    int mn = n + 1;
    int idx = 0;
    for (int i = 0;i < n;i++) {
        if (ch[a[i]]) return 0;
        ch[a[i]] = 1;
        if (a[i] <= n) {
            if (a[i] < mn) {
                mn = a[i];
                idx = i;
            }
        }
    }
    if (mn == n + 1) return 1;
    idx = (idx - mn + 1 + n) % n;
    for (int i = 0;i < n;i++) {
        if (a[(i + idx) % n] <= n && a[(i + idx) % n] != i + 1) return 0;
    }
    return 1;
}

int replacement(int n, int a[], int replacementSeq[]) {
    int mn = n + 1;
    int idx = 0;
    vector<pair<int, int>> v;
    for (int i = 0;i < n;i++) {
        if (a[i] <= n) {
            if (a[i] < mn) {
                mn = a[i];
                idx = i;
            }
        }
        else v.push_back({ a[i], i });
    }
    idx = (idx - mn + 1 + n) % n;
    for (int i = 0;i < n;i++) {
        p[(i + idx) % n] = i + 1;
    }
    int sz = 0, now = n;
    sort(v.begin(), v.end());
    for (auto& x : v) {
        while (p[x.second] != x.first) {
            replacementSeq[sz++] = p[x.second];
            p[x.second] = ++now;
        }
    }
    return sz;
}

int countReplacement(int n, int a[]) {
    if (!valid(n, a)) return 0;
    memset(ch, 0, sizeof ch);
    int cnt = 0;
    for (int i = 0;i < n;i++) {
        if (a[i] > n) cnt++;
    }
    ll ans = 1;
    for (int i = n + 1;i <= 250000;i++) {
        if (cnt == 0) break;
        if (!ch[i]) {
            ans = (ans * cnt) % MOD;
        }
        else cnt--;
    }
    return ans;
}

Subtask #1
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 1 ms 448 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 1 ms 604 KB Output is correct
6 Correct 3 ms 604 KB Output is correct
7 Correct 6 ms 1372 KB Output is correct
8 Correct 5 ms 1144 KB Output is correct
9 Correct 2 ms 600 KB Output is correct
10 Correct 6 ms 1116 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 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 1 ms 344 KB Output is correct
6 Correct 3 ms 696 KB Output is correct
7 Correct 6 ms 1372 KB Output is correct
8 Correct 5 ms 1112 KB Output is correct
9 Correct 3 ms 604 KB Output is correct
10 Correct 9 ms 1148 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 5 ms 972 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 7 ms 1388 KB Output is correct

Subtask #4
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 344 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 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 344 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 444 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 444 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 0 ms 440 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 6 ms 1372 KB Output is correct
12 Correct 7 ms 1628 KB Output is correct
13 Correct 9 ms 1516 KB Output is correct
14 Correct 6 ms 1368 KB Output is correct
15 Correct 13 ms 2388 KB Output is correct

Subtask #7
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 604 KB Output isn't correct
2 Halted 0 ms 0 KB -