oj.uz

답안 #191334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
191334 2020-01-14T17:04:50 Z dolphingarlic Naan (JOI19_naan) C++14
29 / 100
 437 ms 127480 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll gcd(ll A, ll B) { return (B ? gcd(B, A % B) : A); }

struct Rational {
    ll x, y; // x/y

    Rational(ll num = 1, ll den = 1) {
        ll g = gcd(num, den);
        x = num / g;
        y = den / g;
    }

    Rational operator+(Rational B) { return Rational(x * B.y + B.x * y, y * B.y); }
    Rational operator-(Rational B) { return Rational(x * B.y - B.x * y, y * B.y); }
    Rational operator*(Rational B) { return Rational(x * B.x, y * B.y); }
};

bool operator<(Rational A, Rational B) { return A.x * B.y < A.y * B.x; }
ostream& operator<<(ostream& os, const Rational& A) {
    os << A.x << ' ' << A.y;
    return os;
}

Rational cut_places[2001][2001];
bool visited[2001];
ll order[2001], a[2001];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n, l;
    cin >> n >> l;
    FOR(i, 0, n) {
        ll sm = 0;
        FOR(j, 0, l) {
            cin >> a[j];
            sm += a[j];
        }

        Rational curr = Rational(0), target = Rational(sm, n);
        int idx = 0;
        FOR(j, 0, l) {
            while (target < curr + Rational(a[j])) {
                Rational offset = target - curr;
                cut_places[i][idx++] = Rational(j) + offset * Rational(1, a[j]);
                target = target + Rational(sm, n);

                assert((idx - 1 ? cut_places[i][idx - 2] : Rational(0)) < cut_places[i][idx - 1]);
            }
            curr = curr + Rational(a[j]);
        }
    }

    FOR(i, 0, n - 1) {
        Rational earliest = Rational(10000000000);
        FOR(j, 0, n) if (!visited[j] & cut_places[j][i] < earliest) {
            earliest = cut_places[j][i], j;
            order[i] = j;
        }
        cout << earliest << '\n';
        visited[order[i]] = true;
    }
    FOR(i, 0, n) if (!visited[i]) order[n - 1] = i;
    FOR(i, 0, n) cout << order[i] + 1 << ' ';
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:60:57: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
         FOR(j, 0, n) if (!visited[j] & cut_places[j][i] < earliest) {
                                        ~~~~~~~~~~~~~~~~~^~~~~~~~~~
naan.cpp:61:43: warning: right operand of comma operator has no effect [-Wunused-value]
             earliest = cut_places[j][i], j;
                                           ^

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 63096 KB Output is correct
2 Correct 53 ms 62968 KB Output is correct
3 Correct 52 ms 62968 KB Output is correct
4 Correct 57 ms 63096 KB Output is correct
5 Correct 53 ms 62968 KB Output is correct
6 Correct 57 ms 63096 KB Output is correct
7 Correct 51 ms 63096 KB Output is correct
8 Correct 53 ms 62972 KB Output is correct
9 Correct 52 ms 63096 KB Output is correct
10 Correct 52 ms 63096 KB Output is correct
11 Correct 53 ms 63096 KB Output is correct
12 Correct 53 ms 62968 KB Output is correct
13 Correct 53 ms 63008 KB Output is correct
14 Correct 53 ms 62968 KB Output is correct
15 Correct 53 ms 63140 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 63072 KB Output is correct
2 Correct 54 ms 62968 KB Output is correct
3 Correct 65 ms 62968 KB Output is correct
4 Correct 53 ms 63096 KB Output is correct
5 Correct 65 ms 63084 KB Output is correct
6 Correct 63 ms 63096 KB Output is correct
7 Correct 53 ms 63052 KB Output is correct
8 Correct 53 ms 63096 KB Output is correct
9 Correct 53 ms 63096 KB Output is correct
10 Correct 50 ms 63096 KB Output is correct
11 Correct 52 ms 62968 KB Output is correct
12 Correct 59 ms 63224 KB Output is correct
13 Correct 50 ms 63068 KB Output is correct
14 Correct 53 ms 62844 KB Output is correct
15 Correct 51 ms 63068 KB Output is correct
16 Correct 61 ms 63068 KB Output is correct
17 Correct 53 ms 63096 KB Output is correct
18 Correct 53 ms 63068 KB Output is correct
19 Correct 64 ms 63096 KB Output is correct
20 Correct 65 ms 63172 KB Output is correct
21 Correct 56 ms 63224 KB Output is correct
22 Correct 65 ms 63116 KB Output is correct
23 Correct 65 ms 63036 KB Output is correct
24 Correct 52 ms 63084 KB Output is correct
25 Correct 53 ms 63096 KB Output is correct
26 Correct 53 ms 63152 KB Output is correct
27 Correct 64 ms 62968 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 63096 KB Output is correct
2 Correct 53 ms 62968 KB Output is correct
3 Correct 52 ms 62968 KB Output is correct
4 Correct 57 ms 63096 KB Output is correct
5 Correct 53 ms 62968 KB Output is correct
6 Correct 57 ms 63096 KB Output is correct
7 Correct 51 ms 63096 KB Output is correct
8 Correct 53 ms 62972 KB Output is correct
9 Correct 52 ms 63096 KB Output is correct
10 Correct 52 ms 63096 KB Output is correct
11 Correct 53 ms 63096 KB Output is correct
12 Correct 53 ms 62968 KB Output is correct
13 Correct 53 ms 63008 KB Output is correct
14 Correct 53 ms 62968 KB Output is correct
15 Correct 53 ms 63140 KB Output is correct
16 Correct 52 ms 63072 KB Output is correct
17 Correct 54 ms 62968 KB Output is correct
18 Correct 65 ms 62968 KB Output is correct
19 Correct 53 ms 63096 KB Output is correct
20 Correct 65 ms 63084 KB Output is correct
21 Correct 63 ms 63096 KB Output is correct
22 Correct 53 ms 63052 KB Output is correct
23 Correct 53 ms 63096 KB Output is correct
24 Correct 53 ms 63096 KB Output is correct
25 Correct 50 ms 63096 KB Output is correct
26 Correct 52 ms 62968 KB Output is correct
27 Correct 59 ms 63224 KB Output is correct
28 Correct 50 ms 63068 KB Output is correct
29 Correct 53 ms 62844 KB Output is correct
30 Correct 51 ms 63068 KB Output is correct
31 Correct 61 ms 63068 KB Output is correct
32 Correct 53 ms 63096 KB Output is correct
33 Correct 53 ms 63068 KB Output is correct
34 Correct 64 ms 63096 KB Output is correct
35 Correct 65 ms 63172 KB Output is correct
36 Correct 56 ms 63224 KB Output is correct
37 Correct 65 ms 63116 KB Output is correct
38 Correct 65 ms 63036 KB Output is correct
39 Correct 52 ms 63084 KB Output is correct
40 Correct 53 ms 63096 KB Output is correct
41 Correct 53 ms 63152 KB Output is correct
42 Correct 64 ms 62968 KB Output is correct
43 Correct 437 ms 63112 KB Output is correct
44 Runtime error 281 ms 127480 KB Execution killed with signal 11 (could be triggered by violating memory limits)
45 Halted 0 ms 0 KB -