oj.uz

Submission #827439

# Submission time Handle Problem Language Result Execution time Memory
827439 2023-08-16T13:16:24 Z GrindMachine Catfish Farm (IOI22_fish) C++17
52 / 100
 1000 ms 41576 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);

    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]);
            }
        }

        segtree<ll> st(n+5);
        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);
                //     }
                // }
            }
        }

        st = segtree<ll>(n+5);
        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){
            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:130:13: note: in expansion of macro 'rep'
  130 |             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:169:13: note: in expansion of macro 'rep'
  169 |             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:215:9: note: in expansion of macro 'rep'
  215 |         rep(j,sz(here[i])){
      |         ^~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 16360 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Execution timed out 1065 ms 24032 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 9476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

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 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4944 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 3 ms 5076 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 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4944 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 3 ms 5076 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 5204 KB Output is correct
17 Correct 26 ms 9252 KB Output is correct
18 Correct 20 ms 9812 KB Output is correct
19 Correct 20 ms 9684 KB Output is correct
20 Correct 20 ms 9752 KB Output is correct
21 Correct 20 ms 9764 KB Output is correct
22 Correct 37 ms 14376 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 15 ms 7908 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 6 ms 5864 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 3 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4944 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 2 ms 5076 KB Output is correct
12 Correct 3 ms 5076 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 5204 KB Output is correct
17 Correct 26 ms 9252 KB Output is correct
18 Correct 20 ms 9812 KB Output is correct
19 Correct 20 ms 9684 KB Output is correct
20 Correct 20 ms 9752 KB Output is correct
21 Correct 20 ms 9764 KB Output is correct
22 Correct 37 ms 14376 KB Output is correct
23 Correct 6 ms 5844 KB Output is correct
24 Correct 15 ms 7908 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 6 ms 5864 KB Output is correct
27 Correct 20 ms 5460 KB Output is correct
28 Correct 98 ms 27052 KB Output is correct
29 Correct 159 ms 34920 KB Output is correct
30 Correct 164 ms 40252 KB Output is correct
31 Correct 167 ms 40244 KB Output is correct
32 Correct 139 ms 41272 KB Output is correct
33 Correct 182 ms 40232 KB Output is correct
34 Correct 167 ms 40320 KB Output is correct
35 Correct 68 ms 18936 KB Output is correct
36 Correct 161 ms 41576 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 9476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1083 ms 16360 KB Time limit exceeded
2 Halted 0 ms 0 KB -