oj.uz

Submission #991896

# Submission time Handle Problem Language Result Execution time Memory
991896 2024-06-03T10:43:04 Z thinknoexit Catfish Farm (IOI22_fish) C++17
3 / 100
 105 ms 28240 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<pair<int, int>> pos[100100];
struct DP {
    ll in, de;
    DP() {
        in = de = 0;
    }
} dp[600600];
int w[600600];
int n, m;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    n = N, m = M;
    for (int i = 0;i < m;i++) {
        w[i + 1] = W[i];
        pos[X[i] + 1].push_back({ Y[i] + 1, i + 1 });
    }
    int idx = m, p;
    ll mx, sum;
    for (int i = 2;i <= n;i++) {
        pos[i].push_back({ 0, ++idx });
        pos[i].push_back({ n + 1, ++idx });
        sort(pos[i].begin(), pos[i].end());
        // in -> in
        {
            p = 0;
            mx = 0;
            for (int j = 0;j < (int)pos[i].size();j++) {
                while (p < (int)pos[i - 1].size() && pos[i - 1][p].first < pos[i][j].first) {
                    int prev = pos[i - 1][p].second;
                    mx = max(mx + w[prev], dp[prev].in);
                    p++;
                }
                dp[pos[i][j].second].in = mx;
            }
        }
        // de -> de , in -> de
        {
            p = pos[i - 1].size() - 1;
            mx = 0;
            for (int j = pos[i].size() - 1;j >= 0;j--) {
                while (p >= 0 && pos[i - 1][p].first > pos[i][j].first) {
                    int prev = pos[i - 1][p].second;
                    mx = max({ mx, dp[prev].in, dp[prev].de });
                    p--;
                }
                mx += w[pos[i][j].second];
                dp[pos[i][j].second].de = mx;
            }
        }
        // in -> de, de -> in
        if (i >= 3) {
            // h[i-2] <= h[i]
            {
                int mid = 0;
                p = 0;
                mx = 0, sum = 0;
                for (int j = 0;j < (int)pos[i].size();j++) {
                    while (p < (int)pos[i - 2].size() && pos[i - 2][p].first < pos[i][j].first) {
                        int prev = pos[i - 2][p].second;
                        mx = max({ mx ,dp[prev].in, dp[prev].de });
                        p++;
                    }
                    while (mid < (int)pos[i - 1].size() && pos[i - 1][mid].first < pos[i][j].first) {
                        sum += w[pos[i - 1][mid++].second];
                    }
                    dp[pos[i][j].second].in = max(dp[pos[i][j].second].in, mx + sum);
                }
            }
            // h[i-2] >= h[i]
            {
                int mid = pos[i - 1].size() - 1;
                mx = 0, sum = 0;
                for (int j = 0;j <= mid;j++) sum += w[pos[i - 1][j].second];
                p = pos[i - 2].size() - 1;
                for (int j = pos[i].size() - 1;j >= 0;j--) {
                    while (p >= 0 && pos[i - 2][p].first >= pos[i][j].first) {
                        int prev = pos[i - 2][p].second;
                        int now = pos[i - 2][p].first;
                        mx = max({ mx, dp[prev].in + sum, dp[prev].de + sum });
                        while (mid >= 0 && pos[i - 1][mid].first >= now) {
                            sum -= w[pos[i - 1][mid--].second];
                        }
                        p--;
                    }
                    dp[pos[i][j].second].in = max(dp[pos[i][j].second].in, mx);
                }
            }
        }
    }
    ll ans = 0;
    for (int i = 1;i <= idx;i++) {
        ans = max(ans, dp[i].in);
        ans = max(ans, dp[i].de);
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 19648 KB Output is correct
2 Correct 30 ms 20772 KB Output is correct
3 Correct 12 ms 15344 KB Output is correct
4 Correct 14 ms 15452 KB Output is correct
5 Correct 98 ms 26808 KB Output is correct
6 Correct 105 ms 28240 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 12124 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 11 ms 15344 KB Output is correct
3 Incorrect 28 ms 19612 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '23323672247967'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12120 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12120 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 12120 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 15452 KB Output is correct
2 Correct 11 ms 15344 KB Output is correct
3 Incorrect 28 ms 19612 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '23323672247967'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 19648 KB Output is correct
2 Correct 30 ms 20772 KB Output is correct
3 Correct 12 ms 15344 KB Output is correct
4 Correct 14 ms 15452 KB Output is correct
5 Correct 98 ms 26808 KB Output is correct
6 Correct 105 ms 28240 KB Output is correct
7 Incorrect 2 ms 12124 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -