oj.uz

답안 #1078694

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078694 2024-08-28T04:32:08 Z The_Samurai 메기 농장 (IOI22_fish) C++17
9 / 100
 72 ms 30804 KB 
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
#define ff first
#define ss second

long long max_weights(int n, int m, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    vector<vector<pair<int, int>>> a(n);
    for (int i = 0; i < m; i++) a[X[i]].emplace_back(Y[i] + 1, W[i]);
    vector<vector<pair<int, ll>>> dp(n), dp2(n), pref(n);

    for (int x = 0; x < n; x++) {
        sort(a[x].begin(), a[x].end());
        a[x].emplace_back(n + 1, 0);
        ll sum = 0;
        for (auto [y, w]: a[x]) {
            sum += w;
            pref[x].emplace_back(y, sum);
        }
    }
    auto get = [&](int x, int l, int r) -> ll {
        if (l > r) return 0;
        int i = lower_bound(pref[x].begin(), pref[x].end(), make_pair(l, 0ll)) - pref[x].begin();
        int j = upper_bound(pref[x].begin(), pref[x].end(), make_pair(r, 0ll)) - pref[x].begin() - 1;
        if (i > j) return 0;
        return pref[x][j].ss - (i > 0 ? pref[x][i - 1].ss : 0ll);
    };
    for (auto [y, w]: a[0]) dp[0].emplace_back(y - 1, 0);

    ll ans = 0;
    for (int x = 1; x < n; x++) {
        // cout << '\t' << x << endl;
        for (int i = 0; i < a[x].size(); i++) {
            a[x][i].ff--;
            ll mx = 0;
            for (int j = 0; j < a[x - 1].size(); j++) {
                if (dp[x - 1][j].ff > a[x][i].ff) continue;
                mx = max(mx, dp[x - 1][j].ss + get(x - 1, dp[x - 1][j].ff + 1, a[x][i].ff));
                if (j < dp2[x - 1].size()) mx = max(mx, dp2[x - 1][j].ss);
            }
            dp[x].emplace_back(a[x][i].ff, mx);
            // cout << i << ' ' << a[x][i].ff << ' ' << dp[x].back().ss << endl;
            dp2[x].emplace_back(a[x][i].ff, dp[x - 1].back().ss + get(x, a[x][i].ff + 1, n));
            ans = max(ans, max(dp[x].back().ss, dp2[x].back().ss));
            a[x][i].ff++;
        }
    }

    return ans;

    
}

// g++ -o fish -O2 fish.cpp grader.cpp -std=c++17 && .\fish < input.txt > output.txt

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int i = 0; i < a[x].size(); i++) {
      |                         ~~^~~~~~~~~~~~~
fish.cpp:37:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |             for (int j = 0; j < a[x - 1].size(); j++) {
      |                             ~~^~~~~~~~~~~~~~~~~
fish.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |                 if (j < dp2[x - 1].size()) mx = max(mx, dp2[x - 1][j].ss);
      |                     ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 22108 KB Output is correct
2 Correct 24 ms 22108 KB Output is correct
3 Correct 41 ms 24660 KB Output is correct
4 Correct 38 ms 25296 KB Output is correct
5 Correct 62 ms 30804 KB Output is correct
6 Correct 54 ms 30200 KB Output is correct
7 Correct 57 ms 30804 KB Output is correct
8 Correct 72 ms 30804 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 22108 KB Output is correct
2 Correct 24 ms 22108 KB Output is correct
3 Correct 41 ms 24660 KB Output is correct
4 Correct 38 ms 25296 KB Output is correct
5 Correct 62 ms 30804 KB Output is correct
6 Correct 54 ms 30200 KB Output is correct
7 Correct 57 ms 30804 KB Output is correct
8 Correct 72 ms 30804 KB Output is correct
9 Incorrect 56 ms 30548 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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