oj.uz

Submission #332673

# Submission time Handle Problem Language Result Execution time Memory
332673 2020-12-03T02:38:18 Z 12tqian Naan (JOI19_naan) C++17
29 / 100
 4000 ms 210260 KB 
#include <bits/stdc++.h>
 
struct Frac {
    __int128_t n, d;
    Frac(__int128_t _n, __int128_t _d) {
        n = _n, d = _d;
        __int128_t g = std::__gcd(n, d); n /= g, d /= g;
        if (d < 0) n *= -1, d *= -1;
    }
    Frac(__int128_t _n) : Frac(_n, 1) {}
    Frac() : Frac(0) {}
    friend Frac abs(Frac F) { return Frac(abs(F.n), F.d); }
    friend bool operator < (const Frac& l, const Frac& r) { return l.n * r.d < r.n * l.d; }
    friend bool operator <= (const Frac& l, const Frac& r) { return l.n * r.d <= r.n * l.d; }
    friend bool operator > (const Frac& l, const Frac& r) { return l.n * r.d > r.n * l.d; }
    friend bool operator >= (const Frac& l, const Frac& r) { return l.n * r.d >= r.n * l.d; }
    friend bool operator == (const Frac& l, const Frac& r) { return l.n == r.n && l.d == r.d; }
    friend bool operator != (const Frac& l, const Frac& r) { return !(l == r); }
    Frac operator - () const { return Frac(-n, d); }
    friend Frac operator + (const Frac& l, const Frac& r) { return Frac(l.n * r.d + r.n * l.d, l.d * r.d); }
    friend Frac operator - (const Frac& l, const Frac& r) { return Frac(l.n * r.d - r.n * l.d, l.d * r.d); }
    friend Frac operator * (const Frac& l, const Frac& r) { return Frac(l.n * r.n, l.d * r.d); }
    friend Frac operator * (const Frac& l, int r) { return l * Frac(r, 1); }
    friend Frac operator * (int r, const Frac& l) { return l * r; }
    friend Frac operator / (const Frac& l, const Frac& r) { return l * Frac(r.d, r.n); }
    friend Frac operator / (const Frac& l, const int& r) { return l / Frac(r, 1); }
    friend Frac operator / (const int& l, const Frac& r) { return Frac(l, 1) / r; }
    friend Frac& operator += (Frac& l, const Frac& r) { return l = l + r; }
    friend Frac& operator -= (Frac& l, const Frac& r) { return l = l - r; }
    template <class T> friend Frac& operator *= (Frac& l, const T& r) { return l = l * r; }
    template <class T> friend Frac& operator /= (Frac& l, const T& r) { return l = l / r; }
};

int main() {
    using namespace std;
    typedef __int128_t ll;
    ios_base::sync_with_stdio(0);
    int N, L; 
    cin >> N >> L;
    vector<vector<ll>> V(N, vector<ll>(L));
    for (int i = 0; i < N; i++) 
        for (int j = 0; j < L; j++) {
            long long x; cin >> x;
            V[i][j] = x;
        }
    vector<vector<Frac>> split(N, vector<Frac>(N + 1));
    for (int i = 0; i < N; i++) {
        Frac need = 0;
        for (int j = 0; j < L; j++)
            need += V[i][j];
        need /= N;
        split[i][0] = 0;
        Frac have = 0;
        int it = 0;
        Frac at = 0;
        for (int j = 1; j <= N; j++) {
            while (have < need) {
                if (have + (1 - at) * V[i][it] <= need) {
                    have += (1 - at) * V[i][it];
                    at = 0;
                    it++;
                } else {
                    Frac go = (need - have) / V[i][it];
                    have = need;
                    at += go;
                }
            }
            split[i][j] = it + at;
            have = 0;
        }
    }
    const int INF = 1e9;
    vector<Frac> splits(N);
    vector<int> ord(N);
    vector<bool> used(N);
    for (int i = 1; i <= N - 1; i++) {
        pair<Frac, int> best = {INF, INF};
        for (int j = 0; j < N; j++) 
            if (!used[j])
                best = min(best, {split[j][i], j});
        splits[i - 1] = best.first;
        ord[i - 1] = best.second;
        used[best.second] = true;
    }
    for (int i = 0; i < N; i++) {
        if (!used[i])
            ord.back() = i;
    }
    for (int i = 1; i < N - 1; i++) 
        splits[i] = max(splits[i], splits[i - 1]);
    for (int i = 0; i < N - 1; i++) {
        assert(splits[i - 1] <= splits[i]);
    }
    for (int i = 0; i < N - 1; i++)
        cout << (long long) splits[i].n << " " << (long long) splits[i].d << '\n';
    for (int i = 0; i < N; i++)
        cout << ord[i] + 1 << " ";
    cout << '\n';
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 3 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 3 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 3 ms 492 KB Output is correct
17 Correct 3 ms 492 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 3 ms 492 KB Output is correct
21 Correct 3 ms 492 KB Output is correct
22 Correct 4 ms 492 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 3 ms 492 KB Output is correct

Subtask #3
0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 3 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 3 ms 492 KB Output is correct
25 Correct 3 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 3 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 3 ms 492 KB Output is correct
32 Correct 3 ms 492 KB Output is correct
33 Correct 3 ms 492 KB Output is correct
34 Correct 3 ms 492 KB Output is correct
35 Correct 3 ms 492 KB Output is correct
36 Correct 3 ms 492 KB Output is correct
37 Correct 4 ms 492 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 492 KB Output is correct
40 Correct 2 ms 492 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 3 ms 492 KB Output is correct
43 Correct 348 ms 14520 KB Output is correct
44 Correct 2146 ms 86124 KB Output is correct
45 Correct 762 ms 35564 KB Output is correct
46 Correct 62 ms 3948 KB Output is correct
47 Correct 1321 ms 52972 KB Output is correct
48 Correct 2825 ms 124140 KB Output is correct
49 Correct 618 ms 31980 KB Output is correct
50 Correct 3539 ms 162256 KB Output is correct
51 Correct 1275 ms 65260 KB Output is correct
52 Correct 3039 ms 150472 KB Output is correct
53 Correct 2724 ms 129836 KB Output is correct
54 Correct 2 ms 492 KB Output is correct
55 Correct 1330 ms 65008 KB Output is correct
56 Correct 1782 ms 91540 KB Output is correct
57 Correct 1456 ms 75884 KB Output is correct
58 Correct 2626 ms 126044 KB Output is correct
59 Correct 1574 ms 77228 KB Output is correct
60 Correct 3754 ms 210260 KB Output is correct
61 Execution timed out 4085 ms 210156 KB Time limit exceeded
62 Halted 0 ms 0 KB -