oj.uz

Submission #682804

# Submission time Handle Problem Language Result Execution time Memory
682804 2023-01-17T03:50:22 Z sunwukong123 Catfish Farm (IOI22_fish) C++17
84 / 100
 1000 ms 200272 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 244 ms 77232 KB Output is correct
2 Correct 271 ms 84920 KB Output is correct
3 Correct 99 ms 60492 KB Output is correct
4 Correct 103 ms 60524 KB Output is correct
5 Correct 988 ms 140516 KB Output is correct
6 Correct 835 ms 200272 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16724 KB Output is correct
2 Correct 507 ms 98480 KB Output is correct
3 Correct 560 ms 109032 KB Output is correct
4 Correct 225 ms 77460 KB Output is correct
5 Correct 261 ms 84788 KB Output is correct
6 Correct 8 ms 16724 KB Output is correct
7 Correct 8 ms 16700 KB Output is correct
8 Correct 8 ms 16852 KB Output is correct
9 Correct 8 ms 16692 KB Output is correct
10 Correct 98 ms 60684 KB Output is correct
11 Correct 102 ms 60484 KB Output is correct
12 Correct 291 ms 78600 KB Output is correct
13 Correct 349 ms 86476 KB Output is correct
14 Correct 270 ms 77316 KB Output is correct
15 Correct 281 ms 84068 KB Output is correct
16 Correct 257 ms 77312 KB Output is correct
17 Correct 299 ms 84116 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 60580 KB Output is correct
2 Correct 112 ms 60560 KB Output is correct
3 Correct 145 ms 59116 KB Output is correct
4 Correct 135 ms 62544 KB Output is correct
5 Correct 180 ms 69140 KB Output is correct
6 Correct 183 ms 69064 KB Output is correct
7 Correct 208 ms 69116 KB Output is correct
8 Correct 180 ms 69200 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 11 ms 16660 KB Output is correct
5 Correct 8 ms 16700 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16852 KB Output is correct
10 Correct 10 ms 17476 KB Output is correct
11 Correct 10 ms 16980 KB Output is correct
12 Correct 10 ms 17256 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 9 ms 17132 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 11 ms 16660 KB Output is correct
5 Correct 8 ms 16700 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16852 KB Output is correct
10 Correct 10 ms 17476 KB Output is correct
11 Correct 10 ms 16980 KB Output is correct
12 Correct 10 ms 17256 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 9 ms 17132 KB Output is correct
15 Correct 11 ms 17016 KB Output is correct
16 Correct 11 ms 17364 KB Output is correct
17 Correct 90 ms 29676 KB Output is correct
18 Correct 74 ms 29708 KB Output is correct
19 Correct 66 ms 28760 KB Output is correct
20 Correct 68 ms 28876 KB Output is correct
21 Correct 66 ms 28724 KB Output is correct
22 Correct 141 ms 40580 KB Output is correct
23 Correct 27 ms 20692 KB Output is correct
24 Correct 64 ms 28140 KB Output is correct
25 Correct 10 ms 17236 KB Output is correct
26 Correct 23 ms 20204 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 16724 KB Output is correct
2 Correct 8 ms 16724 KB Output is correct
3 Correct 8 ms 16724 KB Output is correct
4 Correct 11 ms 16660 KB Output is correct
5 Correct 8 ms 16700 KB Output is correct
6 Correct 9 ms 16724 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 8 ms 16724 KB Output is correct
9 Correct 8 ms 16852 KB Output is correct
10 Correct 10 ms 17476 KB Output is correct
11 Correct 10 ms 16980 KB Output is correct
12 Correct 10 ms 17256 KB Output is correct
13 Correct 9 ms 16728 KB Output is correct
14 Correct 9 ms 17132 KB Output is correct
15 Correct 11 ms 17016 KB Output is correct
16 Correct 11 ms 17364 KB Output is correct
17 Correct 90 ms 29676 KB Output is correct
18 Correct 74 ms 29708 KB Output is correct
19 Correct 66 ms 28760 KB Output is correct
20 Correct 68 ms 28876 KB Output is correct
21 Correct 66 ms 28724 KB Output is correct
22 Correct 141 ms 40580 KB Output is correct
23 Correct 27 ms 20692 KB Output is correct
24 Correct 64 ms 28140 KB Output is correct
25 Correct 10 ms 17236 KB Output is correct
26 Correct 23 ms 20204 KB Output is correct
27 Correct 16 ms 19372 KB Output is correct
28 Correct 429 ms 80548 KB Output is correct
29 Correct 694 ms 103724 KB Output is correct
30 Correct 724 ms 146212 KB Output is correct
31 Correct 748 ms 146204 KB Output is correct
32 Correct 548 ms 94472 KB Output is correct
33 Correct 752 ms 148028 KB Output is correct
34 Correct 727 ms 148096 KB Output is correct
35 Correct 227 ms 63092 KB Output is correct
36 Correct 767 ms 141432 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 104 ms 60580 KB Output is correct
2 Correct 112 ms 60560 KB Output is correct
3 Correct 145 ms 59116 KB Output is correct
4 Correct 135 ms 62544 KB Output is correct
5 Correct 180 ms 69140 KB Output is correct
6 Correct 183 ms 69064 KB Output is correct
7 Correct 208 ms 69116 KB Output is correct
8 Correct 180 ms 69200 KB Output is correct
9 Correct 278 ms 106712 KB Output is correct
10 Correct 167 ms 58232 KB Output is correct
11 Correct 445 ms 99620 KB Output is correct
12 Correct 9 ms 16652 KB Output is correct
13 Correct 8 ms 16744 KB Output is correct
14 Correct 10 ms 16724 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 16644 KB Output is correct
18 Correct 100 ms 60516 KB Output is correct
19 Correct 102 ms 60448 KB Output is correct
20 Correct 109 ms 60528 KB Output is correct
21 Correct 103 ms 60488 KB Output is correct
22 Correct 312 ms 104444 KB Output is correct
23 Correct 510 ms 134964 KB Output is correct
24 Correct 478 ms 137252 KB Output is correct

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 77232 KB Output is correct
2 Correct 271 ms 84920 KB Output is correct
3 Correct 99 ms 60492 KB Output is correct
4 Correct 103 ms 60524 KB Output is correct
5 Correct 988 ms 140516 KB Output is correct
6 Correct 835 ms 200272 KB Output is correct
7 Correct 8 ms 16724 KB Output is correct
8 Correct 507 ms 98480 KB Output is correct
9 Correct 560 ms 109032 KB Output is correct
10 Correct 225 ms 77460 KB Output is correct
11 Correct 261 ms 84788 KB Output is correct
12 Correct 8 ms 16724 KB Output is correct
13 Correct 8 ms 16700 KB Output is correct
14 Correct 8 ms 16852 KB Output is correct
15 Correct 8 ms 16692 KB Output is correct
16 Correct 98 ms 60684 KB Output is correct
17 Correct 102 ms 60484 KB Output is correct
18 Correct 291 ms 78600 KB Output is correct
19 Correct 349 ms 86476 KB Output is correct
20 Correct 270 ms 77316 KB Output is correct
21 Correct 281 ms 84068 KB Output is correct
22 Correct 257 ms 77312 KB Output is correct
23 Correct 299 ms 84116 KB Output is correct
24 Correct 104 ms 60580 KB Output is correct
25 Correct 112 ms 60560 KB Output is correct
26 Correct 145 ms 59116 KB Output is correct
27 Correct 135 ms 62544 KB Output is correct
28 Correct 180 ms 69140 KB Output is correct
29 Correct 183 ms 69064 KB Output is correct
30 Correct 208 ms 69116 KB Output is correct
31 Correct 180 ms 69200 KB Output is correct
32 Correct 9 ms 16724 KB Output is correct
33 Correct 8 ms 16724 KB Output is correct
34 Correct 8 ms 16724 KB Output is correct
35 Correct 11 ms 16660 KB Output is correct
36 Correct 8 ms 16700 KB Output is correct
37 Correct 9 ms 16724 KB Output is correct
38 Correct 8 ms 16724 KB Output is correct
39 Correct 8 ms 16724 KB Output is correct
40 Correct 8 ms 16852 KB Output is correct
41 Correct 10 ms 17476 KB Output is correct
42 Correct 10 ms 16980 KB Output is correct
43 Correct 10 ms 17256 KB Output is correct
44 Correct 9 ms 16728 KB Output is correct
45 Correct 9 ms 17132 KB Output is correct
46 Correct 11 ms 17016 KB Output is correct
47 Correct 11 ms 17364 KB Output is correct
48 Correct 90 ms 29676 KB Output is correct
49 Correct 74 ms 29708 KB Output is correct
50 Correct 66 ms 28760 KB Output is correct
51 Correct 68 ms 28876 KB Output is correct
52 Correct 66 ms 28724 KB Output is correct
53 Correct 141 ms 40580 KB Output is correct
54 Correct 27 ms 20692 KB Output is correct
55 Correct 64 ms 28140 KB Output is correct
56 Correct 10 ms 17236 KB Output is correct
57 Correct 23 ms 20204 KB Output is correct
58 Correct 16 ms 19372 KB Output is correct
59 Correct 429 ms 80548 KB Output is correct
60 Correct 694 ms 103724 KB Output is correct
61 Correct 724 ms 146212 KB Output is correct
62 Correct 748 ms 146204 KB Output is correct
63 Correct 548 ms 94472 KB Output is correct
64 Correct 752 ms 148028 KB Output is correct
65 Correct 727 ms 148096 KB Output is correct
66 Correct 227 ms 63092 KB Output is correct
67 Correct 767 ms 141432 KB Output is correct
68 Correct 278 ms 106712 KB Output is correct
69 Correct 167 ms 58232 KB Output is correct
70 Correct 445 ms 99620 KB Output is correct
71 Correct 9 ms 16652 KB Output is correct
72 Correct 8 ms 16744 KB Output is correct
73 Correct 10 ms 16724 KB Output is correct
74 Correct 9 ms 16724 KB Output is correct
75 Correct 10 ms 16724 KB Output is correct
76 Correct 9 ms 16644 KB Output is correct
77 Correct 100 ms 60516 KB Output is correct
78 Correct 102 ms 60448 KB Output is correct
79 Correct 109 ms 60528 KB Output is correct
80 Correct 103 ms 60488 KB Output is correct
81 Correct 312 ms 104444 KB Output is correct
82 Correct 510 ms 134964 KB Output is correct
83 Correct 478 ms 137252 KB Output is correct
84 Execution timed out 1079 ms 150360 KB Time limit exceeded
85 Halted 0 ms 0 KB -