Submission #1092838

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092838		Pannda	Naan (JOI19_naan)	C++17	5 / 100	1 ms	348 KiB

naan

#include <bits/stdc++.h>
using namespace std;

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

    struct Fraction {
        int 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 & {
            int A = a * other.a;
            int B = b * other.b;
            int G = 1;// abs(__gcd(A, B));
            return {A / G, B / G};
        }
        Fraction operator+(const Fraction &other) const & {
            int B = b * other.b;
            int A = a * other.b + other.a * b;
            int G = 1;//abs(__gcd(A, B));
            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++) {
        vector<pair<Fraction, int>> get = [&]() -> vector<pair<Fraction, int>> {
            vector<pair<Fraction, int>> res;
            for (int i = 0; i < n; i++) {
                if (chosen[i]) continue;
                Fraction nxt = [&]() -> Fraction {
                    auto F = [&](Fraction x) -> Fraction {
                        int j = x.a / x.b;
                        if (j < m) return Fraction{f[i][j], 1} + Fraction{v[i][j], 1} * Fraction{x.a % x.b, x.b};
                        return Fraction{f[i][m], 1};
                    };
                    Fraction req = F(Fraction{m, 1}) * Fraction{1, n};
                    while (true) {
                        if (F(Fraction{ptr[i] + 1, 1}) - F(cur) <= req) { // then is not enough
                            ptr[i]++;
                            continue;
                        }
                        Fraction rem = req + F(cur) - F(Fraction{ptr[i], 1});
                        return Fraction{ptr[i], 1} + rem * Fraction{1, v[i][ptr[i]]};
                    }
                }();
                res.push_back({nxt, i});
            }
            return res;
        }();
        auto [nxt, i] = *min_element(get.begin(), get.end());
        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 << frac.a << ' ' << frac.b << '\n';
    }
    for (int i : perm) {
        cout << i + 1 << ' ';
    }
    cout << '\n';
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 24
• Subtask 3: 0 / 71