oj.uz

답안 #278829

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
278829 2020-08-22T00:21:30 Z caoash Naan (JOI19_naan) C++14
100 / 100
 1713 ms 129400 KB 
#include <bits/stdc++.h> 
using namespace std;
 
using ll = long long;
 
using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
 
using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair
 
struct fr{
    __int128 x, y;
    
    fr(__int128 X = 0, __int128 Y = 1){
        x = X, y = Y;
        ll g = __gcd(x, y);
        x /= g, y /= g;
    }
    
    friend fr operator+(fr a, fr b){
        return fr(a.x * b.y + b.x * a.y, a.y * b.y);
    }
    
    friend fr operator-(fr a, fr b){
        return fr(a.x * b.y - b.x * a.y, a.y * b.y);
    }
    
    friend fr operator*(fr a, fr b){
        return fr(a.x * b.x, a.y * b.y);
    }
    
    friend fr operator/(fr a, fr b){
        return fr(a.x * b.y, a.y * b.x);
    }
    
    friend bool operator<(fr a, fr b){
        return a.x * b.y < b.x * a.y;
    }
};
 
const int MX = 2005;
 
bool used[MX]; fr V[MX][MX]; fr nd[MX], dist[MX], ans[MX]; int ind[MX];
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, L; cin >> N >> L;
    for (int i = 1; i <= N; i++) {
        V[i][0] = fr(0);
        for (int j = 1; j <= L; j++) {
            ll x; cin >> x; 
            V[i][j] = fr(x);
            if (j != 0) V[i][j] = V[i][j] + V[i][j - 1];
        }
    }
    nd[0] = fr(0);
    for (int i = 1; i <= N; i++) {
        ans[i] = fr(L + 1);
        for (int j = 1; j <= N; j++) {
            if (used[j]) {
                continue;
            }
            // cout << "i, j: " << i << " " << j << '\n';
            fr need = V[j][L] * fr(i, N);
            // cout << "i, j, need: " << i << " " << j << " " << (ll) need.x << " " << (ll) need.y << '\n';
            int it = lower_bound(V[j], V[j] + L, need) - V[j] - 1;
            // cout << "i, j, it: " << i << " " << j << " " << it << '\n';
            fr to_add = fr(it) + (need - V[j][it]) / (V[j][it + 1] - V[j][it]);
            // cout << "i, j, to_add: " << i << " " << j << " " << (ll) to_add.x << " " << (ll) to_add.y << '\n';
            if (to_add < ans[i]) {
                // cout << "best: " << (ll) to_add.x << " " << (ll)to_add.y << " " << j << " " << '\n';
                ans[i] = to_add;
                ind[i] = j;
                nd[i] = need;
            }
        }
        // cout << "i, ind: " << i << " " << ind[i] << "\n";
        if(i < N) cout << (ll) ans[i].x << " " << (ll) ans[i].y << '\n';
        used[ind[i]] = true;
    }
    for (int i = 1; i <= N; i++) {
        cout << ind[i] << " ";
    }
    cout << '\n';
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126328 KB Output is correct
2 Correct 69 ms 126328 KB Output is correct
3 Correct 69 ms 126348 KB Output is correct
4 Correct 68 ms 126332 KB Output is correct
5 Correct 69 ms 126460 KB Output is correct
6 Correct 68 ms 126328 KB Output is correct
7 Correct 70 ms 126328 KB Output is correct
8 Correct 69 ms 126332 KB Output is correct
9 Correct 68 ms 126456 KB Output is correct
10 Correct 71 ms 126368 KB Output is correct
11 Correct 77 ms 126456 KB Output is correct
12 Correct 69 ms 126456 KB Output is correct
13 Correct 77 ms 126456 KB Output is correct
14 Correct 72 ms 126472 KB Output is correct
15 Correct 69 ms 126456 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126328 KB Output is correct
2 Correct 69 ms 126456 KB Output is correct
3 Correct 70 ms 126456 KB Output is correct
4 Correct 69 ms 126444 KB Output is correct
5 Correct 79 ms 126456 KB Output is correct
6 Correct 69 ms 126456 KB Output is correct
7 Correct 71 ms 126456 KB Output is correct
8 Correct 69 ms 126456 KB Output is correct
9 Correct 72 ms 126416 KB Output is correct
10 Correct 73 ms 126456 KB Output is correct
11 Correct 68 ms 126456 KB Output is correct
12 Correct 71 ms 126456 KB Output is correct
13 Correct 70 ms 126456 KB Output is correct
14 Correct 71 ms 126456 KB Output is correct
15 Correct 78 ms 126456 KB Output is correct
16 Correct 71 ms 126456 KB Output is correct
17 Correct 75 ms 126456 KB Output is correct
18 Correct 71 ms 126456 KB Output is correct
19 Correct 69 ms 126456 KB Output is correct
20 Correct 70 ms 126456 KB Output is correct
21 Correct 81 ms 126456 KB Output is correct
22 Correct 80 ms 126456 KB Output is correct
23 Correct 76 ms 126328 KB Output is correct
24 Correct 69 ms 126456 KB Output is correct
25 Correct 73 ms 126460 KB Output is correct
26 Correct 69 ms 126460 KB Output is correct
27 Correct 69 ms 126456 KB Output is correct

Subtask #3
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 126328 KB Output is correct
2 Correct 69 ms 126328 KB Output is correct
3 Correct 69 ms 126348 KB Output is correct
4 Correct 68 ms 126332 KB Output is correct
5 Correct 69 ms 126460 KB Output is correct
6 Correct 68 ms 126328 KB Output is correct
7 Correct 70 ms 126328 KB Output is correct
8 Correct 69 ms 126332 KB Output is correct
9 Correct 68 ms 126456 KB Output is correct
10 Correct 71 ms 126368 KB Output is correct
11 Correct 77 ms 126456 KB Output is correct
12 Correct 69 ms 126456 KB Output is correct
13 Correct 77 ms 126456 KB Output is correct
14 Correct 72 ms 126472 KB Output is correct
15 Correct 69 ms 126456 KB Output is correct
16 Correct 69 ms 126328 KB Output is correct
17 Correct 69 ms 126456 KB Output is correct
18 Correct 70 ms 126456 KB Output is correct
19 Correct 69 ms 126444 KB Output is correct
20 Correct 79 ms 126456 KB Output is correct
21 Correct 69 ms 126456 KB Output is correct
22 Correct 71 ms 126456 KB Output is correct
23 Correct 69 ms 126456 KB Output is correct
24 Correct 72 ms 126416 KB Output is correct
25 Correct 73 ms 126456 KB Output is correct
26 Correct 68 ms 126456 KB Output is correct
27 Correct 71 ms 126456 KB Output is correct
28 Correct 70 ms 126456 KB Output is correct
29 Correct 71 ms 126456 KB Output is correct
30 Correct 78 ms 126456 KB Output is correct
31 Correct 71 ms 126456 KB Output is correct
32 Correct 75 ms 126456 KB Output is correct
33 Correct 71 ms 126456 KB Output is correct
34 Correct 69 ms 126456 KB Output is correct
35 Correct 70 ms 126456 KB Output is correct
36 Correct 81 ms 126456 KB Output is correct
37 Correct 80 ms 126456 KB Output is correct
38 Correct 76 ms 126328 KB Output is correct
39 Correct 69 ms 126456 KB Output is correct
40 Correct 73 ms 126460 KB Output is correct
41 Correct 69 ms 126460 KB Output is correct
42 Correct 69 ms 126456 KB Output is correct
43 Correct 191 ms 127936 KB Output is correct
44 Correct 856 ms 128888 KB Output is correct
45 Correct 346 ms 129016 KB Output is correct
46 Correct 97 ms 127480 KB Output is correct
47 Correct 541 ms 129016 KB Output is correct
48 Correct 1290 ms 128376 KB Output is correct
49 Correct 336 ms 127608 KB Output is correct
50 Correct 1651 ms 129400 KB Output is correct
51 Correct 595 ms 129144 KB Output is correct
52 Correct 1399 ms 129016 KB Output is correct
53 Correct 1219 ms 129144 KB Output is correct
54 Correct 71 ms 126456 KB Output is correct
55 Correct 580 ms 126844 KB Output is correct
56 Correct 769 ms 129144 KB Output is correct
57 Correct 637 ms 129272 KB Output is correct
58 Correct 1119 ms 129072 KB Output is correct
59 Correct 643 ms 129028 KB Output is correct
60 Correct 1534 ms 126712 KB Output is correct
61 Correct 1539 ms 126712 KB Output is correct
62 Correct 1713 ms 126860 KB Output is correct
63 Correct 1684 ms 126584 KB Output is correct
64 Correct 1601 ms 126848 KB Output is correct
65 Correct 1660 ms 129012 KB Output is correct
66 Correct 1653 ms 128888 KB Output is correct
67 Correct 1509 ms 128876 KB Output is correct
68 Correct 721 ms 129016 KB Output is correct
69 Correct 669 ms 129044 KB Output is correct
70 Correct 873 ms 129016 KB Output is correct
71 Correct 1025 ms 128856 KB Output is correct