oj.uz

답안 #1023970

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023970 2024-07-15T10:17:36 Z Otalp 메기 농장 (IOI22_fish) C++17
100 / 100
 739 ms 249244 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pii pair<int, int>
#define ff first
#define ss second

const int MAXN = 500100;
int n, w[MAXN], m;
pii a[MAXN];

namespace B{
    unordered_map<ll, ll> d[200100];
    unordered_map<ll, ll> dp[200100];
    unordered_map<ll, ll> pref[200100];
    unordered_map<ll, ll> ddp[200100];
    vector<ll> pos[200100];
    ll suf[200100];
    ll solve(){
        for(ll i=1; i<=m; i++){
            d[a[i].ff][a[i].ss] += w[i];
        }
        for(int i=0; i<=n; i++){
            d[i][0] += 0;
            d[i][n] += 0;
        }
        for(int i=0; i<=n; i++){
            for(auto h: d[i]){
                pos[i].pb(h.ff);
            }
        }
        for(ll i=1; i<=n; i++){
            sort(pos[i].begin(), pos[i].end());
        }
        for(ll i=1; i<=n; i++){
            dp[0][i] = -1e18;
            ddp[0][i] = -1e18;
        }
        dp[0][0] = 0;
        ddp[0][0] = 0;
        for(ll i=1; i<=n; i++){
            //cout<<"_____________________\n";
            //cout<<i<<'\n';
            vector<ll> alpos;
            for(auto h: pos[i-1]) alpos.pb(h);
            for(auto h: pos[i+1]) alpos.pb(h);
            sort(alpos.begin(), alpos.end());
            int gls = 0;
            for(ll  h: pos[i]){
                ll j = h;
                pref[i][j] = pref[i][gls] + d[i][j];
                gls = j;
            }
            vector<ll> dpos;
            for(auto h: dp[i-1]){
                dpos.pb(h.ff);
            }
            sort(dpos.begin(), dpos.end());
            ll mx = -1e18;
            ll ls = pos[i].size()-1;
            for(ll h = dpos.size()-1; h>=0; h--){
                ll j = dpos[h];
                while(ls > 0 and pos[i][ls] > j) ls--;
                mx = max(mx, dp[i-1][j] + pref[i][j]);
                suf[j] = mx;
            }
            ll pddp = -1e18, pdp = -1e18;
            mx = -1e18;
            for(ll h = dpos.size()-1; h>=0; h--){
                ll j = dpos[h];
                mx = max(mx, dp[i-1][j]);
            }
            ll pls=-1, dpls=-1;
            ls = -1;
            ll lls = -1;
            for(ll j: alpos){
                //cout<<j<<' ';
                while(ls + 1 < dpos.size() and dpos[ls + 1] <= j){
                    ls += 1;
                    while(lls + 1 < pos[i-1].size() and pos[i-1][lls + 1] <= dpos[ls]) lls++;
                    pdp = max(pdp, ddp[i-1][dpos[ls]]-pref[i-1][pos[i-1][lls]]);
                }
                while(pls + 1 < pos[i].size() and pos[i][pls + 1] <= j) pls ++;
                while(dpls + 1 < pos[i-1].size() and pos[i-1][dpls + 1] <= j) dpls ++;
                ddp[i][j] = mx;
                dp[i][j] = 0;
                //if(dpls < 0){
                //    cout<<"asdas\n";
                //    cout<<j<<'\n';
                //    cout<<dpls+1<<'\n';
                //    continue;
                //}
                ddp[i][j] = max(ddp[i][j], pdp + pref[i-1][pos[i-1][dpls]]);
                dp[i][j] = ddp[i][j];
                if(dpos.size() > ls + 1) dp[i][j] = max(dp[i][j], suf[dpos[ls + 1]]-pref[i][pos[i][pls]]);
                else dp[i][j] = max(dp[i][j], suf[dpos[ls]]-pref[i][pos[i][pls]]);
                dp[i][j] = max(dp[i][j], pdp+pref[i-1][pos[i-1][dpls]]);
            }
            //cout<<'\n';
        }
        //for(ll i=1; i<=n; i++){
        //    for(ll j=0; j<=n; j++){
        //        cout<<pref[i][j]<<' ';
        //    }
        //    cout<<'\n';
        //}
        ll ans = 0;
        for(ll i=0; i<=n; i++) ans = max(ans, dp[n][i]);
        return ans;
    }
}




long long max_weights(int N, int M, vector<int> X, vector<int> Y,
                      vector<int> W) {
    
    n = N;
    m = M;
    for(int i=1; i<=m; i++){
        a[i] = {X[i-1]+1, Y[i-1]+1};
    }
    for(int i=1; i<=m; i++){
        w[i] = W[i-1];
    }
    return B::solve();
}

Compilation message

fish.cpp: In function 'long long int B::solve()':
fish.cpp:80:30: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |                 while(ls + 1 < dpos.size() and dpos[ls + 1] <= j){
      |                       ~~~~~~~^~~~~~~~~~~~~
fish.cpp:82:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |                     while(lls + 1 < pos[i-1].size() and pos[i-1][lls + 1] <= dpos[ls]) lls++;
      |                           ~~~~~~~~^~~~~~~~~~~~~~~~~
fish.cpp:85:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 while(pls + 1 < pos[i].size() and pos[i][pls + 1] <= j) pls ++;
      |                       ~~~~~~~~^~~~~~~~~~~~~~~
fish.cpp:86:32: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |                 while(dpls + 1 < pos[i-1].size() and pos[i-1][dpls + 1] <= j) dpls ++;
      |                       ~~~~~~~~~^~~~~~~~~~~~~~~~~
fish.cpp:97:32: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   97 |                 if(dpos.size() > ls + 1) dp[i][j] = max(dp[i][j], suf[dpos[ls + 1]]-pref[i][pos[i][pls]]);
      |                    ~~~~~~~~~~~~^~~~~~~~
fish.cpp:69:16: warning: unused variable 'pddp' [-Wunused-variable]
   69 |             ll pddp = -1e18, pdp = -1e18;
      |                ^~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 286 ms 148596 KB Output is correct
2 Correct 231 ms 162740 KB Output is correct
3 Correct 165 ms 141096 KB Output is correct
4 Correct 172 ms 141096 KB Output is correct
5 Correct 576 ms 249244 KB Output is correct
6 Correct 679 ms 229792 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 50268 KB Output is correct
2 Correct 374 ms 173944 KB Output is correct
3 Correct 388 ms 197916 KB Output is correct
4 Correct 285 ms 148564 KB Output is correct
5 Correct 227 ms 162740 KB Output is correct
6 Correct 16 ms 50264 KB Output is correct
7 Correct 17 ms 50264 KB Output is correct
8 Correct 17 ms 50268 KB Output is correct
9 Correct 16 ms 50364 KB Output is correct
10 Correct 220 ms 141352 KB Output is correct
11 Correct 166 ms 141112 KB Output is correct
12 Correct 251 ms 158188 KB Output is correct
13 Correct 251 ms 176284 KB Output is correct
14 Correct 274 ms 153340 KB Output is correct
15 Correct 285 ms 167212 KB Output is correct
16 Correct 267 ms 153548 KB Output is correct
17 Correct 315 ms 167244 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 213 ms 141464 KB Output is correct
2 Correct 158 ms 141204 KB Output is correct
3 Correct 215 ms 142460 KB Output is correct
4 Correct 200 ms 147752 KB Output is correct
5 Correct 287 ms 157996 KB Output is correct
6 Correct 284 ms 157996 KB Output is correct
7 Correct 332 ms 158136 KB Output is correct
8 Correct 318 ms 158120 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 50268 KB Output is correct
2 Correct 19 ms 50268 KB Output is correct
3 Correct 22 ms 50336 KB Output is correct
4 Correct 23 ms 50364 KB Output is correct
5 Correct 23 ms 50268 KB Output is correct
6 Correct 28 ms 50268 KB Output is correct
7 Correct 24 ms 50216 KB Output is correct
8 Correct 19 ms 50264 KB Output is correct
9 Correct 19 ms 50400 KB Output is correct
10 Correct 29 ms 50956 KB Output is correct
11 Correct 17 ms 50524 KB Output is correct
12 Correct 24 ms 50780 KB Output is correct
13 Correct 17 ms 50268 KB Output is correct
14 Correct 23 ms 50780 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 50268 KB Output is correct
2 Correct 19 ms 50268 KB Output is correct
3 Correct 22 ms 50336 KB Output is correct
4 Correct 23 ms 50364 KB Output is correct
5 Correct 23 ms 50268 KB Output is correct
6 Correct 28 ms 50268 KB Output is correct
7 Correct 24 ms 50216 KB Output is correct
8 Correct 19 ms 50264 KB Output is correct
9 Correct 19 ms 50400 KB Output is correct
10 Correct 29 ms 50956 KB Output is correct
11 Correct 17 ms 50524 KB Output is correct
12 Correct 24 ms 50780 KB Output is correct
13 Correct 17 ms 50268 KB Output is correct
14 Correct 23 ms 50780 KB Output is correct
15 Correct 18 ms 50520 KB Output is correct
16 Correct 20 ms 51032 KB Output is correct
17 Correct 58 ms 62548 KB Output is correct
18 Correct 55 ms 62044 KB Output is correct
19 Correct 59 ms 62260 KB Output is correct
20 Correct 54 ms 61012 KB Output is correct
21 Correct 50 ms 61012 KB Output is correct
22 Correct 90 ms 72016 KB Output is correct
23 Correct 28 ms 53588 KB Output is correct
24 Correct 48 ms 59728 KB Output is correct
25 Correct 20 ms 50780 KB Output is correct
26 Correct 28 ms 53076 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 50268 KB Output is correct
2 Correct 19 ms 50268 KB Output is correct
3 Correct 22 ms 50336 KB Output is correct
4 Correct 23 ms 50364 KB Output is correct
5 Correct 23 ms 50268 KB Output is correct
6 Correct 28 ms 50268 KB Output is correct
7 Correct 24 ms 50216 KB Output is correct
8 Correct 19 ms 50264 KB Output is correct
9 Correct 19 ms 50400 KB Output is correct
10 Correct 29 ms 50956 KB Output is correct
11 Correct 17 ms 50524 KB Output is correct
12 Correct 24 ms 50780 KB Output is correct
13 Correct 17 ms 50268 KB Output is correct
14 Correct 23 ms 50780 KB Output is correct
15 Correct 18 ms 50520 KB Output is correct
16 Correct 20 ms 51032 KB Output is correct
17 Correct 58 ms 62548 KB Output is correct
18 Correct 55 ms 62044 KB Output is correct
19 Correct 59 ms 62260 KB Output is correct
20 Correct 54 ms 61012 KB Output is correct
21 Correct 50 ms 61012 KB Output is correct
22 Correct 90 ms 72016 KB Output is correct
23 Correct 28 ms 53588 KB Output is correct
24 Correct 48 ms 59728 KB Output is correct
25 Correct 20 ms 50780 KB Output is correct
26 Correct 28 ms 53076 KB Output is correct
27 Correct 25 ms 53692 KB Output is correct
28 Correct 223 ms 107860 KB Output is correct
29 Correct 364 ms 148816 KB Output is correct
30 Correct 477 ms 154832 KB Output is correct
31 Correct 486 ms 154704 KB Output is correct
32 Correct 283 ms 125776 KB Output is correct
33 Correct 469 ms 155608 KB Output is correct
34 Correct 489 ms 155472 KB Output is correct
35 Correct 164 ms 89684 KB Output is correct
36 Correct 438 ms 149600 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 213 ms 141464 KB Output is correct
2 Correct 158 ms 141204 KB Output is correct
3 Correct 215 ms 142460 KB Output is correct
4 Correct 200 ms 147752 KB Output is correct
5 Correct 287 ms 157996 KB Output is correct
6 Correct 284 ms 157996 KB Output is correct
7 Correct 332 ms 158136 KB Output is correct
8 Correct 318 ms 158120 KB Output is correct
9 Correct 297 ms 167468 KB Output is correct
10 Correct 183 ms 111672 KB Output is correct
11 Correct 407 ms 173608 KB Output is correct
12 Correct 18 ms 50268 KB Output is correct
13 Correct 16 ms 50264 KB Output is correct
14 Correct 16 ms 50368 KB Output is correct
15 Correct 17 ms 50268 KB Output is correct
16 Correct 16 ms 50264 KB Output is correct
17 Correct 17 ms 50268 KB Output is correct
18 Correct 212 ms 141280 KB Output is correct
19 Correct 165 ms 141124 KB Output is correct
20 Correct 217 ms 141140 KB Output is correct
21 Correct 231 ms 141096 KB Output is correct
22 Correct 314 ms 166812 KB Output is correct
23 Correct 409 ms 190500 KB Output is correct
24 Correct 395 ms 193836 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 286 ms 148596 KB Output is correct
2 Correct 231 ms 162740 KB Output is correct
3 Correct 165 ms 141096 KB Output is correct
4 Correct 172 ms 141096 KB Output is correct
5 Correct 576 ms 249244 KB Output is correct
6 Correct 679 ms 229792 KB Output is correct
7 Correct 17 ms 50268 KB Output is correct
8 Correct 374 ms 173944 KB Output is correct
9 Correct 388 ms 197916 KB Output is correct
10 Correct 285 ms 148564 KB Output is correct
11 Correct 227 ms 162740 KB Output is correct
12 Correct 16 ms 50264 KB Output is correct
13 Correct 17 ms 50264 KB Output is correct
14 Correct 17 ms 50268 KB Output is correct
15 Correct 16 ms 50364 KB Output is correct
16 Correct 220 ms 141352 KB Output is correct
17 Correct 166 ms 141112 KB Output is correct
18 Correct 251 ms 158188 KB Output is correct
19 Correct 251 ms 176284 KB Output is correct
20 Correct 274 ms 153340 KB Output is correct
21 Correct 285 ms 167212 KB Output is correct
22 Correct 267 ms 153548 KB Output is correct
23 Correct 315 ms 167244 KB Output is correct
24 Correct 213 ms 141464 KB Output is correct
25 Correct 158 ms 141204 KB Output is correct
26 Correct 215 ms 142460 KB Output is correct
27 Correct 200 ms 147752 KB Output is correct
28 Correct 287 ms 157996 KB Output is correct
29 Correct 284 ms 157996 KB Output is correct
30 Correct 332 ms 158136 KB Output is correct
31 Correct 318 ms 158120 KB Output is correct
32 Correct 21 ms 50268 KB Output is correct
33 Correct 19 ms 50268 KB Output is correct
34 Correct 22 ms 50336 KB Output is correct
35 Correct 23 ms 50364 KB Output is correct
36 Correct 23 ms 50268 KB Output is correct
37 Correct 28 ms 50268 KB Output is correct
38 Correct 24 ms 50216 KB Output is correct
39 Correct 19 ms 50264 KB Output is correct
40 Correct 19 ms 50400 KB Output is correct
41 Correct 29 ms 50956 KB Output is correct
42 Correct 17 ms 50524 KB Output is correct
43 Correct 24 ms 50780 KB Output is correct
44 Correct 17 ms 50268 KB Output is correct
45 Correct 23 ms 50780 KB Output is correct
46 Correct 18 ms 50520 KB Output is correct
47 Correct 20 ms 51032 KB Output is correct
48 Correct 58 ms 62548 KB Output is correct
49 Correct 55 ms 62044 KB Output is correct
50 Correct 59 ms 62260 KB Output is correct
51 Correct 54 ms 61012 KB Output is correct
52 Correct 50 ms 61012 KB Output is correct
53 Correct 90 ms 72016 KB Output is correct
54 Correct 28 ms 53588 KB Output is correct
55 Correct 48 ms 59728 KB Output is correct
56 Correct 20 ms 50780 KB Output is correct
57 Correct 28 ms 53076 KB Output is correct
58 Correct 25 ms 53692 KB Output is correct
59 Correct 223 ms 107860 KB Output is correct
60 Correct 364 ms 148816 KB Output is correct
61 Correct 477 ms 154832 KB Output is correct
62 Correct 486 ms 154704 KB Output is correct
63 Correct 283 ms 125776 KB Output is correct
64 Correct 469 ms 155608 KB Output is correct
65 Correct 489 ms 155472 KB Output is correct
66 Correct 164 ms 89684 KB Output is correct
67 Correct 438 ms 149600 KB Output is correct
68 Correct 297 ms 167468 KB Output is correct
69 Correct 183 ms 111672 KB Output is correct
70 Correct 407 ms 173608 KB Output is correct
71 Correct 18 ms 50268 KB Output is correct
72 Correct 16 ms 50264 KB Output is correct
73 Correct 16 ms 50368 KB Output is correct
74 Correct 17 ms 50268 KB Output is correct
75 Correct 16 ms 50264 KB Output is correct
76 Correct 17 ms 50268 KB Output is correct
77 Correct 212 ms 141280 KB Output is correct
78 Correct 165 ms 141124 KB Output is correct
79 Correct 217 ms 141140 KB Output is correct
80 Correct 231 ms 141096 KB Output is correct
81 Correct 314 ms 166812 KB Output is correct
82 Correct 409 ms 190500 KB Output is correct
83 Correct 395 ms 193836 KB Output is correct
84 Correct 670 ms 232572 KB Output is correct
85 Correct 739 ms 237788 KB Output is correct
86 Correct 536 ms 217720 KB Output is correct
87 Correct 596 ms 226740 KB Output is correct
88 Correct 20 ms 50264 KB Output is correct
89 Correct 603 ms 226604 KB Output is correct
90 Correct 540 ms 225576 KB Output is correct
91 Correct 584 ms 212352 KB Output is correct