oj.uz

답안 #656340

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656340 2022-11-07T01:00:39 Z Lobo 메기 농장 (IOI22_fish) C++17
81 / 100
 1000 ms 263352 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define all(x) x.begin(),x.end()

const int maxn = 1e5+10;
const int inf = 1e18+10;

int n, m;
vector<vector<int>> dp[maxn];
map<int,int> pf[maxn], pfmx0[maxn], pfmx1[maxn], sfmx0[maxn];
vector<pair<int,int>> fish[maxn]; // fishs from column i
vector<int> hr[maxn]; // important heights from column i, the ones that can be chosen

long long max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    n = N;
    m = M;

    for(int i = 0; i < m; i++) {
        fish[X[i]+1].pb(mp(Y[i]+1,W[i]));
        hr[X[i]+1].pb(Y[i]);
    }

    for(int i = 0; i <= n; i++) {
        hr[i].pb(0);
        hr[i].pb(n);
        sort(all(hr[i]));
        sort(all(fish[i]));
        hr[i].erase(unique(all(hr[i])),hr[i].end());
        // Store only the relevant heights

        for(int j = 0; j < hr[i].size(); j++) {
            dp[i].pb({0,0});
        }
    }

    for(int i = 1; i <= n; i++) {
        for(auto j : hr[i-1]) pf[i][j] = 0;
        for(auto j : hr[i]) pf[i][j] = 0;
        for(auto j : hr[i+1]) pf[i][j] = 0;

        for(auto aux : fish[i]) {
            int y = aux.fr;
            int w = aux.sc;
            pf[i][y]+= w;
        }
        // Do a prefix sum on the weight of the fishs
        pf[i][0] = 0;
        for(auto it = next(pf[i].begin()); it != pf[i].end(); it++) {
            it->sc+= prev(it)->sc;
        }
    }

    // dp[i][h0][0/1] = until i, with h[i] = hr[i][h0] 
    // and it's greater/smaller tha the previous

    // dp[1][h0][0/1] = 0
    for(int h0 = 0; h0 < hr[1].size(); h0++) {
        dp[1][h0][0] = 0;
        dp[1][h0][1] = 0;
        pfmx0[1][hr[1][h0]] = max(pfmx0[1][hr[1][h0]],dp[1][h0][0]-pf[1][hr[1][h0]]);
        sfmx0[1][hr[1][h0]] = max(sfmx0[1][hr[1][h0]],dp[1][h0][0]+pf[1+1][hr[1][h0]]);
        sfmx0[1][hr[1][h0]] = max(sfmx0[1][hr[1][h0]],dp[1][h0][1]+pf[1+1][hr[1][h0]]);
    }

    for(auto j : hr[2]) {
        pfmx0[1][j] = max(pfmx0[1][j],0LL);
    }
    for(auto it = next(pfmx0[1].begin()); it != pfmx0[1].end(); it++) {
        it->sc = max(it->sc,prev(it)->sc);
    }

    for(auto j : hr[2]) {
        sfmx0[1][j] = max(sfmx0[1][j],0LL);
    }
    auto it = prev(prev(sfmx0[1].end()));
    while(true) {
        it->sc = max(it->sc,next(it)->sc);
        if(it == sfmx0[1].begin()) break;
        it = prev(it);
    }

    for(int i = 2; i <= n; i++) {
        for(int h0 = 0; h0 < hr[i].size(); h0++) {
            // It's greater than the previous
            dp[i][h0][0] = pfmx0[i-1][hr[i][h0]] + pf[i-1][hr[i][h0]];

            if(i != 2) {
                dp[i][h0][0] = max(dp[i][h0][0],pfmx1[i-2][hr[i][h0]] + pf[i-1][hr[i][h0]]);
            }

            // It's smaller than the previous
            dp[i][h0][1] = sfmx0[i-1][hr[i][h0]] - pf[i][hr[i][h0]];

            pfmx0[i][hr[i][h0]] = max(pfmx0[i][hr[i][h0]],dp[i][h0][0]-pf[i][hr[i][h0]]);
            pfmx1[i][hr[i][h0]] = max(pfmx1[i][hr[i][h0]],max(dp[i][h0][1],dp[i][h0][0]));
            sfmx0[i][hr[i][h0]] = max(sfmx0[i][hr[i][h0]],max(dp[i][h0][0],dp[i][h0][1])+pf[i+1][hr[i][h0]]);
        }

        for(auto j : hr[i+1]) {
            pfmx0[i][j] = max(pfmx0[i][j],0LL);
            sfmx0[i][j] = max(sfmx0[i][j],0LL);
        }
        for(auto it = next(pfmx0[i].begin()); it != pfmx0[i].end(); it++) {
            it->sc = max(it->sc,prev(it)->sc);
        }

        for(auto j : hr[i+2]) {
            pfmx1[i][j] = max(pfmx1[i][j],0LL);
        }
        for(auto it = next(pfmx1[i].begin()); it != pfmx1[i].end(); it++) {
            it->sc = max(it->sc,prev(it)->sc);
        }
        auto it = prev(prev(sfmx0[i].end()));
        while(true) {
            it->sc = max(it->sc,next(it)->sc);
            if(it == sfmx0[i].begin()) break;
            it = prev(it);
        }
    }

    int ans = 0;
    for(int h0 = 0; h0 < hr[n].size(); h0++) {
        ans = max(ans, dp[n][h0][0]);
        ans = max(ans, dp[n][h0][1]);
    }
    return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:37:26: 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]
   37 |         for(int j = 0; j < hr[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~
fish.cpp:63:24: 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]
   63 |     for(int h0 = 0; h0 < hr[1].size(); h0++) {
      |                     ~~~^~~~~~~~~~~~~~
fish.cpp:89:28: 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]
   89 |         for(int h0 = 0; h0 < hr[i].size(); h0++) {
      |                         ~~~^~~~~~~~~~~~~~
fish.cpp:128:24: 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]
  128 |     for(int h0 = 0; h0 < hr[n].size(); h0++) {
      |                     ~~~^~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 114236 KB Output is correct
2 Correct 335 ms 127116 KB Output is correct
3 Correct 112 ms 91760 KB Output is correct
4 Correct 110 ms 91860 KB Output is correct
5 Execution timed out 1101 ms 263352 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 26068 KB Output is correct
2 Correct 542 ms 144436 KB Output is correct
3 Correct 668 ms 162412 KB Output is correct
4 Correct 293 ms 114244 KB Output is correct
5 Correct 331 ms 127124 KB Output is correct
6 Correct 13 ms 26068 KB Output is correct
7 Correct 14 ms 26068 KB Output is correct
8 Correct 14 ms 26112 KB Output is correct
9 Correct 14 ms 26064 KB Output is correct
10 Correct 129 ms 91940 KB Output is correct
11 Correct 134 ms 91860 KB Output is correct
12 Correct 428 ms 134592 KB Output is correct
13 Correct 519 ms 152156 KB Output is correct
14 Correct 343 ms 124428 KB Output is correct
15 Correct 334 ms 124932 KB Output is correct
16 Correct 327 ms 124720 KB Output is correct
17 Correct 368 ms 135564 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 91928 KB Output is correct
2 Correct 114 ms 91800 KB Output is correct
3 Correct 150 ms 92424 KB Output is correct
4 Correct 140 ms 96584 KB Output is correct
5 Correct 197 ms 105168 KB Output is correct
6 Correct 188 ms 105104 KB Output is correct
7 Correct 200 ms 105136 KB Output is correct
8 Correct 197 ms 105200 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 26088 KB Output is correct
2 Correct 12 ms 26068 KB Output is correct
3 Correct 12 ms 26140 KB Output is correct
4 Correct 13 ms 26012 KB Output is correct
5 Correct 12 ms 26080 KB Output is correct
6 Correct 12 ms 26140 KB Output is correct
7 Correct 12 ms 26140 KB Output is correct
8 Correct 12 ms 26136 KB Output is correct
9 Correct 13 ms 26316 KB Output is correct
10 Correct 15 ms 27100 KB Output is correct
11 Correct 13 ms 26452 KB Output is correct
12 Correct 14 ms 26836 KB Output is correct
13 Correct 13 ms 26196 KB Output is correct
14 Correct 14 ms 26580 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 26088 KB Output is correct
2 Correct 12 ms 26068 KB Output is correct
3 Correct 12 ms 26140 KB Output is correct
4 Correct 13 ms 26012 KB Output is correct
5 Correct 12 ms 26080 KB Output is correct
6 Correct 12 ms 26140 KB Output is correct
7 Correct 12 ms 26140 KB Output is correct
8 Correct 12 ms 26136 KB Output is correct
9 Correct 13 ms 26316 KB Output is correct
10 Correct 15 ms 27100 KB Output is correct
11 Correct 13 ms 26452 KB Output is correct
12 Correct 14 ms 26836 KB Output is correct
13 Correct 13 ms 26196 KB Output is correct
14 Correct 14 ms 26580 KB Output is correct
15 Correct 15 ms 26416 KB Output is correct
16 Correct 17 ms 27040 KB Output is correct
17 Correct 103 ms 45644 KB Output is correct
18 Correct 106 ms 45232 KB Output is correct
19 Correct 89 ms 45192 KB Output is correct
20 Correct 84 ms 43736 KB Output is correct
21 Correct 84 ms 43580 KB Output is correct
22 Correct 169 ms 60588 KB Output is correct
23 Correct 36 ms 32460 KB Output is correct
24 Correct 84 ms 43636 KB Output is correct
25 Correct 15 ms 26964 KB Output is correct
26 Correct 31 ms 31612 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 26088 KB Output is correct
2 Correct 12 ms 26068 KB Output is correct
3 Correct 12 ms 26140 KB Output is correct
4 Correct 13 ms 26012 KB Output is correct
5 Correct 12 ms 26080 KB Output is correct
6 Correct 12 ms 26140 KB Output is correct
7 Correct 12 ms 26140 KB Output is correct
8 Correct 12 ms 26136 KB Output is correct
9 Correct 13 ms 26316 KB Output is correct
10 Correct 15 ms 27100 KB Output is correct
11 Correct 13 ms 26452 KB Output is correct
12 Correct 14 ms 26836 KB Output is correct
13 Correct 13 ms 26196 KB Output is correct
14 Correct 14 ms 26580 KB Output is correct
15 Correct 15 ms 26416 KB Output is correct
16 Correct 17 ms 27040 KB Output is correct
17 Correct 103 ms 45644 KB Output is correct
18 Correct 106 ms 45232 KB Output is correct
19 Correct 89 ms 45192 KB Output is correct
20 Correct 84 ms 43736 KB Output is correct
21 Correct 84 ms 43580 KB Output is correct
22 Correct 169 ms 60588 KB Output is correct
23 Correct 36 ms 32460 KB Output is correct
24 Correct 84 ms 43636 KB Output is correct
25 Correct 15 ms 26964 KB Output is correct
26 Correct 31 ms 31612 KB Output is correct
27 Correct 22 ms 30164 KB Output is correct
28 Correct 476 ms 118840 KB Output is correct
29 Correct 755 ms 172164 KB Output is correct
30 Correct 838 ms 240472 KB Output is correct
31 Correct 828 ms 239304 KB Output is correct
32 Correct 554 ms 138592 KB Output is correct
33 Correct 847 ms 244816 KB Output is correct
34 Correct 826 ms 244820 KB Output is correct
35 Correct 287 ms 97488 KB Output is correct
36 Correct 785 ms 222924 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 91928 KB Output is correct
2 Correct 114 ms 91800 KB Output is correct
3 Correct 150 ms 92424 KB Output is correct
4 Correct 140 ms 96584 KB Output is correct
5 Correct 197 ms 105168 KB Output is correct
6 Correct 188 ms 105104 KB Output is correct
7 Correct 200 ms 105136 KB Output is correct
8 Correct 197 ms 105200 KB Output is correct
9 Correct 329 ms 163020 KB Output is correct
10 Correct 164 ms 84044 KB Output is correct
11 Correct 357 ms 141968 KB Output is correct
12 Correct 13 ms 26108 KB Output is correct
13 Correct 13 ms 26068 KB Output is correct
14 Correct 14 ms 26136 KB Output is correct
15 Correct 14 ms 26068 KB Output is correct
16 Correct 13 ms 26068 KB Output is correct
17 Correct 13 ms 26024 KB Output is correct
18 Correct 111 ms 91864 KB Output is correct
19 Correct 118 ms 91856 KB Output is correct
20 Correct 114 ms 91864 KB Output is correct
21 Correct 111 ms 91944 KB Output is correct
22 Correct 383 ms 166552 KB Output is correct
23 Correct 475 ms 195136 KB Output is correct
24 Correct 479 ms 201552 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 114236 KB Output is correct
2 Correct 335 ms 127116 KB Output is correct
3 Correct 112 ms 91760 KB Output is correct
4 Correct 110 ms 91860 KB Output is correct
5 Execution timed out 1101 ms 263352 KB Time limit exceeded
6 Halted 0 ms 0 KB -