oj.uz

답안 #656345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
656345 2022-11-07T01:18:08 Z Lobo 메기 농장 (IOI22_fish) C++17
81 / 100
 1000 ms 258812 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3","unroll-loops")
// #define int long long
#define ll 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<ll>> dp[maxn];
map<int,ll> 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
            auto it = prev(upper_bound(all(hr[i-1]),hr[i][h0]));
            dp[i][h0][0] = pfmx0[i-1][*it] + pf[i-1][hr[i][h0]];

            if(i != 2) {
                it = prev(upper_bound(all(hr[i-2]),hr[i][h0]));
                dp[i][h0][0] = max(dp[i][h0][0],pfmx1[i-2][*it] + 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);
        }
    }

    ll 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:39:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int j = 0; j < hr[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~~
fish.cpp:65:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int h0 = 0; h0 < hr[1].size(); h0++) {
      |                     ~~~^~~~~~~~~~~~~~
fish.cpp:91:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for(int h0 = 0; h0 < hr[i].size(); h0++) {
      |                         ~~~^~~~~~~~~~~~~~
fish.cpp:132:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  132 |     for(int h0 = 0; h0 < hr[n].size(); h0++) {
      |                     ~~~^~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 113336 KB Output is correct
2 Correct 379 ms 125940 KB Output is correct
3 Correct 114 ms 91868 KB Output is correct
4 Correct 111 ms 91868 KB Output is correct
5 Execution timed out 1099 ms 258812 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 26068 KB Output is correct
2 Correct 557 ms 142612 KB Output is correct
3 Correct 676 ms 160048 KB Output is correct
4 Correct 280 ms 113312 KB Output is correct
5 Correct 335 ms 125868 KB Output is correct
6 Correct 13 ms 26080 KB Output is correct
7 Correct 14 ms 26052 KB Output is correct
8 Correct 16 ms 26076 KB Output is correct
9 Correct 13 ms 26068 KB Output is correct
10 Correct 109 ms 91944 KB Output is correct
11 Correct 111 ms 91852 KB Output is correct
12 Correct 400 ms 133728 KB Output is correct
13 Correct 511 ms 150968 KB Output is correct
14 Correct 334 ms 123516 KB Output is correct
15 Correct 355 ms 123772 KB Output is correct
16 Correct 330 ms 123612 KB Output is correct
17 Correct 365 ms 134292 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 91828 KB Output is correct
2 Correct 114 ms 91800 KB Output is correct
3 Correct 148 ms 91524 KB Output is correct
4 Correct 142 ms 96072 KB Output is correct
5 Correct 197 ms 103604 KB Output is correct
6 Correct 191 ms 103600 KB Output is correct
7 Correct 191 ms 103564 KB Output is correct
8 Correct 199 ms 103704 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 26144 KB Output is correct
2 Correct 13 ms 26068 KB Output is correct
3 Correct 14 ms 26104 KB Output is correct
4 Correct 12 ms 26068 KB Output is correct
5 Correct 13 ms 26096 KB Output is correct
6 Correct 12 ms 26088 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 13 ms 26068 KB Output is correct
9 Correct 17 ms 26296 KB Output is correct
10 Correct 16 ms 27056 KB Output is correct
11 Correct 17 ms 26452 KB Output is correct
12 Correct 15 ms 26836 KB Output is correct
13 Correct 16 ms 26144 KB Output is correct
14 Correct 14 ms 26540 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 26144 KB Output is correct
2 Correct 13 ms 26068 KB Output is correct
3 Correct 14 ms 26104 KB Output is correct
4 Correct 12 ms 26068 KB Output is correct
5 Correct 13 ms 26096 KB Output is correct
6 Correct 12 ms 26088 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 13 ms 26068 KB Output is correct
9 Correct 17 ms 26296 KB Output is correct
10 Correct 16 ms 27056 KB Output is correct
11 Correct 17 ms 26452 KB Output is correct
12 Correct 15 ms 26836 KB Output is correct
13 Correct 16 ms 26144 KB Output is correct
14 Correct 14 ms 26540 KB Output is correct
15 Correct 13 ms 26452 KB Output is correct
16 Correct 17 ms 27076 KB Output is correct
17 Correct 97 ms 44496 KB Output is correct
18 Correct 113 ms 43816 KB Output is correct
19 Correct 93 ms 44064 KB Output is correct
20 Correct 85 ms 42816 KB Output is correct
21 Correct 85 ms 42652 KB Output is correct
22 Correct 175 ms 58792 KB Output is correct
23 Correct 34 ms 31820 KB Output is correct
24 Correct 79 ms 41876 KB Output is correct
25 Correct 15 ms 26932 KB Output is correct
26 Correct 31 ms 31076 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 26144 KB Output is correct
2 Correct 13 ms 26068 KB Output is correct
3 Correct 14 ms 26104 KB Output is correct
4 Correct 12 ms 26068 KB Output is correct
5 Correct 13 ms 26096 KB Output is correct
6 Correct 12 ms 26088 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 13 ms 26068 KB Output is correct
9 Correct 17 ms 26296 KB Output is correct
10 Correct 16 ms 27056 KB Output is correct
11 Correct 17 ms 26452 KB Output is correct
12 Correct 15 ms 26836 KB Output is correct
13 Correct 16 ms 26144 KB Output is correct
14 Correct 14 ms 26540 KB Output is correct
15 Correct 13 ms 26452 KB Output is correct
16 Correct 17 ms 27076 KB Output is correct
17 Correct 97 ms 44496 KB Output is correct
18 Correct 113 ms 43816 KB Output is correct
19 Correct 93 ms 44064 KB Output is correct
20 Correct 85 ms 42816 KB Output is correct
21 Correct 85 ms 42652 KB Output is correct
22 Correct 175 ms 58792 KB Output is correct
23 Correct 34 ms 31820 KB Output is correct
24 Correct 79 ms 41876 KB Output is correct
25 Correct 15 ms 26932 KB Output is correct
26 Correct 31 ms 31076 KB Output is correct
27 Correct 20 ms 29884 KB Output is correct
28 Correct 516 ms 112504 KB Output is correct
29 Correct 778 ms 160964 KB Output is correct
30 Correct 832 ms 218452 KB Output is correct
31 Correct 795 ms 217308 KB Output is correct
32 Correct 587 ms 133516 KB Output is correct
33 Correct 795 ms 222028 KB Output is correct
34 Correct 781 ms 222096 KB Output is correct
35 Correct 284 ms 90572 KB Output is correct
36 Correct 794 ms 202140 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 91828 KB Output is correct
2 Correct 114 ms 91800 KB Output is correct
3 Correct 148 ms 91524 KB Output is correct
4 Correct 142 ms 96072 KB Output is correct
5 Correct 197 ms 103604 KB Output is correct
6 Correct 191 ms 103600 KB Output is correct
7 Correct 191 ms 103564 KB Output is correct
8 Correct 199 ms 103704 KB Output is correct
9 Correct 324 ms 155188 KB Output is correct
10 Correct 157 ms 82436 KB Output is correct
11 Correct 327 ms 138836 KB Output is correct
12 Correct 13 ms 26080 KB Output is correct
13 Correct 13 ms 26068 KB Output is correct
14 Correct 13 ms 26068 KB Output is correct
15 Correct 14 ms 26072 KB Output is correct
16 Correct 12 ms 26068 KB Output is correct
17 Correct 12 ms 26068 KB Output is correct
18 Correct 125 ms 91808 KB Output is correct
19 Correct 119 ms 91944 KB Output is correct
20 Correct 113 ms 91988 KB Output is correct
21 Correct 111 ms 91860 KB Output is correct
22 Correct 351 ms 158652 KB Output is correct
23 Correct 430 ms 186060 KB Output is correct
24 Correct 454 ms 192120 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 113336 KB Output is correct
2 Correct 379 ms 125940 KB Output is correct
3 Correct 114 ms 91868 KB Output is correct
4 Correct 111 ms 91868 KB Output is correct
5 Execution timed out 1099 ms 258812 KB Time limit exceeded
6 Halted 0 ms 0 KB -