oj.uz

Submission #680378

# Submission time Handle Problem Language Result Execution time Memory
680378 2023-01-10T17:06:11 Z whqkrtk04 Catfish Farm (IOI22_fish) C++17
35 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
#define fi first
#define se second
const int INF = 1e9+1;
const int P = 1000000007;
const ll LLINF = (ll)1e18+1;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { for(auto i : v) os << i << " "; os << "\n"; return os; }
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) { os << p.fi << " " << p.se; return os; }

typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;

typedef struct prefix_sum {
    vector<vector<pll>> B;
    ll operator()(int x, int s, int e) {
        assert(s <= e);
        return this->operator()(x, e)-this->operator()(x, s);
    }
    ll operator()(int x, int y) {
        if(x < 0 || x >= B.size()) return 0LL;
        auto iter = lower_bound(B[x].begin(), B[x].end(), pll(y, 0LL));
        return (iter == B[x].begin() ? 0LL : (--iter)->se);
    }
    prefix_sum(vector<vector<pii>> &A) {
        for(auto &i : A) {
            ll su = 0LL;
            B.push_back(vector<pll>());
            for(auto &j : i) {
                su += j.se;
                B.back().push_back({j.fi, su});
            }
        }
    }
} prefix_sum;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vector<vector<pii>> brd(N);
    for(int i = 0; i < M; i++) brd[X[i]].push_back({Y[i], W[i]});
    for(int i = 0; i < N; i++) sort(brd[i].begin(), brd[i].end());
    prefix_sum pre(brd);

    int MX = N, MY = N+1;    
    vvll down(MX, vll(MY, 0LL)), dp(MX, vll(MY, 0LL));
    for(int j = 0; j < MY; j++) {
        down[0][j] = dp[0][j] = pre(1, j);
        down[1][j] = pre(0, j)+pre(2, j);
        dp[1][j] = max(down[1][j], pre(1, j, N)+pre(2, j));
    }
    for(int i = 2; i < MX; i++) {
        vll A, B, C, D;
        for(int j = 0; j < MY; j++) {
            A.push_back(down[i-1][j]-pre(i, j)-pre(i-1, j)); // bug22?
            B.push_back(dp[i-2][j]-pre(i-1, j)); // bug?
            C.push_back(dp[i-2][j]);
            D.push_back(dp[i-1][j]);
        }
        for(int j = 1; j < MY; j++) {
            A[j] = max(A[j], A[j-1]);
            B[j] = max(B[j], B[j-1]);
        }
        for(int j = MY-2; j >= 0; j--) {
            C[j] = max(C[j], C[j+1]);
            D[j] = max(D[j], D[j+1]);
        }
        for(int j = 0; j < MY; j++) {
            down[i][j] = max(A[j], B[j])+pre(i-1, j)+pre(i+1, j);
            if(j+1 < MY) {
                down[i][j] = max(down[i][j], C[j+1]+pre(i+1, j));
                dp[i][j] = D[j+1]-pre(i, j)+pre(i+1, j);
            }
            dp[i][j] = max(dp[i][j], down[i][j]);
        }
    }
    //cout << " " << down << " " << dp << "\n";
    return *max_element(dp.back().begin(), dp.back().end());
}

Compilation message

fish.cpp: In member function 'll prefix_sum::operator()(int, int)':
fish.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         if(x < 0 || x >= B.size()) return 0LL;
      |                     ~~^~~~~~~~~~~

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 751 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 808 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 733 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 6 ms 1872 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 6 ms 1852 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 6 ms 1872 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 6 ms 1852 KB Output is correct
15 Correct 6 ms 1708 KB Output is correct
16 Correct 2 ms 568 KB Output is correct
17 Correct 37 ms 4816 KB Output is correct
18 Correct 38 ms 5680 KB Output is correct
19 Correct 32 ms 5420 KB Output is correct
20 Correct 30 ms 5452 KB Output is correct
21 Correct 29 ms 5416 KB Output is correct
22 Correct 54 ms 8808 KB Output is correct
23 Correct 17 ms 2388 KB Output is correct
24 Correct 34 ms 3924 KB Output is correct
25 Correct 7 ms 1864 KB Output is correct
26 Correct 21 ms 2404 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 300 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 300 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 692 KB Output is correct
10 Correct 7 ms 1876 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 6 ms 1872 KB Output is correct
13 Correct 1 ms 300 KB Output is correct
14 Correct 6 ms 1852 KB Output is correct
15 Correct 6 ms 1708 KB Output is correct
16 Correct 2 ms 568 KB Output is correct
17 Correct 37 ms 4816 KB Output is correct
18 Correct 38 ms 5680 KB Output is correct
19 Correct 32 ms 5420 KB Output is correct
20 Correct 30 ms 5452 KB Output is correct
21 Correct 29 ms 5416 KB Output is correct
22 Correct 54 ms 8808 KB Output is correct
23 Correct 17 ms 2388 KB Output is correct
24 Correct 34 ms 3924 KB Output is correct
25 Correct 7 ms 1864 KB Output is correct
26 Correct 21 ms 2404 KB Output is correct
27 Correct 480 ms 142032 KB Output is correct
28 Correct 191 ms 24288 KB Output is correct
29 Correct 616 ms 159428 KB Output is correct
30 Execution timed out 1066 ms 160376 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 733 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 751 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -