oj.uz

Submission #682796

# Submission time Handle Problem Language Result Execution time Memory
682796 2023-01-17T03:35:45 Z sunwukong123 Catfish Farm (IOI22_fish) C++17
52 / 100
 814 ms 143760 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 = 3005;
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 Runtime error 83 ms 18624 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 804 KB Output is correct
2 Runtime error 187 ms 35420 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1748 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 804 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 4 ms 1492 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 1200 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 804 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 4 ms 1492 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 1200 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 4 ms 1452 KB Output is correct
17 Correct 75 ms 14744 KB Output is correct
18 Correct 80 ms 13980 KB Output is correct
19 Correct 71 ms 12996 KB Output is correct
20 Correct 64 ms 12972 KB Output is correct
21 Correct 64 ms 12980 KB Output is correct
22 Correct 142 ms 24820 KB Output is correct
23 Correct 18 ms 4956 KB Output is correct
24 Correct 57 ms 12968 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 16 ms 4564 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 804 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 980 KB Output is correct
10 Correct 4 ms 1492 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 1200 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 4 ms 1452 KB Output is correct
17 Correct 75 ms 14744 KB Output is correct
18 Correct 80 ms 13980 KB Output is correct
19 Correct 71 ms 12996 KB Output is correct
20 Correct 64 ms 12972 KB Output is correct
21 Correct 64 ms 12980 KB Output is correct
22 Correct 142 ms 24820 KB Output is correct
23 Correct 18 ms 4956 KB Output is correct
24 Correct 57 ms 12968 KB Output is correct
25 Correct 3 ms 1364 KB Output is correct
26 Correct 16 ms 4564 KB Output is correct
27 Correct 7 ms 3540 KB Output is correct
28 Correct 446 ms 68960 KB Output is correct
29 Correct 685 ms 94264 KB Output is correct
30 Correct 775 ms 141968 KB Output is correct
31 Correct 781 ms 141920 KB Output is correct
32 Correct 542 ms 83648 KB Output is correct
33 Correct 798 ms 143744 KB Output is correct
34 Correct 814 ms 143760 KB Output is correct
35 Correct 233 ms 51180 KB Output is correct
36 Correct 769 ms 133300 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 1748 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 83 ms 18624 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -