oj.uz

Submission #1092893

# Submission time Handle Problem Language Result Execution time Memory
1092893 2024-09-25T09:57:39 Z Pannda Naan (JOI19_naan) C++17
29 / 100
 29 ms 5716 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    struct Fraction {
        __int128 a = 0, b = 1;
        bool operator<(const Fraction &other) const & {
            return a * other.b < other.a * b;
        }
        bool operator<=(const Fraction &other) const & {
            return !(other < *this);
        }
        Fraction operator*(const Fraction &other) const & {
            __int128 A = a * other.a;
            __int128 B = b * other.b;
            __int128 G = __gcd(A, B);
            if (G < 0) G = -G;
            return {A / G, B / G};
        }
        Fraction operator+(const Fraction &other) const & {
            __int128 B = b * other.b;
            __int128 A = a * other.b + other.a * b;
            __int128 G = __gcd(A, B);
            if (G < 0) G = -G;
            return {A / G, B / G};
        }
        Fraction operator-(Fraction other) {
            other.a *= -1;
            return (*this) + other;
        }

    };

    int n, m;
    cin >> n >> m;

    vector<vector<int>> v(n, vector<int>(m));
    vector<vector<int>> f(n, vector<int>(m + 1, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int x;
            cin >> x;
            v[i][j] = x;
            f[i][j + 1] = f[i][j] + x;
        }
    }

    vector<Fraction> key;
    vector<int> perm;

    vector<bool> chosen(n, false);
    Fraction cur = {0, 1};
    vector<int> ptr(n, 0); // possible cut for i is in [ptr[i], ptr[i] + 1)

    for (int t = 0; t < n - 1; t++) {
        auto [nxt, i]  = [&]() -> pair<Fraction, int> {
            pair<int, Fraction> res_nxt = {m, Fraction{0, 0}};
            int res_i = -1;
            for (int i = 0; i < n; i++) {
                if (chosen[i]) continue;
                Fraction x = [&]() -> Fraction {
                    auto F = [&](Fraction x) -> Fraction {
                        int j = x.a / x.b;
                        assert(x.b > 0);
                        return Fraction{f[i][j], 1} + Fraction{v[i][j], 1} * Fraction{x.a % x.b, x.b};
                    };
                    Fraction req = Fraction{f[i][m], n};
                    Fraction Fcur = F(cur);
                    while (true) {
                        if (Fraction{f[i][ptr[i] + 1], 1} - Fcur <= req) { // then is not enough
                            ptr[i]++;
                            continue;
                        }
                        return ( req + Fcur - Fraction{f[i][ptr[i]], 1}) * Fraction{1, v[i][ptr[i]]};
                    }
                }();
                pair<int, Fraction> z = {ptr[i], x};
                if (z < res_nxt) {
                    res_nxt = z;
                    res_i = i;
                }
            }
            return make_pair( Fraction{res_nxt.first, 1} + res_nxt.second, res_i );
        }();
        key.push_back(nxt);
        perm.push_back(i);
        cur = nxt;
        chosen[i] = true;
    }

    for (int i = 0; i < n; i++) {
        if (!chosen[i]) perm.push_back(i);
    }

    for (Fraction frac : key) {
        cout << (long long)frac.a << ' ' << (int)frac.b << '\n';
    }
    for (int i : perm) {
        cout << i + 1 << ' ';
    }
    cout << '\n';
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 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
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory 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 1 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
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 556 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 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
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 360 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 556 KB Output is correct
43 Runtime error 29 ms 5716 KB Execution killed with signal 6
44 Halted 0 ms 0 KB -