QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#43890 | #4561. Catfish Farm | 8192379812# | 0 | 21ms | 149688kb | C++11 | 980b | 2022-08-11 15:12:15 | 2024-05-26 01:04:13 |
Judging History
answer
#include "fish.h"
#include <bits/stdc++.h>
typedef long long ll;
void Max(ll &x,ll y){if(x<y)x=y;}
ll max_weights(int n,int m,std::vector<int> X,std::vector<int> Y,std::vector<int> W)
{
if(n>3000)
return 0;
constexpr int NN(3003);
static ll sum[NN][NN];
for(int i(0);i<m;++i)
sum[X[i]+1][Y[i]+1]+=W[i];
for(int i(1);i<=n;++i)
for(int j(1);j<=n;++j)
sum[i][j]+=sum[i][j-1];
static ll dp[NN][2][NN];
memset(dp,0xc0,sizeof(dp));
dp[0][0][0]=0;
for(int i(1);i<=n;++i)
{
Max(dp[i][0][0],dp[i-1][0][0]);
Max(dp[i][0][0],dp[i-1][1][0]);
for(int j(1);j<=n;++j)
{
for(int k(0);k<=j;++k)
Max(dp[i][0][j],dp[i-1][0][k]+sum[i-1][j]-sum[i-1][k]);
}
for(int j(0);j<=n;++j)
for(int k(j);k<=n;++k)
Max(dp[i][1][j],dp[i-1][1][k]+sum[i][k]-sum[i][j]);
for(int j(1);j<=n;++j)
Max(dp[i][1][j],dp[i][0][j]);
}
ll ans(0);
for(int i(0);i<=n;++i)
Max(ans,dp[n][0][i]),Max(ans,dp[n][1][i]);
return ans;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 8ms
memory: 5024kb
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:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 0
result:
wrong answer 3rd lines differ - expected: '40313272768926', found: '0'
Subtask #2:
score: 0
Wrong Answer
Test #7:
score: 6
Accepted
time: 0ms
memory: 145852kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 3 2 0 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 2
result:
ok 3 lines
Test #8:
score: -6
Wrong Answer
time: 21ms
memory: 7168kb
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:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 0
result:
wrong answer 3rd lines differ - expected: '40604614618209', found: '0'
Subtask #3:
score: 0
Wrong Answer
Test #20:
score: 0
Wrong Answer
time: 0ms
memory: 3724kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 100000 1 0 0 10082010
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 0
result:
wrong answer 3rd lines differ - expected: '10082010', found: '0'
Subtask #4:
score: 0
Wrong Answer
Test #28:
score: 14
Accepted
time: 4ms
memory: 144900kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 4 3 2 2 1 0 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 3
result:
ok 3 lines
Test #29:
score: 0
Accepted
time: 0ms
memory: 146548kb
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: 0
Accepted
time: 9ms
memory: 145388kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 3 2 0 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 2
result:
ok 3 lines
Test #31:
score: 0
Accepted
time: 8ms
memory: 146472kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 3 2 2 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 2
result:
ok 3 lines
Test #32:
score: -14
Wrong Answer
time: 4ms
memory: 149688kb
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 214837477243
result:
wrong answer 3rd lines differ - expected: '216624184325', found: '214837477243'
Subtask #5:
score: 0
Skipped
Dependency #4:
0%
Subtask #6:
score: 0
Skipped
Dependency #5:
0%
Subtask #7:
score: 0
Wrong Answer
Test #60:
score: 0
Wrong Answer
time: 13ms
memory: 5596kb
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:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 0
result:
wrong answer 3rd lines differ - expected: '99999', found: '0'
Subtask #8:
score: 0
Skipped
Dependency #1:
0%