oj.uz

Submission #699358

# Submission time Handle Problem Language Result Execution time Memory
699358 2023-02-16T16:32:23 Z doowey Naan (JOI19_naan) C++14
100 / 100
 3299 ms 63928 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 2010;
const ll C = (ll)1e18;

int cii;
int cjj;

struct frac{
    ll A;
    ll B;
    frac operator+ (frac y){
        if(A > C / y.B){
            cout << "WA\n";
            exit(0);
        }
        if(B > C / y.B){
            cout << "WA\n";
            exit(0);
        }
        return {A * y.B + B * y.A, B * y.B};
    }
    frac operator- (frac y){
        if(A > C / y.B){
            cout << "WA\n";
            exit(0);
        }
        if(B > C / y.B){
            cout << "WA\n";
            exit(0);
        }
        return {A * y.B - B * y.A, B * y.B};
    }
    bool operator< (frac y){
        if(A/B != y.A/y.B){
            return A/B < y.A/y.B;
        }
        ll D = A/B;
        ll temp0 = A - D * B;
        ll temp1 = y.A - D * y.B;
        return (temp0 * y.B - temp1 * B < 0);
    }
};

ll V[N][N];
ll S[N][N];
int m;

frac calc(int id, frac P){
    int las = P.A / P.B;
    frac Y = {S[id][las], 1};
    frac add = (P - (frac){las, 1});
    add.A *= V[id][las + 1];
    Y = Y + add;
    return Y;
}

frac need[N];
bool use[N];
int pi[N];

int main(){
    fastIO;
    //freopen("in.txt", "r", stdin);
    int n;
    cin >> n >> m;
    int vv;
    for(int i = 1; i <= n; i ++ ){
        need[i] = {0, n};
        for(int j = 1; j <= m ; j ++ ){
            cin >> vv;
            V[i][j] = vv;
            need[i].A += V[i][j];
            S[i][j] = V[i][j] + S[i][j - 1];
        }
        pi[i] = -1;
    }
    frac las = {0, 1};
    frac tis;
    frac nx;
    frac cur;
    frac low;
    int idx;
    frac SS;
    ll X;

    for(int it = 1; it < n; it ++ ){
        low = {m, 1};
        idx = -1;
        for(int i = 1; i <= n; i ++ ){
            cii = i;
            if(!use[i]){
                tis = calc(i, las);
                for(int j = 1; j <= m; j ++ ){
                    cjj = j;
                    nx = (frac){S[i][j], 1ll};
                    if(tis < nx){
                        SS = nx - tis;
                        SS = SS - need[i];
                        if(SS.A > 0){
                            SS.B /= n;
                            X = SS.A / SS.B;
                            tis = (frac){j, 1} - (frac){X, n * 1ll * V[i][j]};
                            if(tis < low){
                                low = tis;
                                idx = i;
                            }
                            break;
                        }
                    }
                }
            }
        }
        pi[it] = idx;
        use[idx]=true;
        las = low;
        cout << (long long)low.A << " " << (long long)low.B << "\n";
    }
    for(int i = 1; i <= n; i ++ ){
        if(!use[i]){
            pi[n]=i;
        }
    }
    for(int i = 1; i <= n; i ++ ){
        cout << pi[i] << " ";
    }
    cout << "\n";
    return 0;
}

Compilation message

naan.cpp: In function 'int main()':
naan.cpp:91:10: warning: unused variable 'cur' [-Wunused-variable]
   91 |     frac cur;
      |          ^~~

Subtask #1
5.0 / 5.0

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

Subtask #2
24.0 / 24.0

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

Subtask #3
71.0 / 71.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 340 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 51 ms 8964 KB Output is correct
44 Correct 429 ms 38216 KB Output is correct
45 Correct 194 ms 22056 KB Output is correct
46 Correct 21 ms 4116 KB Output is correct
47 Correct 296 ms 30268 KB Output is correct
48 Correct 990 ms 28840 KB Output is correct
49 Correct 250 ms 16252 KB Output is correct
50 Correct 1165 ms 57088 KB Output is correct
51 Correct 409 ms 33992 KB Output is correct
52 Correct 1010 ms 55240 KB Output is correct
53 Correct 881 ms 50200 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 227 ms 14340 KB Output is correct
56 Correct 417 ms 41976 KB Output is correct
57 Correct 857 ms 37324 KB Output is correct
58 Correct 1517 ms 45816 KB Output is correct
59 Correct 1148 ms 36036 KB Output is correct
60 Correct 1998 ms 63612 KB Output is correct
61 Correct 1992 ms 63592 KB Output is correct
62 Correct 1844 ms 63376 KB Output is correct
63 Correct 1986 ms 63640 KB Output is correct
64 Correct 2017 ms 63744 KB Output is correct
65 Correct 1887 ms 63908 KB Output is correct
66 Correct 2303 ms 63828 KB Output is correct
67 Correct 3299 ms 63928 KB Output is correct
68 Correct 598 ms 43108 KB Output is correct
69 Correct 655 ms 47032 KB Output is correct
70 Correct 675 ms 47304 KB Output is correct
71 Correct 1107 ms 61436 KB Output is correct