QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#44351 | #4561. Catfish Farm | chestizcy | 0 | 79ms | 25676kb | C++17 | 1.7kb | 2022-08-16 10:56:55 | 2022-08-16 10:56:57 |
Judging History
answer
#include<bits/stdc++.h>
#include "fish.h"
#define pb push_back
#define SZ(x) ((int)((x).size()))
const int N=100005;typedef std::pair<int,int> pi;
template <typename _Tp>inline void chmax(_Tp &a,const _Tp &b){a=a<b?b:a;}
std::vector<pi> vec[N];std::vector<int> f[N][2];int pre1[N],pre2[N];
long long max_weights(int n,int m,std::vector<int> X,std::vector<int> Y,std::vector<int> W){
for(int i=0;i<m;++i)vec[X[i]].pb({Y[i],W[i]});
for(int i=0;i<n;++i){
vec[i].pb({n,0}),std::sort(vec[i].begin(),vec[i].end());
if(vec[i][0].first!=0)vec[i].insert(vec[i].begin(),(pi){0,0});
}
for(int i=0;i<n;++i)f[i][0].resize(SZ(vec[i])),f[i][1].resize(SZ(vec[i]));
for(int i=0;i<SZ(vec[0]);++i)f[0][0][i]=0,f[0][1][i]=0;
for(int i=1;i<n;++i){
int mx=0;for(int j=0;j<SZ(vec[i-1]);++j)chmax(mx,f[i-1][1][j]);
for(int j=0;j<SZ(vec[i]);++j)chmax(f[i][0][j],mx),chmax(f[i][1][j],mx);
for(int j=1;j<SZ(vec[i]);++j)pre2[j]=pre2[j-1]+vec[i][j-1].second;
for(int j=1,p=0,s=0;j<SZ(vec[i-1]);++j){
while(p<SZ(vec[i])&&vec[i][p].first<vec[i-1][j].first)s+=vec[i][p++].second;
pre1[j]=s;
}
mx=0;for(int j=0;j<SZ(vec[i-1]);++j)chmax(mx,f[i-1][1][j]+pre1[j]);
for(int j=1;j<SZ(vec[i]);++j)chmax(f[i][1][j],mx-pre2[j]);
for(int j=1;j<SZ(vec[i-1]);++j)pre1[j]=pre1[j-1]+vec[i-1][j-1].second;
for(int j=1,p=0,s=0;j<SZ(vec[i]);++j){
while(p<SZ(vec[i-1])&&vec[i-1][p].first<vec[i][j].first)s+=vec[i-1][p++].second;
pre2[j]=s;
}
mx=0;for(int j=0;j<SZ(vec[i-1]);++j)chmax(mx,f[i-1][0][j]-pre1[j]);
for(int j=0;j<SZ(vec[i]);++j)chmax(f[i][0][j],mx+pre2[j]);
}
int ans=0;for(int i=0;i<SZ(vec[n-1]);++i)ans=std::max({ans,f[n-1][0][i],f[n-1][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: 48ms
memory: 22252kb
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 2147433072
result:
wrong answer 3rd lines differ - expected: '40313272768926', found: '2147433072'
Subtask #2:
score: 0
Wrong Answer
Test #7:
score: 6
Accepted
time: 2ms
memory: 10780kb
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: 79ms
memory: 25676kb
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 2147480363
result:
wrong answer 3rd lines differ - expected: '40604614618209', found: '2147480363'
Subtask #3:
score: 0
Wrong Answer
Test #20:
score: 9
Accepted
time: 22ms
memory: 20152kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 100000 1 0 0 10082010
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 10082010
result:
ok 3 lines
Test #21:
score: -9
Wrong Answer
time: 16ms
memory: 20228kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 100000 1 99999 0 882019
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 0
result:
wrong answer 3rd lines differ - expected: '882019', found: '0'
Subtask #4:
score: 0
Wrong Answer
Test #28:
score: 14
Accepted
time: 7ms
memory: 10776kb
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: 3ms
memory: 10796kb
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: 6ms
memory: 10864kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 3 2 0 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 2
result:
ok 3 lines
Test #31:
score: -14
Wrong Answer
time: 2ms
memory: 10896kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 3 2 2 0 1 1 1 1
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 1
result:
wrong answer 3rd lines differ - expected: '2', found: '1'
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: 14
Accepted
time: 41ms
memory: 24072kb
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 99999
result:
ok 3 lines
Test #61:
score: -14
Wrong Answer
time: 49ms
memory: 18268kb
input:
f785163bfcb92ce6ac387bba5d2f29a0e0f37f19 50000 100000 43737 0 616909786 28149 1 83561192 31215 0 81425452 11831 1 127789871 33975 1 294422160 44409 1 920754334 44149 1 547214118 23078 0 749134931 39070 1 425147230 39398 1 49764337 49388 0 1922565 13827 0 24394607 45462 0 276157952 30584 0 435992379 ...
output:
938f2698235a9ff1d1d91e23381b68bec7bed102 OK 2141046148
result:
wrong answer 3rd lines differ - expected: '36454348383152', found: '2141046148'
Subtask #8:
score: 0
Skipped
Dependency #1:
0%