oj.uz

Submission #886026

# Submission time Handle Problem Language Result Execution time Memory
886026 2023-12-11T11:57:18 Z thinknoexit Catfish Farm (IOI22_fish) C++17
0 / 100
 107 ms 19204 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;
struct A {
    int v, w;
    ll ans;
    bool operator < (const A& o) const {
        return v < o.v;
    }
};
vector<A> pos[100100];
int n, m;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    for (int i = 0;i < M;i++) {
        pos[X[i] + 1].push_back({ Y[i] + 1, W[i], 0ll });
    }
    pos[1].push_back({ 0, 0, 0ll });
    pos[1].push_back({ N + 1, 0, 0ll });
    sort(pos[1].begin(), pos[1].end());
    ll ans = 0;
    for (int i = 2;i <= N;i++) {
        pos[i].push_back({ 0, 0, 0 });
        pos[i].push_back({ N + 1, 0, 0ll });
        sort(pos[i].begin(), pos[i].end());
        int n = pos[i - 1].size(), m = pos[i].size();
        // a[i-1] <= a[i]
        ll sum = 0;
        ll mx = 0;
        for (int j = 0, p = 0;j < m;j++) {
            while (p < n && pos[i - 1][p].v <= pos[i][j].v) {
                sum += pos[i - 1][p].w;
                mx = max(mx, pos[i - 1][p].ans - sum);
                p++;
            }
            pos[i][j].ans = max(pos[i][j].ans, sum + mx);
            ans = max(ans, pos[i][j].ans);
        }
        // a[i-1] > a[i]
        sum = 0;
        mx = 0;
        for (int j = m - 1, p = n - 1;j >= 0;j--) {
            sum += pos[i][j].w;
            while (p >= 0 && pos[i - 1][p].v > pos[i][j].v) {
                mx = max(mx, pos[i - 1][p].ans - sum);
                p--;
            }
            pos[i][j].ans = max(pos[i][j].ans, sum + mx);
            ans = max(ans, pos[i][j].ans);
        }
    }
    return ans;
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10188 KB Output is correct
2 Correct 43 ms 11152 KB Output is correct
3 Correct 11 ms 7260 KB Output is correct
4 Correct 10 ms 7268 KB Output is correct
5 Incorrect 107 ms 19204 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '299627039617116'
6 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 62 ms 13424 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80958394776886'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7260 KB Output is correct
2 Correct 12 ms 7456 KB Output is correct
3 Incorrect 29 ms 10480 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359549039477'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2652 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 1 ms 2652 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 1 ms 2652 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 10 ms 7260 KB Output is correct
2 Correct 12 ms 7456 KB Output is correct
3 Incorrect 29 ms 10480 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359549039477'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 10188 KB Output is correct
2 Correct 43 ms 11152 KB Output is correct
3 Correct 11 ms 7260 KB Output is correct
4 Correct 10 ms 7268 KB Output is correct
5 Incorrect 107 ms 19204 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '299627039617116'
6 Halted 0 ms 0 KB -