QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#536500#4561. Catfish FarmWansur#14 20ms256040kbC++231.2kb2024-08-29 13:53:582024-08-29 13:53:59

Judging History

你现在查看的是最新测评结果

  • [2024-08-29 13:53:59]
  • 评测
  • 测评结果:14
  • 用时:20ms
  • 内存:256040kb
  • [2024-08-29 13:53:58]
  • 提交

answer

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int maxn = 2e5 + 12;

vector<pair<int, int>> g[maxn];
ll dp[322][322][322], pref[2022][2022];
ll a[2022][2022];

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    ll ans = 0;
    for(int i=0;i<m;i++){
        x[i]++, y[i]++;
        a[x[i]][y[i]] += w[i];
    }
    for(int i=0;i<=n;i++){
        for(int x=0;x<=n;x++){
            for(int y=0;y<=n;y++){
                dp[i][x][y] = -1e18;
            }
        }
    }
    dp[0][0][0] = 0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            pref[i][j] = pref[i][j-1] + a[i][j];
        }
        for(int l=0;l<=min(n, 8);l++){
            for(int x=0;x<=min(n, 8);x++){
                for(int y=0;y<=min(n, 8);y++){
                    ll val = dp[i-1][l][x];
                    if(x > y) val += pref[i][x] - pref[i][y];
                    if(max(l, x) < y) val += pref[i-1][y] - pref[i-1][max(l, x)];
                    dp[i][x][y] = max(dp[i][x][y], val);
                    ans = max(ans, val);
                }
            }
        }
    }
    return ans;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Time Limit Exceeded

Test #1:

score: 0
Time Limit Exceeded

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
90000 80699
0 10792 55091480
0 36762 389250726
0 79267 706445371
0 76952 290301137
0 13444 69711795
0 68980 66221400
0 1695 703252611
0 36628 632571604
0 87676 264578012
0 79496 397448339
0 57929 447544332
0 35453 355374818
0 62449 686423696
0 45614 667165709...

output:

Unauthorized output

result:


Subtask #2:

score: 0
Time Limit Exceeded

Test #7:

score: 6
Accepted
time: 2ms
memory: 7912kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
3 2
0 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
2

result:

ok 3 lines

Test #8:

score: 0
Time Limit Exceeded

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
90000 161862
0 56823 293232472
0 28967 124369573
1 8799 138712011
0 87115 743135614
1 56429 262092699
0 61318 597172732
0 39127 477101342
1 44938 277680401
1 79037 997527330
1 88113 13289754
0 29715 35249311
0 50637 709319782
1 20760 845594381
1 80662 6299890...

output:

Unauthorized output

result:


Subtask #3:

score: 0
Time Limit Exceeded

Test #20:

score: 0
Time Limit Exceeded

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 1
0 0 10082010

output:

Unauthorized output

result:


Subtask #4:

score: 14
Accepted

Test #28:

score: 14
Accepted
time: 2ms
memory: 8172kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
4 3
2 2 1
0 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
3

result:

ok 3 lines

Test #29:

score: 14
Accepted
time: 0ms
memory: 12040kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
8 7
5 5 1
4 4 1
6 6 1
3 3 1
0 0 1
2 2 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
7

result:

ok 3 lines

Test #30:

score: 14
Accepted
time: 0ms
memory: 7976kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
3 2
0 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
2

result:

ok 3 lines

Test #31:

score: 14
Accepted
time: 1ms
memory: 8164kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
3 2
2 0 1
1 1 1

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
2

result:

ok 3 lines

Test #32:

score: 14
Accepted
time: 0ms
memory: 131828kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
150 600
79 2 983288470
11 0 322623476
136 0 774411048
24 2 816724362
21 2 719492379
33 3 892309581
47 0 473707335
31 2 781573473
138 2 82986686
75 1 126753954
20 1 54988783
121 1 691958594
20 0 545299878
96 0 637112704
108 1 558914127
74 2 517404335
94 1 7420...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
216624184325

result:

ok 3 lines

Test #33:

score: 14
Accepted
time: 12ms
memory: 255996kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
300 2400
173 2 605122964
182 1 915124935
228 4 536218616
188 1 277682068
88 0 326709697
177 2 623496380
297 7 863327652
140 2 138423292
285 1 13632981
41 2 75649420
224 6 197471342
251 5 439508855
167 3 861142148
56 0 344701471
250 2 995027405
95 7 843229073
...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
799839985182

result:

ok 3 lines

Test #34:

score: 14
Accepted
time: 4ms
memory: 130208kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
150 800
20 3 849357409
45 6 845379514
12 6 128280695
6 6 390372289
62 6 517437842
137 7 65548858
98 6 844399946
23 1 682947100
51 7 833340178
81 3 483754945
38 0 861597575
74 7 495104215
125 0 478378570
99 3 341278360
87 3 306019744
137 5 794376023
61 4 74825...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
278622587073

result:

ok 3 lines

Test #35:

score: 14
Accepted
time: 11ms
memory: 255904kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
300 1200
166 5 652406862
230 1 936000345
267 2 246194623
232 5 771727438
276 4 469543783
248 4 348756282
8 5 940270587
20 7 744966696
289 3 202877057
262 0 170597242
80 3 501750519
99 3 204294567
212 7 64719337
274 6 476561964
282 6 850743387
69 1 192623284
1...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
450122905247

result:

ok 3 lines

Test #36:

score: 14
Accepted
time: 0ms
memory: 67844kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
75 154
1 2 287460779
25 2 196060809
23 0 435177402
4 1 312603731
10 0 522368305
8 2 942743684
35 0 161888102
8 1 633736621
20 1 6156684
17 1 936854721
59 2 482679336
50 1 671169950
27 0 746724262
20 0 656175794
39 1 601239385
59 3 483992818
24 1 762900782
6 1...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
56941582046

result:

ok 3 lines

Test #37:

score: 14
Accepted
time: 20ms
memory: 256028kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
300 964
156 0 517686267
218 2 393391655
286 2 536894082
274 2 470679502
169 0 969490925
144 4 250311053
84 2 412144747
38 3 385325871
217 0 987737108
204 2 167393867
264 0 552098416
216 2 696657577
206 1 739807394
264 2 450201148
134 2 324063336
92 0 54295515...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
360901324355

result:

ok 3 lines

Subtask #5:

score: 0
Wrong Answer

Dependency #4:

100%
Accepted

Test #38:

score: 0
Wrong Answer
time: 12ms
memory: 256040kb

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
300 299
225 225 1
188 188 1
256 256 1
242 242 1
92 92 1
18 18 1
281 281 1
50 50 1
98 98 1
44 44 1
22 22 1
49 49 1
103 103 1
234 234 1
148 148 1
94 94 1
108 108 1
212 212 1
165 165 1
176 176 1
268 268 1
198 198 1
294 294 1
47 47 1
271 271 1
104 104 1
115 115 1...

output:

938f2698235a9ff1d1d91e23381b68bec7bed102
OK
8

result:

wrong answer 3rd lines differ - expected: '299', found: '8'

Subtask #6:

score: 0
Skipped

Dependency #5:

0%

Subtask #7:

score: 0
Runtime Error

Test #60:

score: 0
Runtime Error

input:

f785163bfcb92ce6ac387bba5d2f29a0e0f37f19
100000 99999
31026 31026 1
42940 42940 1
69303 69303 1
90350 90350 1
77507 77507 1
87126 87126 1
17988 17988 1
5146 5146 1
63023 63023 1
27776 27776 1
6136 6136 1
82557 82557 1
24904 24904 1
21667 21667 1
67271 67271 1
80294 80294 1
81145 81145 1
47144 47144 ...

output:

Unauthorized output

result:


Subtask #8:

score: 0
Skipped

Dependency #1:

0%