oj.uz

답안 #1079701

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079701 2024-08-28T21:41:52 Z ArthuroWich 메기 농장 (IOI22_fish) C++17
9 / 100
 101 ms 25188 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long int
vector<vector<int>> ind;
vector<vector<pair<int, int>>> pref;
int query(int i, int j) {
    pair<int, int> c = {j, INT64_MAX};
    auto ind1 = upper_bound(pref[i].begin(), pref[i].end(), c);
    ind1--;
    c = *ind1;
    return c.second;
}
int max_weights(int32_t N, int32_t M, vector<int32_t> X, vector<int32_t> Y, vector<int32_t> W) {
    int n = N, m = M;
    pref.resize(n+5, vector<pair<int, int>>(1, {INT64_MIN, 0}));
    ind.resize(n+5);
    for (int i = 0; i < m; i++) {
        pref[X[i]+1].push_back({Y[i], W[i]});
    }
    for (int i = 1; i <= n; i++) {
        sort(pref[i].begin(), pref[i].end());
    }
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < pref[i].size(); i++) {
            pref[i][j].second += pref[i][j-1].second;
        }
    }
    ind[0].push_back(-1);
    ind[n+1].push_back(-1);
    for (int i = 1; i <= n; i++) {
        for (auto [a, b] : pref[i-1]) {
            ind[i].push_back(max(-1LL, a));
        }
        for (auto [a, b] : pref[i+1]) {
            ind[i].push_back(max(-1LL, a));
        }
        sort(ind[i].begin(), ind[i].end());
        ind[i].erase(unique(ind[i].begin(), ind[i].end()), ind[i].end());
    }
    vector<vector<int>> dp(2, vector<int>(1, 0)); // 0 is increasing, 1 is decreasing, increasing can go to decreasing, decreasing cant go to increasing if next to eachother
    for (int i = 1; i <= n+1; i++) {
        vector<vector<int>> tdp(2, vector<int>(ind[i].size()+5, 0));
        int v = 0, k = 0;
        for (int j = 0; j < ind[i].size(); j++) {
            while(k < ind[i-1].size() && ind[i-1][k] <= ind[i][j]) {
                v = max(v, dp[0][k]-query(i-1, ind[i-1][k]));
                k++;
            }
            tdp[0][j] = max(v+query(i-1, ind[i][j]), dp[1][0]);
        }
        v = 0, k = ind[i-1].size();
        for (int j = ind[i].size()-1; j >= 0; j--) {
            while(k > 0 && ind[i-1][k-1] >= ind[i][j]) {
                k--;
                v = max(v, max(dp[0][k], dp[1][k])+query(i, ind[i-1][k]));
            }
            tdp[1][j] = v-query(i, ind[i][j]);
        }
        swap(dp[0], tdp[0]);
        swap(dp[1], tdp[1]);
    }
    int ans = max(dp[0][0], dp[1][0]);
    return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int32_t, int32_t, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:25:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int j = 1; j < pref[i].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~
fish.cpp:45:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 0; j < ind[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~~~
fish.cpp:46:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |             while(k < ind[i-1].size() && ind[i-1][k] <= ind[i][j]) {
      |                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 11356 KB Output is correct
2 Correct 20 ms 11384 KB Output is correct
3 Correct 38 ms 14420 KB Output is correct
4 Correct 31 ms 14164 KB Output is correct
5 Correct 53 ms 19284 KB Output is correct
6 Correct 51 ms 18512 KB Output is correct
7 Correct 61 ms 19084 KB Output is correct
8 Correct 57 ms 19324 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 11356 KB Output is correct
2 Correct 20 ms 11384 KB Output is correct
3 Correct 38 ms 14420 KB Output is correct
4 Correct 31 ms 14164 KB Output is correct
5 Correct 53 ms 19284 KB Output is correct
6 Correct 51 ms 18512 KB Output is correct
7 Correct 61 ms 19084 KB Output is correct
8 Correct 57 ms 19324 KB Output is correct
9 Correct 66 ms 18992 KB Output is correct
10 Incorrect 44 ms 15136 KB 1st lines differ - on the 1st token, expected: '36454348383152', found: '23310694292708'
11 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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