oj.uz

답안 #1070931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070931 2024-08-22T21:04:46 Z beaconmc 메기 농장 (IOI22_fish) C++17
100 / 100
 877 ms 281560 KB 
    // #pragma GCC optimize("O3,unroll-loops")
    // #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
    #include "fish.h"
     
    #include <bits/stdc++.h>
    using namespace std;
     
    typedef long long ll;
    #define FOR(i,x,y) for(ll i=x; i<y; i++)
    #define FORNEG(i,x,y) for(ll i=x; i>y; i--)
     
    const ll maxn = 100005;
     
     
    basic_string<ll> realheights[maxn];
     
    unordered_map<ll, ll> weights;
     
    basic_string<ll> p[maxn];
     
    basic_string<array<ll,2>>  dp[maxn];
     
    basic_string<ll> pref[maxn][2];
    basic_string<ll> pref2[maxn][2];
    basic_string<ll> suff[maxn][2];
     
     
    long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                          std::vector<int> W) {
     
        weights.reserve(2097152);
        weights.max_load_factor(0.25);
        FOR(i,0,M){
            Y[i]++;
            weights[X[i]*(ll)100000000+Y[i]] = W[i];
     
            realheights[X[i]].push_back(Y[i]);
            realheights[X[i]+1].push_back(Y[i]);
            realheights[X[i]+2].push_back(Y[i]);
        }
        FOR(i,0,maxn) realheights[i].push_back(0);
        FOR(i,0,maxn) realheights[i].push_back(maxn);
     
        FOR(i,0,maxn){
            sort(realheights[i].begin(), realheights[i].end());
            auto it = unique(realheights[i].begin(), realheights[i].end());
            realheights[i].resize(it-realheights[i].begin());
            sort(realheights[i].begin(), realheights[i].end());
        }
     
        FOR(i,0,maxn){
            FOR(k,0,2){
                pref[i][k].resize(realheights[i].size());
                pref2[i][k].resize(realheights[i].size());
                suff[i][k].resize(realheights[i].size());
            }
            p[i].resize(realheights[i].size());
            dp[i].resize(realheights[i].size());
        }
     
     
     
     
        FOR(i,0,maxn){
            p[i][0] = 0;
            ll prev = 0;
            FOR(j,1,realheights[i].size()){
                p[i][j] = p[i][j-1] + weights[i*(ll)100000000+realheights[i][j]];
            }
        }
     
     
     
        FOR(i,1,N+1){
     
            FOR(X,0,dp[i].size()){
                ll j = realheights[i][X];
                FOR(k,0,2){
     
     
                    if (i<2) continue;
                    ll temp = 0;
                    ll add = 0;
                    if (k==0){
                        if (X==dp[i].size()-1) continue;
                        ll down = upper_bound(realheights[i-1].begin(), realheights[i-1].end(), j) - realheights[i-1].begin() - 1;
     
                        temp = max(temp, suff[i-1][0][down] - p[i-1][down]);
                        temp = max(temp, suff[i-1][1][down] - p[i-1][down]);
     
                        // FOR(p,j+1,N+1){
                        //     if (fish[i-1][p]) add += weights[i-1][p];
                        //     temp = max(temp, dp[i-1][p][0] + add);
                        //     temp = max(temp, dp[i-1][p][1] + add);
                        // }
                    }
                    else{
                        ll down = upper_bound(realheights[i-1].begin(), realheights[i-1].end(), j) - realheights[i-1].begin() - 1;
                        ll down2 = upper_bound(realheights[i-2].begin(), realheights[i-2].end(), j) - realheights[i-2].begin() - 1;
     
     
                        temp = max(temp, pref[i-1][0][down]);
                        temp = max(temp, pref[i-1][1][down] + p[i-2][down2]);
     
                        // FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
                        // FOR(p,0,j+1){
                        //     if (fish[i-2][p]) add -= weights[i-2][p];
                        //     temp = max(temp, dp[i-1][p][0]);
                        //     temp = max(temp, dp[i-1][p][1] + add);
                        // }
                    }
     
     
                    dp[i][X][k] = temp;
                }
            }
            ll sz = realheights[i].size();
     
            FOR(k,0,2){
                ll tempadd = 0;
                ll tempadd2 = 0;
     
     
                FOR(j,0,sz){
                    tempadd += weights[i*(ll)100000000+realheights[i][j]];
                    suff[i][k][j] = dp[i][j][k]+tempadd;
                }
     
                FOR(j,0,sz){
                    tempadd2 -= weights[(i-1)*(ll)100000000+realheights[i][j]];
                    pref[i][k][j] = dp[i][j][k] + tempadd2;
                    pref2[i][k][j] = dp[i][j][k];
                }
                ll prev = 0;
                FOR(j,1,sz){
                    pref[i][k][j] = max(pref[i][k][j], pref[i][k][j-1]);
                    pref2[i][k][j] = max(pref2[i][k][j], pref2[i][k][j-1]);
     
                }
     
                FORNEG(j,sz-2,-1){
                    suff[i][k][j] = max(suff[i][k][j], suff[i][k][j+1]);
     
     
                }
     
            }
            // cout << i << endl;
            // cout << suff[2][2][0] << "FUCK" << endl;
     
        }
     
     
     
     
     
     
        ll ans = 0;
     
        FOR(i,0,N+1){
            FOR(j,0,dp[i].size()){
                ans = max(dp[i][j][0], ans);
                ans = max(dp[i][j][1], ans);
            }
        }
        return ans;
     
     
     
     
     
     
    }

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:9:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   67 |             FOR(j,1,realheights[i].size()){
      |                 ~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:67:13: note: in expansion of macro 'FOR'
   67 |             FOR(j,1,realheights[i].size()){
      |             ^~~
fish.cpp:66:16: warning: unused variable 'prev' [-Wunused-variable]
   66 |             ll prev = 0;
      |                ^~~~
fish.cpp:9:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   76 |             FOR(X,0,dp[i].size()){
      |                 ~~~~~~~~~~~~~~~~     
fish.cpp:76:13: note: in expansion of macro 'FOR'
   76 |             FOR(X,0,dp[i].size()){
      |             ^~~
fish.cpp:85:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                         if (X==dp[i].size()-1) continue;
      |                             ~^~~~~~~~~~~~~~~~
fish.cpp:83:24: warning: unused variable 'add' [-Wunused-variable]
   83 |                     ll add = 0;
      |                        ^~~
fish.cpp:134:20: warning: unused variable 'prev' [-Wunused-variable]
  134 |                 ll prev = 0;
      |                    ^~~~
fish.cpp:9:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
  161 |             FOR(j,0,dp[i].size()){
      |                 ~~~~~~~~~~~~~~~~     
fish.cpp:161:13: note: in expansion of macro 'FOR'
  161 |             FOR(j,0,dp[i].size()){
      |             ^~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 110896 KB Output is correct
2 Correct 183 ms 118068 KB Output is correct
3 Correct 88 ms 82768 KB Output is correct
4 Correct 90 ms 82768 KB Output is correct
5 Correct 488 ms 274812 KB Output is correct
6 Correct 852 ms 281048 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 69 ms 79768 KB Output is correct
2 Correct 248 ms 159144 KB Output is correct
3 Correct 289 ms 165160 KB Output is correct
4 Correct 168 ms 110952 KB Output is correct
5 Correct 186 ms 118064 KB Output is correct
6 Correct 60 ms 79700 KB Output is correct
7 Correct 64 ms 79696 KB Output is correct
8 Correct 72 ms 79700 KB Output is correct
9 Correct 65 ms 79700 KB Output is correct
10 Correct 93 ms 82852 KB Output is correct
11 Correct 91 ms 82948 KB Output is correct
12 Correct 175 ms 113788 KB Output is correct
13 Correct 252 ms 153396 KB Output is correct
14 Correct 180 ms 112512 KB Output is correct
15 Correct 185 ms 106416 KB Output is correct
16 Correct 186 ms 112560 KB Output is correct
17 Correct 206 ms 115896 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 82864 KB Output is correct
2 Correct 87 ms 82768 KB Output is correct
3 Correct 130 ms 95652 KB Output is correct
4 Correct 127 ms 92504 KB Output is correct
5 Correct 161 ms 105824 KB Output is correct
6 Correct 174 ms 105816 KB Output is correct
7 Correct 193 ms 105752 KB Output is correct
8 Correct 169 ms 105808 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 79696 KB Output is correct
2 Correct 80 ms 79708 KB Output is correct
3 Correct 65 ms 79700 KB Output is correct
4 Correct 58 ms 79632 KB Output is correct
5 Correct 73 ms 79592 KB Output is correct
6 Correct 63 ms 79696 KB Output is correct
7 Correct 60 ms 79696 KB Output is correct
8 Correct 64 ms 79728 KB Output is correct
9 Correct 65 ms 79696 KB Output is correct
10 Correct 59 ms 80208 KB Output is correct
11 Correct 65 ms 79952 KB Output is correct
12 Correct 64 ms 79956 KB Output is correct
13 Correct 68 ms 79652 KB Output is correct
14 Correct 65 ms 79956 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 79696 KB Output is correct
2 Correct 80 ms 79708 KB Output is correct
3 Correct 65 ms 79700 KB Output is correct
4 Correct 58 ms 79632 KB Output is correct
5 Correct 73 ms 79592 KB Output is correct
6 Correct 63 ms 79696 KB Output is correct
7 Correct 60 ms 79696 KB Output is correct
8 Correct 64 ms 79728 KB Output is correct
9 Correct 65 ms 79696 KB Output is correct
10 Correct 59 ms 80208 KB Output is correct
11 Correct 65 ms 79952 KB Output is correct
12 Correct 64 ms 79956 KB Output is correct
13 Correct 68 ms 79652 KB Output is correct
14 Correct 65 ms 79956 KB Output is correct
15 Correct 72 ms 79860 KB Output is correct
16 Correct 76 ms 80208 KB Output is correct
17 Correct 100 ms 88656 KB Output is correct
18 Correct 99 ms 87428 KB Output is correct
19 Correct 107 ms 87632 KB Output is correct
20 Correct 101 ms 86864 KB Output is correct
21 Correct 96 ms 86608 KB Output is correct
22 Correct 119 ms 93524 KB Output is correct
23 Correct 90 ms 83136 KB Output is correct
24 Correct 104 ms 88348 KB Output is correct
25 Correct 64 ms 79952 KB Output is correct
26 Correct 77 ms 82512 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 79696 KB Output is correct
2 Correct 80 ms 79708 KB Output is correct
3 Correct 65 ms 79700 KB Output is correct
4 Correct 58 ms 79632 KB Output is correct
5 Correct 73 ms 79592 KB Output is correct
6 Correct 63 ms 79696 KB Output is correct
7 Correct 60 ms 79696 KB Output is correct
8 Correct 64 ms 79728 KB Output is correct
9 Correct 65 ms 79696 KB Output is correct
10 Correct 59 ms 80208 KB Output is correct
11 Correct 65 ms 79952 KB Output is correct
12 Correct 64 ms 79956 KB Output is correct
13 Correct 68 ms 79652 KB Output is correct
14 Correct 65 ms 79956 KB Output is correct
15 Correct 72 ms 79860 KB Output is correct
16 Correct 76 ms 80208 KB Output is correct
17 Correct 100 ms 88656 KB Output is correct
18 Correct 99 ms 87428 KB Output is correct
19 Correct 107 ms 87632 KB Output is correct
20 Correct 101 ms 86864 KB Output is correct
21 Correct 96 ms 86608 KB Output is correct
22 Correct 119 ms 93524 KB Output is correct
23 Correct 90 ms 83136 KB Output is correct
24 Correct 104 ms 88348 KB Output is correct
25 Correct 64 ms 79952 KB Output is correct
26 Correct 77 ms 82512 KB Output is correct
27 Correct 69 ms 81236 KB Output is correct
28 Correct 217 ms 118356 KB Output is correct
29 Correct 356 ms 177040 KB Output is correct
30 Correct 535 ms 276524 KB Output is correct
31 Correct 500 ms 275924 KB Output is correct
32 Correct 237 ms 126288 KB Output is correct
33 Correct 546 ms 277720 KB Output is correct
34 Correct 552 ms 277912 KB Output is correct
35 Correct 171 ms 113748 KB Output is correct
36 Correct 383 ms 195408 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 82864 KB Output is correct
2 Correct 87 ms 82768 KB Output is correct
3 Correct 130 ms 95652 KB Output is correct
4 Correct 127 ms 92504 KB Output is correct
5 Correct 161 ms 105824 KB Output is correct
6 Correct 174 ms 105816 KB Output is correct
7 Correct 193 ms 105752 KB Output is correct
8 Correct 169 ms 105808 KB Output is correct
9 Correct 267 ms 161364 KB Output is correct
10 Correct 143 ms 96596 KB Output is correct
11 Correct 234 ms 113492 KB Output is correct
12 Correct 66 ms 79768 KB Output is correct
13 Correct 60 ms 79700 KB Output is correct
14 Correct 63 ms 79696 KB Output is correct
15 Correct 62 ms 79704 KB Output is correct
16 Correct 64 ms 79700 KB Output is correct
17 Correct 81 ms 79644 KB Output is correct
18 Correct 91 ms 82768 KB Output is correct
19 Correct 84 ms 82772 KB Output is correct
20 Correct 90 ms 82956 KB Output is correct
21 Correct 90 ms 82972 KB Output is correct
22 Correct 289 ms 157164 KB Output is correct
23 Correct 319 ms 167420 KB Output is correct
24 Correct 378 ms 168684 KB Output is correct

Subtask #8
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 159 ms 110896 KB Output is correct
2 Correct 183 ms 118068 KB Output is correct
3 Correct 88 ms 82768 KB Output is correct
4 Correct 90 ms 82768 KB Output is correct
5 Correct 488 ms 274812 KB Output is correct
6 Correct 852 ms 281048 KB Output is correct
7 Correct 69 ms 79768 KB Output is correct
8 Correct 248 ms 159144 KB Output is correct
9 Correct 289 ms 165160 KB Output is correct
10 Correct 168 ms 110952 KB Output is correct
11 Correct 186 ms 118064 KB Output is correct
12 Correct 60 ms 79700 KB Output is correct
13 Correct 64 ms 79696 KB Output is correct
14 Correct 72 ms 79700 KB Output is correct
15 Correct 65 ms 79700 KB Output is correct
16 Correct 93 ms 82852 KB Output is correct
17 Correct 91 ms 82948 KB Output is correct
18 Correct 175 ms 113788 KB Output is correct
19 Correct 252 ms 153396 KB Output is correct
20 Correct 180 ms 112512 KB Output is correct
21 Correct 185 ms 106416 KB Output is correct
22 Correct 186 ms 112560 KB Output is correct
23 Correct 206 ms 115896 KB Output is correct
24 Correct 83 ms 82864 KB Output is correct
25 Correct 87 ms 82768 KB Output is correct
26 Correct 130 ms 95652 KB Output is correct
27 Correct 127 ms 92504 KB Output is correct
28 Correct 161 ms 105824 KB Output is correct
29 Correct 174 ms 105816 KB Output is correct
30 Correct 193 ms 105752 KB Output is correct
31 Correct 169 ms 105808 KB Output is correct
32 Correct 63 ms 79696 KB Output is correct
33 Correct 80 ms 79708 KB Output is correct
34 Correct 65 ms 79700 KB Output is correct
35 Correct 58 ms 79632 KB Output is correct
36 Correct 73 ms 79592 KB Output is correct
37 Correct 63 ms 79696 KB Output is correct
38 Correct 60 ms 79696 KB Output is correct
39 Correct 64 ms 79728 KB Output is correct
40 Correct 65 ms 79696 KB Output is correct
41 Correct 59 ms 80208 KB Output is correct
42 Correct 65 ms 79952 KB Output is correct
43 Correct 64 ms 79956 KB Output is correct
44 Correct 68 ms 79652 KB Output is correct
45 Correct 65 ms 79956 KB Output is correct
46 Correct 72 ms 79860 KB Output is correct
47 Correct 76 ms 80208 KB Output is correct
48 Correct 100 ms 88656 KB Output is correct
49 Correct 99 ms 87428 KB Output is correct
50 Correct 107 ms 87632 KB Output is correct
51 Correct 101 ms 86864 KB Output is correct
52 Correct 96 ms 86608 KB Output is correct
53 Correct 119 ms 93524 KB Output is correct
54 Correct 90 ms 83136 KB Output is correct
55 Correct 104 ms 88348 KB Output is correct
56 Correct 64 ms 79952 KB Output is correct
57 Correct 77 ms 82512 KB Output is correct
58 Correct 69 ms 81236 KB Output is correct
59 Correct 217 ms 118356 KB Output is correct
60 Correct 356 ms 177040 KB Output is correct
61 Correct 535 ms 276524 KB Output is correct
62 Correct 500 ms 275924 KB Output is correct
63 Correct 237 ms 126288 KB Output is correct
64 Correct 546 ms 277720 KB Output is correct
65 Correct 552 ms 277912 KB Output is correct
66 Correct 171 ms 113748 KB Output is correct
67 Correct 383 ms 195408 KB Output is correct
68 Correct 267 ms 161364 KB Output is correct
69 Correct 143 ms 96596 KB Output is correct
70 Correct 234 ms 113492 KB Output is correct
71 Correct 66 ms 79768 KB Output is correct
72 Correct 60 ms 79700 KB Output is correct
73 Correct 63 ms 79696 KB Output is correct
74 Correct 62 ms 79704 KB Output is correct
75 Correct 64 ms 79700 KB Output is correct
76 Correct 81 ms 79644 KB Output is correct
77 Correct 91 ms 82768 KB Output is correct
78 Correct 84 ms 82772 KB Output is correct
79 Correct 90 ms 82956 KB Output is correct
80 Correct 90 ms 82972 KB Output is correct
81 Correct 289 ms 157164 KB Output is correct
82 Correct 319 ms 167420 KB Output is correct
83 Correct 378 ms 168684 KB Output is correct
84 Correct 519 ms 266644 KB Output is correct
85 Correct 539 ms 266408 KB Output is correct
86 Correct 811 ms 280336 KB Output is correct
87 Correct 877 ms 281560 KB Output is correct
88 Correct 76 ms 79780 KB Output is correct
89 Correct 838 ms 281560 KB Output is correct
90 Correct 464 ms 193424 KB Output is correct
91 Correct 347 ms 173396 KB Output is correct