oj.uz

Submission #682582

# Submission time Handle Problem Language Result Execution time Memory
682582 2023-01-16T14:44:27 Z sunwukong123 Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 25556 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;
int dp[MAXN][MAXN][2]; // dp[i][h][has this node been added by the left?]
int V[MAXN][MAXN];
int ans;
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[X[i]][Y[i]]=W[i];
        chmax(height, (int)Y[i]);
    }
    FOR(i,0,n-1) {
        int lf = 0;
        FOR(h,0,height) {
            
            if(i-1>=0) {
                FOR(y,0,h){ // left side smaller than h
                    int extra=0;
                    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][1], max(dp[i-1][y][0], dp[i-1][y][1]) + cc);
                    chmax(dp[i][h][0], max(dp[i-1][y][0], dp[i-1][y][1]));

                    chmax(ans, dp[i][h][1]);
                    chmax(ans, dp[i][h][0]);
                }
            }
            db2(i,h);
            db2(dp[i][h][0], dp[i][h][1]);
        }
    }
    return ans;
}

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:56:13: warning: unused variable 'lf' [-Wunused-variable]
   56 |         int lf = 0;
      |             ^~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 3200 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 25556 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 3 ms 2812 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 3 ms 2812 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 832 ms 4276 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 785 ms 5952 KB Output is correct
18 Correct 800 ms 5280 KB Output is correct
19 Correct 784 ms 6368 KB Output is correct
20 Correct 794 ms 6516 KB Output is correct
21 Correct 127 ms 5564 KB Output is correct
22 Correct 805 ms 8468 KB Output is correct
23 Correct 820 ms 5048 KB Output is correct
24 Correct 820 ms 6028 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 804 ms 4784 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 1492 KB Output is correct
10 Correct 3 ms 2812 KB Output is correct
11 Correct 1 ms 1492 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 852 KB Output is correct
14 Correct 2 ms 2772 KB Output is correct
15 Correct 832 ms 4276 KB Output is correct
16 Correct 6 ms 852 KB Output is correct
17 Correct 785 ms 5952 KB Output is correct
18 Correct 800 ms 5280 KB Output is correct
19 Correct 784 ms 6368 KB Output is correct
20 Correct 794 ms 6516 KB Output is correct
21 Correct 127 ms 5564 KB Output is correct
22 Correct 805 ms 8468 KB Output is correct
23 Correct 820 ms 5048 KB Output is correct
24 Correct 820 ms 6028 KB Output is correct
25 Correct 3 ms 2900 KB Output is correct
26 Correct 804 ms 4784 KB Output is correct
27 Execution timed out 1075 ms 12696 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 25556 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1062 ms 3200 KB Time limit exceeded
2 Halted 0 ms 0 KB -