oj.uz

Submission #826806

# Submission time Handle Problem Language Result Execution time Memory
826806 2023-08-16T04:29:35 Z t6twotwo Festivals in JOI Kingdom 2 (JOI23_festival2) C++17
5 / 100
 9000 ms 324 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N, P;
    cin >> N >> P;
    vector<int> a(2 * N);
    iota(a.begin(), a.end(), 1);
    int ans = 0;
    do {
        bool ok = 1;
        for (int i = 0; i < N; i++) {
            if (a[i] > a[N + i]) {
                ok = 0;
            }
            if (i && a[i - 1] > a[i]) {
                ok = 0;
            }
        }
        if (!ok) {
            continue;
        }
        int s = 0, f = 0;
        for (int i = 0; i < N; i++) {
            if (a[i] > f) {
                s++;
                f = max(f, a[i + N]);
            }
        }
        int t = 0; f = 0;
        vector<int> ord(N);
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](int i, int j) {
            return a[N + i] < a[N + j];
        });
        for (int i = 0; i < N; i++) {
            if (i == 0 || a[ord[i]] > f) {
                t++;
                f = a[N + ord[i]];
            }
        }
        if (s < t) {
            ans++;
        }
    } while (next_permutation(a.begin(), a.end()));
    cout << ans << "\n";
    return 6/22;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct
8 Execution timed out 9102 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct
8 Execution timed out 9102 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct
8 Execution timed out 9102 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct
8 Execution timed out 9102 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 27 ms 212 KB Output is correct
8 Execution timed out 9102 ms 212 KB Time limit exceeded
9 Halted 0 ms 0 KB -