oj.uz

답안 #1005324

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005324 2024-06-22T10:23:47 Z overwatch9 메기 농장 (IOI22_fish) C++17
23 / 100
 800 ms 151120 KB 
#include "fish.h"
 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector <vector <pair <int, ll>>> fish;
vector <vector <ll>> pfx;
int n, m;
const int maxn = 1e5 + 5;
ll dp[maxn][11][11];
bool ready[maxn][11][11];
ll cost(int i, int h1, int h2, int h3) {
    if (i == 1)
        return 0;
    if (max(h1, h3) <= h2 || (int)fish[i-1].size() == 1)
        return 0;
    int mx = max(h1, h3);
    pair <int, ll> tp = {h2+1, 0};
    int it = lower_bound(fish[i-1].begin(), fish[i-1].end(), tp) - fish[i-1].begin();
    tp.first = mx;
    tp.second = 1e18;
    int it2 = upper_bound(fish[i-1].begin(), fish[i-1].end(), tp) - fish[i-1].begin();
    it2--;
    // if (it == it2)
    //     return 0;
    if (it == 0)
        return pfx[i-1][it2];
    return pfx[i-1][it2] - pfx[i-1][it-1];
}
int get_id(int x, int i) {
    if (x == 10 || i == 0)
        return 0;
    if (x == 0 || x == 1 || x == 2)
        return fish[i-1][x].first;
    if (x <= 5)
        return fish[i][x - 3].first;
    return fish[i+1][x - 6].first;
}
ll solve(int i, int h1, int h2) {
    if (i == n+1) {
        return cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), 0);
    }
    if (ready[i][h1][h2])
        return dp[i][h1][h2];
    ll ans = solve(i+1, h2, 10) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), 0);
    int id = 0;
    if (i-1 >= 1) {
        if ((int)fish[i-1].size() >= 2)
            ans = max(ans, solve(i+1, h2, 1) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i-1][1].first));
        if ((int)fish[i-1].size() == 3)
            ans = max(ans, solve(i+1, h2, 2) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i-1][2].first));
    }
    for (auto j : fish[i]) {
        if ((int)fish[i].size() >= 2) {
            ans = max(ans, solve(i+1, h2, 4) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i][1].first));
        }
        if ((int)fish[i].size() == 3) {
            ans = max(ans, solve(i+1, h2, 5) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i][2].first));
        }
    }
    if (i+1 <= n) {
        if ((int)fish[i+1].size() >= 2)
            ans = max(ans, solve(i+1, h2, 7) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i+1][1].first));
        if ((int)fish[i+1].size() == 3) {
            ans = max(ans, solve(i+1, h2, 8) + cost(i, get_id(h1, max(i-2, 0)), get_id(h2, i-1), fish[i+1][2].first));
        }
    }
    ready[i][h1][h2] = true;
    dp[i][h1][h2] = ans;
    return ans;
}
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N;
    m = M;
    fish.resize(N+1);
    pfx.resize(N+1);
    for (int i = 0; i < M; i++) {
        fish[X[i] + 1].push_back({Y[i] + 1, W[i]});
    }
    // dp = vector <vector <ll>> (N+1, vector <ll> (N+1, -1));
    for (int i = 0; i <= N; i++) {
        fish[i].push_back({0, 0});
        sort(fish[i].begin(), fish[i].end());
        pfx[i].resize((int)fish[i].size() + 5, 1e18);
        pfx[i][0] = 0;
        for (int j = 1; j < (int)fish[i].size(); j++)
            pfx[i][j] = pfx[i][j-1] + fish[i][j].second;
    }
    return solve(1, 10, 10);
}
// int main() {
//     int nn, mm;
//     cin >> nn >> mm;
//     vector <int> x(mm), y(mm), w(mm);
//     for (int i = 0; i < mm; i++)
//         cin >> x[i] >> y[i] >> w[i];
//     cout << max_weights(nn, mm, x, y, w) << '\n';
// }

Compilation message

fish.cpp: In function 'll solve(int, int, int)':
fish.cpp:53:15: warning: variable 'j' set but not used [-Wunused-but-set-variable]
   53 |     for (auto j : fish[i]) {
      |               ^
fish.cpp:46:9: warning: unused variable 'id' [-Wunused-variable]
   46 |     int id = 0;
      |         ^~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 126916 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '223762357'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Incorrect 75 ms 130908 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '851126173'
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 134992 KB Output is correct
2 Correct 33 ms 134996 KB Output is correct
3 Correct 84 ms 125492 KB Output is correct
4 Correct 71 ms 136380 KB Output is correct
5 Correct 146 ms 139604 KB Output is correct
6 Correct 149 ms 139604 KB Output is correct
7 Correct 146 ms 139604 KB Output is correct
8 Correct 143 ms 139600 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Incorrect 1 ms 2396 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '60633375534'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Incorrect 1 ms 2396 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '60633375534'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Incorrect 1 ms 2396 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '60633375534'
10 Halted 0 ms 0 KB -

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 134992 KB Output is correct
2 Correct 33 ms 134996 KB Output is correct
3 Correct 84 ms 125492 KB Output is correct
4 Correct 71 ms 136380 KB Output is correct
5 Correct 146 ms 139604 KB Output is correct
6 Correct 149 ms 139604 KB Output is correct
7 Correct 146 ms 139604 KB Output is correct
8 Correct 143 ms 139600 KB Output is correct
9 Correct 166 ms 139608 KB Output is correct
10 Correct 379 ms 75772 KB Output is correct
11 Correct 689 ms 150608 KB Output is correct
12 Correct 0 ms 2392 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 35 ms 134996 KB Output is correct
19 Correct 34 ms 134992 KB Output is correct
20 Correct 33 ms 135004 KB Output is correct
21 Correct 32 ms 134952 KB Output is correct
22 Correct 272 ms 142092 KB Output is correct
23 Correct 798 ms 150612 KB Output is correct
24 Correct 800 ms 151120 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 50 ms 126916 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '223762357'
2 Halted 0 ms 0 KB -