oj.uz

답안 #733140

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
733140 2023-04-30T07:07:40 Z puppy 메기 농장 (IOI22_fish) C++17
18 / 100
 327 ms 92620 KB 
#include "fish.h"

#include <vector>
#include <algorithm>
#include <iostream>
#define int long long
using namespace std;

vector<pair<int, int>> adj[100005];
vector<pair<int, int>> prf[100005];
const long long inf = 1e18;
int _N;
int get_prfsum(int X, int to)
{
    if (X <= 0 || _N+1 <= X) return 0;
    return (*--lower_bound(prf[X].begin(), prf[X].end(), make_pair(to, inf))).second;
}
vector<int> dp[100005][3];
vector<int> suf[100005];
vector<int> prf0[100005], prf1[100005], suf0[100005];
vector<int> cpx[100005];
long long max_weights(signed N, signed M, std::vector<signed> X, std::vector<signed> Y,
                      std::vector<signed> W) {
  _N= N;
  for (int i = 0; i < M; i++) {
    adj[X[i]+1].push_back(make_pair(Y[i] + 2, W[i]));
  }
  for (int i = 1; i <= N; i++) sort(adj[i].begin(), adj[i].end());
  for (int i = 1; i <= N; i++) {
    prf[i].resize(adj[i].size() + 1);
    prf[i][0] = make_pair(0, 0);
    for (int k = 1; k <= adj[i].size(); k++) {
        prf[i][k] = make_pair(adj[i][k-1].first, adj[i][k-1].second + prf[i][k-1].second);
    }
  }
  cpx[0].push_back(0);
  for (int i = 1; i <= N; i++) {
    cpx[i].push_back(0);
    for (pair<int, int> p:adj[i]) cpx[i].push_back(p.first - 1);
    cpx[i].push_back(N+1);
  }
  for (int i = 1; i <= N; i++) {
    dp[i][0].resize(cpx[i].size());
    dp[i][1].resize(cpx[i].size());
    dp[i][2].resize(cpx[i-1].size());
    suf[i].resize(dp[i][0].size());
    prf0[i].resize(dp[i][0].size());
    prf1[i].resize(dp[i][2].size());
    suf0[i].resize(dp[i][2].size());
  }
  for (int i = 2; i <= N; i++) {
    for (int j = 0; j < (int)dp[i-1][2].size(); j++) dp[i][2][0] = max(dp[i][2][0], dp[i-1][2][j]);
    for (int j = 1; j < (int)dp[i][2].size(); j++) {
        dp[i][2][j] = max(dp[i-1][0][j], dp[i-1][1][j]) + get_prfsum(i, cpx[i-1][j]);
    }
    for (int j = 1; j < (int)dp[i][1].size(); j++) {
        int height = cpx[i][j]; //height까지 끌어올리기
        //height보다 더 '큰' 최초의 인덱스 k를 찾자
        int low = upper_bound(cpx[i-1].begin(), cpx[i-1].end(), height) - cpx[i-1].begin();
        if (low == cpx[i-1].size()) {
            dp[i][1][j] = -inf;
            continue;
        }
        dp[i][1][j] = suf[i-1][low] - get_prfsum(i, cpx[i][j]);
    }
    for (int j = 1; j < (int)dp[i][0].size(); j++) {
        int ord = upper_bound(cpx[i-1].begin(), cpx[i-1].end(), cpx[i][j]) - cpx[i-1].begin();
        int M1 = ord == 1 ? -inf : (prf0[i-1][ord-1] + get_prfsum(i-1, cpx[i][j]));
        int ord2 = upper_bound(cpx[i-2].begin(), cpx[i-2].end(), cpx[i][j]) - cpx[i-2].begin();
        int M2 = prf1[i-1][ord2-1] + get_prfsum(i-1, cpx[i][j]);
        int M3 = (i == 2 || ord2 >= cpx[i-2].size()) ? -inf : suf0[i-1][ord2];
        dp[i][0][j] = max({M1, M2, M3});
    }
    for (int j = 1; j < (int)dp[i][1].size(); j++) {
        prf0[i][j] = dp[i][0][j] - get_prfsum(i, cpx[i][j]);
        suf[i][j] = max(dp[i][0][j], dp[i][1][j]) + get_prfsum(i+1, cpx[i][j]);
    }
    for (int j = 0; j < (int)dp[i][2].size(); j++) {
        prf1[i][j] = dp[i][2][j] - get_prfsum(i, cpx[i-1][j]);
        suf0[i][j] = dp[i][2][j];
    }
    for (int j = 2; j < (int)dp[i][1].size(); j++) prf0[i][j] = max(prf0[i][j], prf0[i][j-1]);
    for (int j = 1; j < (int)dp[i][2].size(); j++) prf1[i][j] = max(prf1[i][j], prf1[i][j-1]);
    for (int j = (int)dp[i][2].size() - 2; j >= 0; j--) suf0[i][j] = max(suf0[i][j], suf0[i][j+1]);
    for (int j = (int)dp[i][1].size() - 2; j >= 1; j--) suf[i][j] = max(suf[i][j], suf[i][j+1]);
  }
  int ans = 0;
  for (int i = 1; i < (int)dp[N][0].size(); i++) {
    ans = max(ans, dp[N][0][i]);
  }
  for (int i = 1; i < (int)dp[N][1].size(); i++) ans = max(ans, dp[N][1][i]);
  for (int i = 0; i < (int)dp[N][2].size(); i++) ans = max(ans, dp[N][2][i]);
  return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:32:23: 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]
   32 |     for (int k = 1; k <= adj[i].size(); k++) {
      |                     ~~^~~~~~~~~~~~~~~~
fish.cpp:60:17: 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]
   60 |         if (low == cpx[i-1].size()) {
      |             ~~~~^~~~~~~~~~~~~~~~~~
fish.cpp:71:34: 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]
   71 |         int M3 = (i == 2 || ord2 >= cpx[i-2].size()) ? -inf : suf0[i-1][ord2];
      |                             ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 58940 KB Output is correct
2 Correct 141 ms 63964 KB Output is correct
3 Correct 68 ms 51916 KB Output is correct
4 Correct 72 ms 51944 KB Output is correct
5 Correct 272 ms 87704 KB Output is correct
6 Correct 327 ms 92620 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23788 KB Output is correct
2 Correct 172 ms 70996 KB Output is correct
3 Correct 200 ms 78872 KB Output is correct
4 Correct 110 ms 60036 KB Output is correct
5 Correct 126 ms 65392 KB Output is correct
6 Correct 13 ms 23788 KB Output is correct
7 Correct 12 ms 23788 KB Output is correct
8 Correct 12 ms 23792 KB Output is correct
9 Correct 12 ms 23764 KB Output is correct
10 Correct 71 ms 51856 KB Output is correct
11 Correct 70 ms 51920 KB Output is correct
12 Correct 116 ms 60028 KB Output is correct
13 Correct 134 ms 65340 KB Output is correct
14 Correct 116 ms 60064 KB Output is correct
15 Correct 135 ms 64164 KB Output is correct
16 Correct 115 ms 59996 KB Output is correct
17 Correct 129 ms 64184 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 51916 KB Output is correct
2 Correct 75 ms 51944 KB Output is correct
3 Correct 94 ms 53944 KB Output is correct
4 Correct 86 ms 55628 KB Output is correct
5 Correct 125 ms 62156 KB Output is correct
6 Correct 116 ms 61484 KB Output is correct
7 Correct 121 ms 62068 KB Output is correct
8 Correct 131 ms 62108 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23788 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Incorrect 12 ms 23724 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23788 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Incorrect 12 ms 23724 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23764 KB Output is correct
2 Correct 14 ms 23768 KB Output is correct
3 Correct 12 ms 23764 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23788 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Incorrect 12 ms 23724 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 51916 KB Output is correct
2 Correct 75 ms 51944 KB Output is correct
3 Correct 94 ms 53944 KB Output is correct
4 Correct 86 ms 55628 KB Output is correct
5 Correct 125 ms 62156 KB Output is correct
6 Correct 116 ms 61484 KB Output is correct
7 Correct 121 ms 62068 KB Output is correct
8 Correct 131 ms 62108 KB Output is correct
9 Correct 127 ms 61844 KB Output is correct
10 Correct 120 ms 52328 KB Output is correct
11 Correct 181 ms 80788 KB Output is correct
12 Correct 13 ms 23776 KB Output is correct
13 Correct 12 ms 23764 KB Output is correct
14 Correct 13 ms 23768 KB Output is correct
15 Correct 13 ms 23792 KB Output is correct
16 Correct 15 ms 23764 KB Output is correct
17 Incorrect 12 ms 23792 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
18 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 58940 KB Output is correct
2 Correct 141 ms 63964 KB Output is correct
3 Correct 68 ms 51916 KB Output is correct
4 Correct 72 ms 51944 KB Output is correct
5 Correct 272 ms 87704 KB Output is correct
6 Correct 327 ms 92620 KB Output is correct
7 Correct 14 ms 23788 KB Output is correct
8 Correct 172 ms 70996 KB Output is correct
9 Correct 200 ms 78872 KB Output is correct
10 Correct 110 ms 60036 KB Output is correct
11 Correct 126 ms 65392 KB Output is correct
12 Correct 13 ms 23788 KB Output is correct
13 Correct 12 ms 23788 KB Output is correct
14 Correct 12 ms 23792 KB Output is correct
15 Correct 12 ms 23764 KB Output is correct
16 Correct 71 ms 51856 KB Output is correct
17 Correct 70 ms 51920 KB Output is correct
18 Correct 116 ms 60028 KB Output is correct
19 Correct 134 ms 65340 KB Output is correct
20 Correct 116 ms 60064 KB Output is correct
21 Correct 135 ms 64164 KB Output is correct
22 Correct 115 ms 59996 KB Output is correct
23 Correct 129 ms 64184 KB Output is correct
24 Correct 77 ms 51916 KB Output is correct
25 Correct 75 ms 51944 KB Output is correct
26 Correct 94 ms 53944 KB Output is correct
27 Correct 86 ms 55628 KB Output is correct
28 Correct 125 ms 62156 KB Output is correct
29 Correct 116 ms 61484 KB Output is correct
30 Correct 121 ms 62068 KB Output is correct
31 Correct 131 ms 62108 KB Output is correct
32 Correct 15 ms 23764 KB Output is correct
33 Correct 14 ms 23768 KB Output is correct
34 Correct 12 ms 23764 KB Output is correct
35 Correct 12 ms 23764 KB Output is correct
36 Correct 13 ms 23764 KB Output is correct
37 Correct 12 ms 23788 KB Output is correct
38 Correct 12 ms 23764 KB Output is correct
39 Incorrect 12 ms 23724 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
40 Halted 0 ms 0 KB -