oj.uz

답안 #680360

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680360 2023-01-10T16:34:54 Z whqkrtk04 메기 농장 (IOI22_fish) C++17
52 / 100
 826 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 {
    vvll B;
    ll operator()(int x, int s, int e) {
        assert(s <= e);
        if(x < 0 || x >= B.size()) return 0LL;
        ll ee = (e >= B[x].size() ? B[x].back() : B[x][e]);
        ll ss = (s < 0 ? B[x].front() : B[x][s]);
        return ee-ss;
    }
    ll operator()(int x, int e) {
        return this->operator()(x, 0, e);
    }
    prefix_sum(vvll &A) {
        for(auto &i : A) {
            B.push_back({0LL});
            for(auto &j : i) B.back().push_back(B.back().back()+j);
        }
    }
} prefix_sum;

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    vvll brd(N, vll(N, 0LL));
    for(int i = 0; i < M; i++) brd[X[i]][Y[i]] += W[i];
    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));
            B.push_back(dp[i-2][j]-pre(i-1, j));
            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, int)':
fish.cpp:27:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         if(x < 0 || x >= B.size()) return 0LL;
      |                     ~~^~~~~~~~~~~
fish.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |         ll ee = (e >= B[x].size() ? B[x].back() : B[x][e]);
      |                  ~~^~~~~~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 826 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Runtime error 787 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 698 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 2 ms 1108 KB Output is correct
10 Correct 6 ms 3668 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 6 ms 3668 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 3668 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 2 ms 1108 KB Output is correct
10 Correct 6 ms 3668 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 6 ms 3668 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 3668 KB Output is correct
15 Correct 6 ms 3668 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 17 ms 4688 KB Output is correct
18 Correct 16 ms 4676 KB Output is correct
19 Correct 17 ms 4692 KB Output is correct
20 Correct 17 ms 4748 KB Output is correct
21 Correct 16 ms 4704 KB Output is correct
22 Correct 27 ms 5716 KB Output is correct
23 Correct 8 ms 3796 KB Output is correct
24 Correct 13 ms 4308 KB Output is correct
25 Correct 5 ms 3668 KB Output is correct
26 Correct 7 ms 3796 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 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 2 ms 1108 KB Output is correct
10 Correct 6 ms 3668 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 6 ms 3668 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 5 ms 3668 KB Output is correct
15 Correct 6 ms 3668 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 17 ms 4688 KB Output is correct
18 Correct 16 ms 4676 KB Output is correct
19 Correct 17 ms 4692 KB Output is correct
20 Correct 17 ms 4748 KB Output is correct
21 Correct 16 ms 4704 KB Output is correct
22 Correct 27 ms 5716 KB Output is correct
23 Correct 8 ms 3796 KB Output is correct
24 Correct 13 ms 4308 KB Output is correct
25 Correct 5 ms 3668 KB Output is correct
26 Correct 7 ms 3796 KB Output is correct
27 Correct 433 ms 294840 KB Output is correct
28 Correct 84 ms 28400 KB Output is correct
29 Correct 534 ms 307452 KB Output is correct
30 Correct 526 ms 307476 KB Output is correct
31 Correct 509 ms 307476 KB Output is correct
32 Correct 96 ms 24036 KB Output is correct
33 Correct 538 ms 307496 KB Output is correct
34 Correct 549 ms 307476 KB Output is correct
35 Correct 494 ms 299548 KB Output is correct
36 Correct 533 ms 307400 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 698 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 826 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -