oj.uz

Submission #827440

# Submission time Handle Problem Language Result Execution time Memory
827440 2023-08-16T13:17:28 Z GrindMachine Catfish Farm (IOI22_fish) C++17
100 / 100
 260 ms 45584 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define conts continue
#define sz(a) a.size()

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &x, T y){
    x = min(x,y);
}

template<typename T>
void amax(T &x, T y){
    x = max(x,y);
}

#define debug(x) cout << #x << " = "; cout << x; cout << endl

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = (ll)1e18 + 5;

#include "fish.h"

template<typename T>
struct segtree{
    struct data{
        ll a;
    };

    data d_neutral = {-inf2};

    data merge(data &left, data &right){
        data curr;
        curr.a = max(left.a,right.a);
        return curr;
    }

    void modify(int i, T v){
        tr[i].a = v;
    }

    int n;
    vector<data> tr;

    segtree(int n_){
        n = n_;
        tr.assign(2*n+5,d_neutral);
    }

    void pupd(int i, T v){
        modify(i+n,v);
        for(i = (i+n)>>1; i; i >>= 1){
            tr[i] = merge(tr[i<<1],tr[i<<1|1]);
        }
    }

    data query(int l, int r){
        data res = d_neutral;

        for(l += n, r += n; l <= r; l >>= 1, r >>= 1){
            if(l & 1){
                res = merge(res,tr[l++]);
            }
            if(!(r & 1)){
                res = merge(res,tr[r--]);
            }
        }

        return res;
    }
};

vector<pll> here[N];
ll n;
vector<vector<ll>> dp[N];

long long max_weights(int n_, int m, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    
    n = n_;
    rep(i,m){
        here[X[i]].pb({Y[i],W[i]});
    }
    rep(i,n){
        sort(all(here[i]));
    }

    vector<ll> best(n);
    segtree<ll> st(n+5);

    rep(i,n){
        auto &a = here[i];
        ll siz = sz(a);
        auto &dp1 = dp[i];
        dp1 = vector<vector<ll>>(siz,vector<ll>(2));

        ll mx = 0;
        if(i >= 2){
            mx = best[i-2];
        }

        ll prev_mx = -inf2;
        if(i){
            auto &b = here[i-1];
            rep(j,sz(b)){
                amax(prev_mx,dp[i-1][j][0]);
            }
        }

        if(i){
            auto &b = here[i-1];
            rep(j,sz(b)){
                st.pupd(b[j].ff,dp[i-1][j][1]);
            }    
        }

        rep(j,siz){
            if(j){
                dp1[j][1] = dp1[j-1][1]+a[j].ss;
            }
            else{
                dp1[j][1] = mx+a[j].ss;
            }

            amax(dp1[j][1],prev_mx+a[j].ss);

            if(i){
                ll best = st.query(0,a[j].ff-1).a;
                amax(dp1[j][1],best+a[j].ss);

                // auto &b = here[i-1];
                // rep(j2,sz(b)){
                //     if(a[j].ff > b[j2].ff){
                //         amax(dp1[j][1],dp[i-1][j2][1]+a[j].ss);
                //     }
                // }
            }
        }

        if(i){
            auto &b = here[i-1];
            rep(j,sz(b)){
                st.pupd(b[j].ff,-inf2);
            }    
        }

        if(i){
            auto &b = here[i-1];
            rep(j,sz(b)){
                st.pupd(b[j].ff,dp[i-1][j][0]);
            }    
        }

        if(i){
            rev(j,siz-1,0){
                if(j+1 < siz){
                    dp1[j][0] = dp1[j+1][0]+a[j].ss;
                }
                else{
                    dp1[j][0] = mx+a[j].ss;
                }

                ll best = st.query(a[j].ff+1,n).a;
                amax(dp1[j][0],best+a[j].ss);

                // auto &b = here[i-1];
                // rep(j2,sz(b)){
                //     if(a[j].ff < b[j2].ff){
                //         amax(dp1[j][0],dp[i-1][j2][0]+a[j].ss);
                //     }
                // }
            } 
        }
        else{
            rep(j,siz){
                dp1[j][0] = -inf2;
            }
        }

        if(i){
            auto &b = here[i-1];
            rep(j,sz(b)){
                st.pupd(b[j].ff,-inf2);
            }    
        }


        if(i){
            best[i] = best[i-1];
        }

        rep(j,siz){
            rep(k,2){
                amax(best[i],dp1[j][k]);
            }
        }
    }

    ll ans = 0;

    rep(i,n){
        rep(j,sz(here[i])){
            rep(k,2){
                if(i == n-1 and k == 1) conts;
                amax(ans,dp[i][j][k]);
            }
        }
    }

    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:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:131:13: note: in expansion of macro 'rep'
  131 |             rep(j,sz(b)){
      |             ^~~
fish.cpp:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:138:13: note: in expansion of macro 'rep'
  138 |             rep(j,sz(b)){
      |             ^~~
fish.cpp:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:168:13: note: in expansion of macro 'rep'
  168 |             rep(j,sz(b)){
      |             ^~~
fish.cpp:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:175:13: note: in expansion of macro 'rep'
  175 |             rep(j,sz(b)){
      |             ^~~
fish.cpp:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:208:13: note: in expansion of macro 'rep'
  208 |             rep(j,sz(b)){
      |             ^~~
fish.cpp:26:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define rep(i,n) for(int i = 0; i < n; ++i)
      |                                   ^
fish.cpp:228:9: note: in expansion of macro 'rep'
  228 |         rep(j,sz(here[i])){
      |         ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 14656 KB Output is correct
2 Correct 54 ms 16744 KB Output is correct
3 Correct 5 ms 7252 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 191 ms 35432 KB Output is correct
6 Correct 247 ms 38476 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 94 ms 22240 KB Output is correct
3 Correct 123 ms 29552 KB Output is correct
4 Correct 45 ms 15972 KB Output is correct
5 Correct 65 ms 18460 KB Output is correct
6 Correct 2 ms 5000 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 5 ms 7252 KB Output is correct
11 Correct 5 ms 7312 KB Output is correct
12 Correct 54 ms 16132 KB Output is correct
13 Correct 68 ms 18432 KB Output is correct
14 Correct 50 ms 16080 KB Output is correct
15 Correct 56 ms 17336 KB Output is correct
16 Correct 53 ms 16036 KB Output is correct
17 Correct 55 ms 17284 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 37 ms 13312 KB Output is correct
4 Correct 27 ms 11568 KB Output is correct
5 Correct 62 ms 18980 KB Output is correct
6 Correct 65 ms 19032 KB Output is correct
7 Correct 62 ms 19024 KB Output is correct
8 Correct 64 ms 19040 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 3 ms 5056 KB Output is correct
12 Correct 3 ms 5040 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 3 ms 5056 KB Output is correct
12 Correct 3 ms 5040 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5188 KB Output is correct
17 Correct 22 ms 9300 KB Output is correct
18 Correct 21 ms 9812 KB Output is correct
19 Correct 21 ms 9756 KB Output is correct
20 Correct 22 ms 9660 KB Output is correct
21 Correct 21 ms 9720 KB Output is correct
22 Correct 40 ms 14364 KB Output is correct
23 Correct 7 ms 5832 KB Output is correct
24 Correct 16 ms 7912 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 8 ms 5736 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 4 ms 5204 KB Output is correct
11 Correct 3 ms 5056 KB Output is correct
12 Correct 3 ms 5040 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5188 KB Output is correct
17 Correct 22 ms 9300 KB Output is correct
18 Correct 21 ms 9812 KB Output is correct
19 Correct 21 ms 9756 KB Output is correct
20 Correct 22 ms 9660 KB Output is correct
21 Correct 21 ms 9720 KB Output is correct
22 Correct 40 ms 14364 KB Output is correct
23 Correct 7 ms 5832 KB Output is correct
24 Correct 16 ms 7912 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 8 ms 5736 KB Output is correct
27 Correct 4 ms 5332 KB Output is correct
28 Correct 107 ms 26992 KB Output is correct
29 Correct 162 ms 34872 KB Output is correct
30 Correct 164 ms 34616 KB Output is correct
31 Correct 196 ms 34628 KB Output is correct
32 Correct 138 ms 36176 KB Output is correct
33 Correct 162 ms 34660 KB Output is correct
34 Correct 175 ms 34624 KB Output is correct
35 Correct 59 ms 16832 KB Output is correct
36 Correct 161 ms 35916 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 37 ms 13312 KB Output is correct
4 Correct 27 ms 11568 KB Output is correct
5 Correct 62 ms 18980 KB Output is correct
6 Correct 65 ms 19032 KB Output is correct
7 Correct 62 ms 19024 KB Output is correct
8 Correct 64 ms 19040 KB Output is correct
9 Correct 77 ms 19004 KB Output is correct
10 Correct 55 ms 17136 KB Output is correct
11 Correct 116 ms 29452 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 5 ms 7252 KB Output is correct
19 Correct 6 ms 7356 KB Output is correct
20 Correct 5 ms 7252 KB Output is correct
21 Correct 7 ms 7252 KB Output is correct
22 Correct 85 ms 18556 KB Output is correct
23 Correct 115 ms 29396 KB Output is correct
24 Correct 134 ms 29496 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 14656 KB Output is correct
2 Correct 54 ms 16744 KB Output is correct
3 Correct 5 ms 7252 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 191 ms 35432 KB Output is correct
6 Correct 247 ms 38476 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 94 ms 22240 KB Output is correct
9 Correct 123 ms 29552 KB Output is correct
10 Correct 45 ms 15972 KB Output is correct
11 Correct 65 ms 18460 KB Output is correct
12 Correct 2 ms 5000 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 5 ms 7252 KB Output is correct
17 Correct 5 ms 7312 KB Output is correct
18 Correct 54 ms 16132 KB Output is correct
19 Correct 68 ms 18432 KB Output is correct
20 Correct 50 ms 16080 KB Output is correct
21 Correct 56 ms 17336 KB Output is correct
22 Correct 53 ms 16036 KB Output is correct
23 Correct 55 ms 17284 KB Output is correct
24 Correct 5 ms 7252 KB Output is correct
25 Correct 5 ms 7252 KB Output is correct
26 Correct 37 ms 13312 KB Output is correct
27 Correct 27 ms 11568 KB Output is correct
28 Correct 62 ms 18980 KB Output is correct
29 Correct 65 ms 19032 KB Output is correct
30 Correct 62 ms 19024 KB Output is correct
31 Correct 64 ms 19040 KB Output is correct
32 Correct 2 ms 4948 KB Output is correct
33 Correct 2 ms 4948 KB Output is correct
34 Correct 2 ms 4948 KB Output is correct
35 Correct 2 ms 4948 KB Output is correct
36 Correct 2 ms 4948 KB Output is correct
37 Correct 2 ms 4948 KB Output is correct
38 Correct 2 ms 4948 KB Output is correct
39 Correct 2 ms 4948 KB Output is correct
40 Correct 2 ms 4948 KB Output is correct
41 Correct 4 ms 5204 KB Output is correct
42 Correct 3 ms 5056 KB Output is correct
43 Correct 3 ms 5040 KB Output is correct
44 Correct 2 ms 4948 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 2 ms 4948 KB Output is correct
47 Correct 3 ms 5188 KB Output is correct
48 Correct 22 ms 9300 KB Output is correct
49 Correct 21 ms 9812 KB Output is correct
50 Correct 21 ms 9756 KB Output is correct
51 Correct 22 ms 9660 KB Output is correct
52 Correct 21 ms 9720 KB Output is correct
53 Correct 40 ms 14364 KB Output is correct
54 Correct 7 ms 5832 KB Output is correct
55 Correct 16 ms 7912 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 8 ms 5736 KB Output is correct
58 Correct 4 ms 5332 KB Output is correct
59 Correct 107 ms 26992 KB Output is correct
60 Correct 162 ms 34872 KB Output is correct
61 Correct 164 ms 34616 KB Output is correct
62 Correct 196 ms 34628 KB Output is correct
63 Correct 138 ms 36176 KB Output is correct
64 Correct 162 ms 34660 KB Output is correct
65 Correct 175 ms 34624 KB Output is correct
66 Correct 59 ms 16832 KB Output is correct
67 Correct 161 ms 35916 KB Output is correct
68 Correct 77 ms 19004 KB Output is correct
69 Correct 55 ms 17136 KB Output is correct
70 Correct 116 ms 29452 KB Output is correct
71 Correct 2 ms 4948 KB Output is correct
72 Correct 2 ms 4948 KB Output is correct
73 Correct 2 ms 4948 KB Output is correct
74 Correct 2 ms 4948 KB Output is correct
75 Correct 2 ms 4948 KB Output is correct
76 Correct 2 ms 4948 KB Output is correct
77 Correct 5 ms 7252 KB Output is correct
78 Correct 6 ms 7356 KB Output is correct
79 Correct 5 ms 7252 KB Output is correct
80 Correct 7 ms 7252 KB Output is correct
81 Correct 85 ms 18556 KB Output is correct
82 Correct 115 ms 29396 KB Output is correct
83 Correct 134 ms 29496 KB Output is correct
84 Correct 207 ms 41536 KB Output is correct
85 Correct 196 ms 41088 KB Output is correct
86 Correct 230 ms 44820 KB Output is correct
87 Correct 260 ms 45496 KB Output is correct
88 Correct 2 ms 4948 KB Output is correct
89 Correct 245 ms 45584 KB Output is correct
90 Correct 183 ms 43744 KB Output is correct
91 Correct 179 ms 43252 KB Output is correct