oj.uz

답안 #699321

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
699321 2023-02-16T14:59:04 Z doowey Naan (JOI19_naan) C++14
29 / 100
 4000 ms 127424 KB 
#include <bits/stdc++.h>

using namespace std;

typedef __int128 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;

struct frac{
    ll A;
    ll B;
    frac operator+ (frac y){
        return {A * y.B + B * y.A, B * y.B};
    }
    frac operator- (frac y){
        return {A * y.B - B * y.A, B * y.B};
    }
    bool operator< (frac y){
        if(A/B == y.A/y.B){
            ll common = A/B;
            ll temp0 = A - B * common;
            ll temp1 = y.A - y.B * common;
            return (temp0 * y.B - B * temp1 < 0);
        }
        else{
            return A/B < y.A/y.B;
        }
    }
};

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 S;
    ll X;

    for(int it = 1; it < n; it ++ ){
        low = {m, 1};
        idx = -1;
        for(int i = 1; i <= n; i ++ ){
            if(!use[i]){
                tis = calc(i, las);
                for(int j = 1; j <= m; j ++ ){
                    nx = calc(i, {j, 1});
                    if(tis < nx){
                        if(need[i] < nx - tis){
                            S = nx - tis;
                            S = S - need[i];
                            S.A *= (ll)n;
                            X = S.A / S.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:74:10: warning: unused variable 'cur' [-Wunused-variable]
   74 |     frac cur;
      |          ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
6 Correct 1 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 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 1 ms 468 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 1 ms 724 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 596 KB Output is correct

Subtask #3
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 340 KB Output is correct
6 Correct 1 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 0 ms 340 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 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 340 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 1 ms 596 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 724 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 724 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 1 ms 724 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 1 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 58 ms 13012 KB Output is correct
44 Correct 531 ms 65104 KB Output is correct
45 Correct 242 ms 43800 KB Output is correct
46 Correct 32 ms 7472 KB Output is correct
47 Correct 339 ms 52344 KB Output is correct
48 Correct 718 ms 42316 KB Output is correct
49 Correct 182 ms 23324 KB Output is correct
50 Correct 874 ms 96196 KB Output is correct
51 Correct 303 ms 62684 KB Output is correct
52 Correct 792 ms 108308 KB Output is correct
53 Correct 749 ms 84916 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 315 ms 16536 KB Output is correct
56 Correct 549 ms 79264 KB Output is correct
57 Correct 1614 ms 62908 KB Output is correct
58 Correct 2593 ms 76012 KB Output is correct
59 Correct 1820 ms 71436 KB Output is correct
60 Correct 3045 ms 127296 KB Output is correct
61 Correct 3099 ms 127180 KB Output is correct
62 Correct 2925 ms 126740 KB Output is correct
63 Correct 3017 ms 127352 KB Output is correct
64 Correct 2994 ms 127328 KB Output is correct
65 Correct 3066 ms 127244 KB Output is correct
66 Correct 3487 ms 127424 KB Output is correct
67 Execution timed out 4096 ms 127184 KB Time limit exceeded
68 Halted 0 ms 0 KB -