oj.uz

Submission #682797

# Submission time Handle Problem Language Result Execution time Memory
682797 2023-01-17T03:36:37 Z sunwukong123 Catfish Farm (IOI22_fish) C++17
81 / 100
 1000 ms 154560 KB 
#include "fish.h"
#include <bits/stdc++.h>
#define int long long 
using namespace std;
#define FOR(i,s,e) for(int i = s; i <= (int)e; ++i)
#define DEC(i,s,e) for(int i = s; i >= (int)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define reach 
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first 
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <int, int> pi;
typedef tuple<int,int,int> ti3;
typedef tuple<int,int,int,int> ti4;
int rand(int a, int b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (long long)1e18 + 500;
template <typename T> bool chmax(T& a, const T b) { return a<b ? a = b, 1 : 0; }
template <typename T> bool chmin(T& a, const T b) { return a>b ? a = b, 1 : 0; }
const int MAXN = 100005;
map<int,int> dp[MAXN][2]; // dp[i][has this node been added by the left?][height]
map<pi,int> V;
int ans;
vector<int> H[MAXN];
vector<int> P[MAXN];
vector<pi> S[MAXN];
int S1, S3;
vector<pi> S2, S4;

int query1(int h) {
    return S1;
}

int query3(int h) {
    return S3;
}

int query2(int h){
    int res=prev(upper_bound(all(S2), pi(h,oo)))->s;
    return res;
}
int query4(int h) {
    reach
    int res=lower_bound(all(S4), pi(h,-oo))->s;
    reach
    return res;
}
long long max_weights(int32_t n, int32_t m, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    int height = 0;
    FOR(i,0,m-1){
        ++Y[i];
        V[pi(X[i],Y[i])]=W[i];
        chmax(height, (int)Y[i]);
        H[X[i]].pb(Y[i]);
        H[X[i]].pb(Y[i]-1);
    }
    FOR(i,0,n) {
        H[i].pb(0);
        H[i].pb(height);
        sort(all(H[i]));
        H[i].resize(unique(all(H[i])) - H[i].begin());
        dbv(H[i]);
    }

    FOR(i,0,n){
        int t=0;
        for(auto curh:H[i]) {
            t+=V[pi(i,curh)];
            S[i].pb({curh,t});
        }
        for(auto e:S[i]) {
            db2(e.f,e.s);
        }
    }
    reach
    int premx=0;
    FOR(i,0,n-1) {
        db(i);
        int cmax=0;
        
        if(i){
            for(auto h:H[i]) {
                reach
                chmax(dp[i][0][h], query1(h)); // chmax(dp[i][h][0], dp[i-1][y][1]);
                reach
                int s1=prev(upper_bound(all(S[i-1]), pi(h,oo)))->s;
                chmax(dp[i][0][h], s1 + query2(h)); //y<=h: chmax(dp[i][h][0], max{dp[i-1][y][0] - ss[i-1][y]} + ss[i-1][h]) 
                reach
                //chmax(dp[i][h][0], max(dp[i-1][y][0], dp[i-1][y][1]));
                chmax(dp[i][0][h], query3(h)); // chmax(dp[i][h][0], dp[i-1][y][0]);
                int s2=prev(upper_bound(all(S[i]), pi(h,oo)))->s;
                chmax(dp[i][1][h], query4(h) - s2); //y>h: chmax(dp[i][h][1], max(dp[i-1][y][0], dp[i-1][y][1]) + ss[i][y]-ss[i][h]);
                reach
                chmax(ans, dp[i][0][h]);
                chmax(ans, dp[i][1][h]);
                //chmax(dp[i][h][1], max(dp[i-1][y][0], dp[i-1][y][1]) + cc);
            }
        } 
        {
            reach
            S1=0;S3=0;
            for(auto y:H[i]) {
                chmax(S1, dp[i][1][y]);
                chmax(S3, dp[i][0][y]);
            }
            reach
            S2.clear(); S4.clear();
            S2.pb({0,0});
            for(auto y:H[i]) {
                db(y);
                db2(S[i][0].f,S[i][0].s);
                int sum = prev(upper_bound(all(S[i]),pi(y,oo)))->s;
                db(sum);
                int val=dp[i][0][y] - sum;
                if(val > S2.back().s) {
                    S2.pb({y, val});
                }
            }
            reach

            S4.pb({height, 0});
            for(auto it=H[i].rbegin(); it!=H[i].rend(); it++){ 
                int y=*it;
                int sum=prev(upper_bound(all(S[i+1]), pi(y,oo))) -> s;
                int val=max(dp[i][0][y], dp[i][1][y]) + sum;
                if(val > S4.back().s) {
                    S4.pb({y, val});
                }
            }
            reverse(all(S4));
        }

        db3(i,S1,S3);
        dbvp(S2);
        dbvp(S4);
    }
    return ans;
}

/*
        FOR(h,0,height) {
            ss[i][h]=ss[i][h-1];
            ss[i][h]+=V[i][h];
            if(i-1>=0) {
                FOR(y,0,h){ // left side smaller than h
                    int extra=ss[i-1][h] - ss[i-1][y];
                    //FOR(zz,y+1,h)extra+=V[i-1][zz]; // all the things i'm higher than 
                    chmax(dp[i][h][0], dp[i-1][y][0] + extra);
                    chmax(dp[i][h][0], dp[i-1][y][1]);
                    chmax(ans, dp[i][h][0]);
                }
                int cc=0;
                FOR(y,h+1,height) { // left side higher than me
                    cc+=V[i][y];
                    chmax(dp[i][h][0], max(dp[i-1][y][0], dp[i-1][y][1]));
                    chmax(dp[i][h][1], max(dp[i-1][y][0], dp[i-1][y][1]) + cc);
                    

                    chmax(ans, dp[i][h][1]);
                    chmax(ans, dp[i][h][0]);
                }
            }
            
        }
        */

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:95:18: warning: variable 'e' set but not used [-Wunused-but-set-variable]
   95 |         for(auto e:S[i]) {
      |                  ^
fish.cpp:103:13: warning: unused variable 'cmax' [-Wunused-variable]
  103 |         int cmax=0;
      |             ^~~~
fish.cpp:100:9: warning: unused variable 'premx' [-Wunused-variable]
  100 |     int premx=0;
      |         ^~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 79124 KB Output is correct
2 Correct 288 ms 88060 KB Output is correct
3 Correct 110 ms 62012 KB Output is correct
4 Correct 116 ms 62132 KB Output is correct
5 Execution timed out 1016 ms 147732 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16744 KB Output is correct
2 Correct 473 ms 100296 KB Output is correct
3 Correct 564 ms 114196 KB Output is correct
4 Correct 235 ms 80248 KB Output is correct
5 Correct 275 ms 88068 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 10 ms 16724 KB Output is correct
8 Correct 9 ms 16724 KB Output is correct
9 Correct 9 ms 16724 KB Output is correct
10 Correct 102 ms 62104 KB Output is correct
11 Correct 104 ms 62156 KB Output is correct
12 Correct 294 ms 81488 KB Output is correct
13 Correct 345 ms 89684 KB Output is correct
14 Correct 277 ms 80256 KB Output is correct
15 Correct 290 ms 87360 KB Output is correct
16 Correct 260 ms 80340 KB Output is correct
17 Correct 286 ms 87468 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 62124 KB Output is correct
2 Correct 101 ms 62116 KB Output is correct
3 Correct 138 ms 61148 KB Output is correct
4 Correct 131 ms 64080 KB Output is correct
5 Correct 192 ms 70732 KB Output is correct
6 Correct 179 ms 70120 KB Output is correct
7 Correct 227 ms 70640 KB Output is correct
8 Correct 181 ms 70636 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 8 ms 16740 KB Output is correct
5 Correct 10 ms 16740 KB Output is correct
6 Correct 11 ms 16748 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 9 ms 16852 KB Output is correct
10 Correct 11 ms 17492 KB Output is correct
11 Correct 9 ms 16980 KB Output is correct
12 Correct 10 ms 17236 KB Output is correct
13 Correct 8 ms 16724 KB Output is correct
14 Correct 9 ms 17136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 8 ms 16740 KB Output is correct
5 Correct 10 ms 16740 KB Output is correct
6 Correct 11 ms 16748 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 9 ms 16852 KB Output is correct
10 Correct 11 ms 17492 KB Output is correct
11 Correct 9 ms 16980 KB Output is correct
12 Correct 10 ms 17236 KB Output is correct
13 Correct 8 ms 16724 KB Output is correct
14 Correct 9 ms 17136 KB Output is correct
15 Correct 9 ms 17000 KB Output is correct
16 Correct 12 ms 17420 KB Output is correct
17 Correct 83 ms 30592 KB Output is correct
18 Correct 76 ms 29900 KB Output is correct
19 Correct 84 ms 28996 KB Output is correct
20 Correct 69 ms 28984 KB Output is correct
21 Correct 70 ms 28860 KB Output is correct
22 Correct 143 ms 40868 KB Output is correct
23 Correct 28 ms 20972 KB Output is correct
24 Correct 65 ms 28872 KB Output is correct
25 Correct 11 ms 17364 KB Output is correct
26 Correct 24 ms 20360 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 8 ms 16740 KB Output is correct
5 Correct 10 ms 16740 KB Output is correct
6 Correct 11 ms 16748 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 9 ms 16852 KB Output is correct
10 Correct 11 ms 17492 KB Output is correct
11 Correct 9 ms 16980 KB Output is correct
12 Correct 10 ms 17236 KB Output is correct
13 Correct 8 ms 16724 KB Output is correct
14 Correct 9 ms 17136 KB Output is correct
15 Correct 9 ms 17000 KB Output is correct
16 Correct 12 ms 17420 KB Output is correct
17 Correct 83 ms 30592 KB Output is correct
18 Correct 76 ms 29900 KB Output is correct
19 Correct 84 ms 28996 KB Output is correct
20 Correct 69 ms 28984 KB Output is correct
21 Correct 70 ms 28860 KB Output is correct
22 Correct 143 ms 40868 KB Output is correct
23 Correct 28 ms 20972 KB Output is correct
24 Correct 65 ms 28872 KB Output is correct
25 Correct 11 ms 17364 KB Output is correct
26 Correct 24 ms 20360 KB Output is correct
27 Correct 15 ms 19444 KB Output is correct
28 Correct 434 ms 81392 KB Output is correct
29 Correct 706 ms 104872 KB Output is correct
30 Correct 788 ms 152540 KB Output is correct
31 Correct 770 ms 152368 KB Output is correct
32 Correct 541 ms 94752 KB Output is correct
33 Correct 762 ms 154560 KB Output is correct
34 Correct 761 ms 154256 KB Output is correct
35 Correct 241 ms 65376 KB Output is correct
36 Correct 739 ms 143968 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 62124 KB Output is correct
2 Correct 101 ms 62116 KB Output is correct
3 Correct 138 ms 61148 KB Output is correct
4 Correct 131 ms 64080 KB Output is correct
5 Correct 192 ms 70732 KB Output is correct
6 Correct 179 ms 70120 KB Output is correct
7 Correct 227 ms 70640 KB Output is correct
8 Correct 181 ms 70636 KB Output is correct
9 Correct 279 ms 111128 KB Output is correct
10 Correct 166 ms 59892 KB Output is correct
11 Correct 369 ms 103172 KB Output is correct
12 Correct 9 ms 16724 KB Output is correct
13 Correct 9 ms 16644 KB Output is correct
14 Correct 9 ms 16748 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 10 ms 16724 KB Output is correct
17 Correct 9 ms 16724 KB Output is correct
18 Correct 106 ms 62220 KB Output is correct
19 Correct 103 ms 62128 KB Output is correct
20 Correct 104 ms 62044 KB Output is correct
21 Correct 104 ms 62064 KB Output is correct
22 Correct 317 ms 110452 KB Output is correct
23 Correct 463 ms 143944 KB Output is correct
24 Correct 467 ms 147492 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 79124 KB Output is correct
2 Correct 288 ms 88060 KB Output is correct
3 Correct 110 ms 62012 KB Output is correct
4 Correct 116 ms 62132 KB Output is correct
5 Execution timed out 1016 ms 147732 KB Time limit exceeded
6 Halted 0 ms 0 KB -