oj.uz

Submission #682806

# Submission time Handle Problem Language Result Execution time Memory
682806 2023-01-17T03:52:17 Z sunwukong123 Catfish Farm (IOI22_fish) C++17
84 / 100
 1000 ms 194624 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());

    }
 
    FOR(i,0,n){
        int t=0;
        S[i].pb({0,0});
        for(auto curh:H[i]) {
            t+=V[pi(i,curh)];

            if(S[i].back().s != t)S[i].pb({curh,t});
        }

    }
    
    FOR(i,0,n-1) {


        
        if(i){
            for(auto h:H[i]) {
                
                chmax(dp[i][0][h], query1(h)); // chmax(dp[i][h][0], dp[i-1][y][1]);
                
                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]) 
                
                //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]);
                
                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);
            }
        } 
        {
            
            S1=0;S3=0;
            for(auto y:H[i]) {
                chmax(S1, dp[i][1][y]);
                chmax(S3, dp[i][0][y]);
            }
            
            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});
                }
            }
            
 
            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));
        }
 

    }
    return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 77896 KB Output is correct
2 Correct 319 ms 85244 KB Output is correct
3 Correct 102 ms 60492 KB Output is correct
4 Correct 104 ms 60556 KB Output is correct
5 Correct 954 ms 141460 KB Output is correct
6 Correct 872 ms 194624 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 493 ms 99128 KB Output is correct
3 Correct 556 ms 109668 KB Output is correct
4 Correct 248 ms 77836 KB Output is correct
5 Correct 264 ms 85464 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 11 ms 16632 KB Output is correct
8 Correct 9 ms 16724 KB Output is correct
9 Correct 9 ms 16724 KB Output is correct
10 Correct 105 ms 60500 KB Output is correct
11 Correct 106 ms 60544 KB Output is correct
12 Correct 285 ms 79100 KB Output is correct
13 Correct 343 ms 86916 KB Output is correct
14 Correct 257 ms 77932 KB Output is correct
15 Correct 318 ms 84596 KB Output is correct
16 Correct 256 ms 78040 KB Output is correct
17 Correct 308 ms 84600 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 60560 KB Output is correct
2 Correct 102 ms 60520 KB Output is correct
3 Correct 143 ms 59636 KB Output is correct
4 Correct 138 ms 63052 KB Output is correct
5 Correct 191 ms 69652 KB Output is correct
6 Correct 206 ms 69712 KB Output is correct
7 Correct 200 ms 69700 KB Output is correct
8 Correct 236 ms 69644 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16656 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 10 ms 16748 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 9 ms 16636 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 11 ms 16744 KB Output is correct
9 Correct 11 ms 16880 KB Output is correct
10 Correct 12 ms 17492 KB Output is correct
11 Correct 13 ms 16936 KB Output is correct
12 Correct 13 ms 17236 KB Output is correct
13 Correct 12 ms 16744 KB Output is correct
14 Correct 10 ms 17108 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16656 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 10 ms 16748 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 9 ms 16636 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 11 ms 16744 KB Output is correct
9 Correct 11 ms 16880 KB Output is correct
10 Correct 12 ms 17492 KB Output is correct
11 Correct 13 ms 16936 KB Output is correct
12 Correct 13 ms 17236 KB Output is correct
13 Correct 12 ms 16744 KB Output is correct
14 Correct 10 ms 17108 KB Output is correct
15 Correct 10 ms 16980 KB Output is correct
16 Correct 12 ms 17396 KB Output is correct
17 Correct 82 ms 30464 KB Output is correct
18 Correct 78 ms 30468 KB Output is correct
19 Correct 77 ms 29376 KB Output is correct
20 Correct 71 ms 29408 KB Output is correct
21 Correct 69 ms 29252 KB Output is correct
22 Correct 142 ms 41292 KB Output is correct
23 Correct 26 ms 20792 KB Output is correct
24 Correct 76 ms 28480 KB Output is correct
25 Correct 11 ms 17236 KB Output is correct
26 Correct 25 ms 20304 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 16656 KB Output is correct
2 Correct 9 ms 16724 KB Output is correct
3 Correct 9 ms 16720 KB Output is correct
4 Correct 10 ms 16748 KB Output is correct
5 Correct 9 ms 16724 KB Output is correct
6 Correct 9 ms 16636 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 11 ms 16744 KB Output is correct
9 Correct 11 ms 16880 KB Output is correct
10 Correct 12 ms 17492 KB Output is correct
11 Correct 13 ms 16936 KB Output is correct
12 Correct 13 ms 17236 KB Output is correct
13 Correct 12 ms 16744 KB Output is correct
14 Correct 10 ms 17108 KB Output is correct
15 Correct 10 ms 16980 KB Output is correct
16 Correct 12 ms 17396 KB Output is correct
17 Correct 82 ms 30464 KB Output is correct
18 Correct 78 ms 30468 KB Output is correct
19 Correct 77 ms 29376 KB Output is correct
20 Correct 71 ms 29408 KB Output is correct
21 Correct 69 ms 29252 KB Output is correct
22 Correct 142 ms 41292 KB Output is correct
23 Correct 26 ms 20792 KB Output is correct
24 Correct 76 ms 28480 KB Output is correct
25 Correct 11 ms 17236 KB Output is correct
26 Correct 25 ms 20304 KB Output is correct
27 Correct 16 ms 19432 KB Output is correct
28 Correct 452 ms 81240 KB Output is correct
29 Correct 739 ms 104212 KB Output is correct
30 Correct 757 ms 146832 KB Output is correct
31 Correct 747 ms 146764 KB Output is correct
32 Correct 577 ms 94976 KB Output is correct
33 Correct 756 ms 148732 KB Output is correct
34 Correct 751 ms 148832 KB Output is correct
35 Correct 238 ms 63848 KB Output is correct
36 Correct 756 ms 142076 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 60560 KB Output is correct
2 Correct 102 ms 60520 KB Output is correct
3 Correct 143 ms 59636 KB Output is correct
4 Correct 138 ms 63052 KB Output is correct
5 Correct 191 ms 69652 KB Output is correct
6 Correct 206 ms 69712 KB Output is correct
7 Correct 200 ms 69700 KB Output is correct
8 Correct 236 ms 69644 KB Output is correct
9 Correct 289 ms 107288 KB Output is correct
10 Correct 179 ms 58708 KB Output is correct
11 Correct 380 ms 100220 KB Output is correct
12 Correct 9 ms 16724 KB Output is correct
13 Correct 10 ms 16724 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 10 ms 16724 KB Output is correct
16 Correct 9 ms 16632 KB Output is correct
17 Correct 9 ms 16752 KB Output is correct
18 Correct 107 ms 60540 KB Output is correct
19 Correct 109 ms 60516 KB Output is correct
20 Correct 105 ms 60536 KB Output is correct
21 Correct 100 ms 60468 KB Output is correct
22 Correct 322 ms 104980 KB Output is correct
23 Correct 463 ms 135136 KB Output is correct
24 Correct 469 ms 137504 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 257 ms 77896 KB Output is correct
2 Correct 319 ms 85244 KB Output is correct
3 Correct 102 ms 60492 KB Output is correct
4 Correct 104 ms 60556 KB Output is correct
5 Correct 954 ms 141460 KB Output is correct
6 Correct 872 ms 194624 KB Output is correct
7 Correct 9 ms 16724 KB Output is correct
8 Correct 493 ms 99128 KB Output is correct
9 Correct 556 ms 109668 KB Output is correct
10 Correct 248 ms 77836 KB Output is correct
11 Correct 264 ms 85464 KB Output is correct
12 Correct 9 ms 16724 KB Output is correct
13 Correct 11 ms 16632 KB Output is correct
14 Correct 9 ms 16724 KB Output is correct
15 Correct 9 ms 16724 KB Output is correct
16 Correct 105 ms 60500 KB Output is correct
17 Correct 106 ms 60544 KB Output is correct
18 Correct 285 ms 79100 KB Output is correct
19 Correct 343 ms 86916 KB Output is correct
20 Correct 257 ms 77932 KB Output is correct
21 Correct 318 ms 84596 KB Output is correct
22 Correct 256 ms 78040 KB Output is correct
23 Correct 308 ms 84600 KB Output is correct
24 Correct 107 ms 60560 KB Output is correct
25 Correct 102 ms 60520 KB Output is correct
26 Correct 143 ms 59636 KB Output is correct
27 Correct 138 ms 63052 KB Output is correct
28 Correct 191 ms 69652 KB Output is correct
29 Correct 206 ms 69712 KB Output is correct
30 Correct 200 ms 69700 KB Output is correct
31 Correct 236 ms 69644 KB Output is correct
32 Correct 11 ms 16656 KB Output is correct
33 Correct 9 ms 16724 KB Output is correct
34 Correct 9 ms 16720 KB Output is correct
35 Correct 10 ms 16748 KB Output is correct
36 Correct 9 ms 16724 KB Output is correct
37 Correct 9 ms 16636 KB Output is correct
38 Correct 9 ms 16724 KB Output is correct
39 Correct 11 ms 16744 KB Output is correct
40 Correct 11 ms 16880 KB Output is correct
41 Correct 12 ms 17492 KB Output is correct
42 Correct 13 ms 16936 KB Output is correct
43 Correct 13 ms 17236 KB Output is correct
44 Correct 12 ms 16744 KB Output is correct
45 Correct 10 ms 17108 KB Output is correct
46 Correct 10 ms 16980 KB Output is correct
47 Correct 12 ms 17396 KB Output is correct
48 Correct 82 ms 30464 KB Output is correct
49 Correct 78 ms 30468 KB Output is correct
50 Correct 77 ms 29376 KB Output is correct
51 Correct 71 ms 29408 KB Output is correct
52 Correct 69 ms 29252 KB Output is correct
53 Correct 142 ms 41292 KB Output is correct
54 Correct 26 ms 20792 KB Output is correct
55 Correct 76 ms 28480 KB Output is correct
56 Correct 11 ms 17236 KB Output is correct
57 Correct 25 ms 20304 KB Output is correct
58 Correct 16 ms 19432 KB Output is correct
59 Correct 452 ms 81240 KB Output is correct
60 Correct 739 ms 104212 KB Output is correct
61 Correct 757 ms 146832 KB Output is correct
62 Correct 747 ms 146764 KB Output is correct
63 Correct 577 ms 94976 KB Output is correct
64 Correct 756 ms 148732 KB Output is correct
65 Correct 751 ms 148832 KB Output is correct
66 Correct 238 ms 63848 KB Output is correct
67 Correct 756 ms 142076 KB Output is correct
68 Correct 289 ms 107288 KB Output is correct
69 Correct 179 ms 58708 KB Output is correct
70 Correct 380 ms 100220 KB Output is correct
71 Correct 9 ms 16724 KB Output is correct
72 Correct 10 ms 16724 KB Output is correct
73 Correct 9 ms 16724 KB Output is correct
74 Correct 10 ms 16724 KB Output is correct
75 Correct 9 ms 16632 KB Output is correct
76 Correct 9 ms 16752 KB Output is correct
77 Correct 107 ms 60540 KB Output is correct
78 Correct 109 ms 60516 KB Output is correct
79 Correct 105 ms 60536 KB Output is correct
80 Correct 100 ms 60468 KB Output is correct
81 Correct 322 ms 104980 KB Output is correct
82 Correct 463 ms 135136 KB Output is correct
83 Correct 469 ms 137504 KB Output is correct
84 Execution timed out 1022 ms 146408 KB Time limit exceeded
85 Halted 0 ms 0 KB -