oj.uz

Submission #827430

# Submission time Handle Problem Language Result Execution time Memory
827430 2023-08-16T13:06:29 Z GrindMachine Catfish Farm (IOI22_fish) C++17
61 / 100
 1000 ms 36924 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"

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

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

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

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

                if(i){
                    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:88:17: note: in expansion of macro 'rep'
   88 |                 rep(j2,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:109:21: note: in expansion of macro 'rep'
  109 |                     rep(j2,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:9: note: in expansion of macro 'rep'
  138 |         rep(j,sz(here[i])){
      |         ^~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 13252 KB Output is correct
2 Correct 39 ms 15120 KB Output is correct
3 Correct 4 ms 5716 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 110 ms 33952 KB Output is correct
6 Correct 119 ms 36924 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5716 KB Output is correct
2 Correct 4 ms 5716 KB Output is correct
3 Correct 24 ms 11932 KB Output is correct
4 Correct 19 ms 10264 KB Output is correct
5 Correct 57 ms 17668 KB Output is correct
6 Correct 40 ms 17740 KB Output is correct
7 Correct 56 ms 17672 KB Output is correct
8 Correct 43 ms 17744 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 3 ms 5204 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 2 ms 5000 KB Output is correct
14 Correct 3 ms 5016 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 3 ms 5204 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 2 ms 5000 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 43 ms 9424 KB Output is correct
18 Correct 48 ms 10036 KB Output is correct
19 Correct 36 ms 9932 KB Output is correct
20 Correct 35 ms 10000 KB Output is correct
21 Correct 35 ms 9996 KB Output is correct
22 Correct 100 ms 14616 KB Output is correct
23 Correct 6 ms 5972 KB Output is correct
24 Correct 21 ms 8152 KB Output is correct
25 Correct 3 ms 5136 KB Output is correct
26 Correct 6 ms 5884 KB Output is correct

Subtask #6
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 3 ms 5204 KB Output is correct
11 Correct 3 ms 5076 KB Output is correct
12 Correct 3 ms 5076 KB Output is correct
13 Correct 2 ms 5000 KB Output is correct
14 Correct 3 ms 5016 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 3 ms 5204 KB Output is correct
17 Correct 43 ms 9424 KB Output is correct
18 Correct 48 ms 10036 KB Output is correct
19 Correct 36 ms 9932 KB Output is correct
20 Correct 35 ms 10000 KB Output is correct
21 Correct 35 ms 9996 KB Output is correct
22 Correct 100 ms 14616 KB Output is correct
23 Correct 6 ms 5972 KB Output is correct
24 Correct 21 ms 8152 KB Output is correct
25 Correct 3 ms 5136 KB Output is correct
26 Correct 6 ms 5884 KB Output is correct
27 Correct 3 ms 5332 KB Output is correct
28 Correct 405 ms 27284 KB Output is correct
29 Execution timed out 1080 ms 35112 KB Time limit exceeded
30 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5716 KB Output is correct
2 Correct 4 ms 5716 KB Output is correct
3 Correct 24 ms 11932 KB Output is correct
4 Correct 19 ms 10264 KB Output is correct
5 Correct 57 ms 17668 KB Output is correct
6 Correct 40 ms 17740 KB Output is correct
7 Correct 56 ms 17672 KB Output is correct
8 Correct 43 ms 17744 KB Output is correct
9 Correct 46 ms 17752 KB Output is correct
10 Correct 41 ms 16664 KB Output is correct
11 Correct 84 ms 28084 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 5004 KB Output is correct
16 Correct 2 ms 5000 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 4 ms 5716 KB Output is correct
21 Correct 4 ms 5764 KB Output is correct
22 Correct 44 ms 17180 KB Output is correct
23 Correct 81 ms 28140 KB Output is correct
24 Correct 90 ms 28080 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 13252 KB Output is correct
2 Correct 39 ms 15120 KB Output is correct
3 Correct 4 ms 5716 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 110 ms 33952 KB Output is correct
6 Correct 119 ms 36924 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Execution timed out 1087 ms 20900 KB Time limit exceeded
9 Halted 0 ms 0 KB -