oj.uz

답안 #635912

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635912 2022-08-27T11:18:01 Z slime 메기 농장 (IOI22_fish) C++17
9 / 100
 408 ms 94144 KB 
#include "fish.h"
#include "bits/stdc++.h"


#include <vector>

using namespace std;


vector<pair<int, long long> > cs[100010];

long long columnSum(int i, int R) {
  if(R < 0) return 0;
  if(cs[i].empty()) return 0;
  int lb = 0, rb = cs[i].size() - 1;
  while(lb < rb) {
    int mid = (lb + rb + 1) >> 1;
    if(cs[i][mid].first <= R) lb = mid;
    else rb = mid - 1;
  }
  if(cs[i][lb].first <= R) return cs[i][lb].second;
  else return 0;
}


vector<int> possible_heights[100010];


long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {

  for(int i=0; i<M; i++) {
    cs[X[i]].push_back({Y[i], W[i]});
    possible_heights[X[i]].push_back(Y[i]);
  }

  for(int i=0; i<N; i++) {
    possible_heights[i].push_back(0);
    possible_heights[i].push_back(N);
  }

  for(int i=0; i<N; i++) {
    sort(possible_heights[i].begin(), possible_heights[i].end());
  }

  for(int i=0; i<N; i++) sort(cs[i].begin(), cs[i].end());

  for(int i=0; i<N; i++) {
    for(int j=1; j<cs[i].size(); j++) {
      cs[i][j].second += cs[i][j-1].second;
    }
  }


  unordered_map<int, long long> DP[N][2];//0-> upwards, 1->downwards or plains

  for(int i=1; i<N; i++) {
    // State = 0: upwards (H[i-1] < H[i])
    {
      // H[i-1] > 0

      long long ptr = -1, qq = -1e14;
      for(int x: possible_heights[i]) {
        while(ptr + 1 < possible_heights[i-1].size() && possible_heights[i-1][ptr + 1] < x) {
          ptr++;
          int hh = possible_heights[i-1][ptr];
          if(hh > 0 || i == 1) qq = max(qq, DP[i-1][0][hh] - columnSum(i-1, hh-1)); // If i = 1, hh = 0 is ok
        }
        DP[i][0][x] = max(DP[i][0][x], qq + columnSum(i-1, x-1));
      }
      // H[i-1] = 0
      if(i > 1) {
        // y 0 x, y < x
        ptr = -1, qq = -1e14;
        for(int x: possible_heights[i]) {
          while(ptr + 1 < possible_heights[i-2].size() && possible_heights[i-2][ptr + 1] < x) {
            ptr++;
            int hh = possible_heights[i-2][ptr];
            long long vv = max(DP[i-2][0][hh], DP[i-2][1][hh]);
            qq = max(qq, vv);
          }
          DP[i][0][x] = max(DP[i][0][x], qq + columnSum(i-1, x-1));
        }
        // y 0 x, y > x
        ptr = possible_heights[i-2].size(), qq = -1e14;
        reverse(possible_heights[i].begin(), possible_heights[i].end());
        for(int x: possible_heights[i]) {
          while(ptr - 1 >= 0 && possible_heights[i-2][ptr - 1] > x) {
            ptr--;
            int hh = possible_heights[i-2][ptr];
            long long vv = max(DP[i-2][0][hh], DP[i-2][1][hh]);
            qq = max(qq, vv + columnSum(i-1, hh-1));
          }
          DP[i][0][x] = max(DP[i][0][x], qq);
        }
        reverse(possible_heights[i].begin(), possible_heights[i].end());
      }
    }
    // State = 1: downwards (H[i-1] >= H[i])
    {
      reverse(possible_heights[i].begin(), possible_heights[i].end());
      long long ptr = possible_heights[i-1].size(), qq = -1e14;
      for(int x: possible_heights[i]) {
        while(ptr - 1 >= 0 && possible_heights[i-1][ptr - 1] >= x) {
          ptr--;
          int hh = possible_heights[i-1][ptr];
          qq = max(qq, max(DP[i-1][0][hh], DP[i-1][1][hh]) + columnSum(i, hh-1));
        }
        DP[i][1][x] = max(DP[i][1][x], qq - columnSum(i, x-1));
      }
      reverse(possible_heights[i].begin(), possible_heights[i].end());
    }

    for(int x: possible_heights[i]) {
      DP[i][0][x] = max(DP[i][0][x], 0ll);
      DP[i][1][x] = max(DP[i][1][x], 0ll);
    }
  }

  long long ans = 0;
  for(int x: possible_heights[N-1]) ans = max(ans, max(DP[N-1][0][x], DP[N-1][1][x]));
  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:48:19: 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]
   48 |     for(int j=1; j<cs[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~
fish.cpp:63:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         while(ptr + 1 < possible_heights[i-1].size() && possible_heights[i-1][ptr + 1] < x) {
      |               ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fish.cpp:75:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |           while(ptr + 1 < possible_heights[i-2].size() && possible_heights[i-2][ptr + 1] < x) {
      |                 ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 58556 KB Output is correct
2 Correct 160 ms 66708 KB Output is correct
3 Correct 90 ms 53452 KB Output is correct
4 Correct 93 ms 53392 KB Output is correct
5 Correct 350 ms 94144 KB Output is correct
6 Correct 408 ms 88084 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 210 ms 68680 KB Output is correct
3 Correct 254 ms 80012 KB Output is correct
4 Correct 136 ms 58540 KB Output is correct
5 Correct 160 ms 66704 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 94 ms 53420 KB Output is correct
11 Correct 90 ms 53416 KB Output is correct
12 Correct 146 ms 58572 KB Output is correct
13 Correct 170 ms 66840 KB Output is correct
14 Correct 145 ms 58492 KB Output is correct
15 Correct 164 ms 65808 KB Output is correct
16 Correct 145 ms 58564 KB Output is correct
17 Correct 164 ms 65808 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 53452 KB Output is correct
2 Correct 91 ms 53416 KB Output is correct
3 Incorrect 119 ms 51500 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20897672610412'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 92 ms 53452 KB Output is correct
2 Correct 91 ms 53416 KB Output is correct
3 Incorrect 119 ms 51500 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20897672610412'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 58556 KB Output is correct
2 Correct 160 ms 66708 KB Output is correct
3 Correct 90 ms 53452 KB Output is correct
4 Correct 93 ms 53392 KB Output is correct
5 Correct 350 ms 94144 KB Output is correct
6 Correct 408 ms 88084 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 210 ms 68680 KB Output is correct
9 Correct 254 ms 80012 KB Output is correct
10 Correct 136 ms 58540 KB Output is correct
11 Correct 160 ms 66704 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 94 ms 53420 KB Output is correct
17 Correct 90 ms 53416 KB Output is correct
18 Correct 146 ms 58572 KB Output is correct
19 Correct 170 ms 66840 KB Output is correct
20 Correct 145 ms 58492 KB Output is correct
21 Correct 164 ms 65808 KB Output is correct
22 Correct 145 ms 58564 KB Output is correct
23 Correct 164 ms 65808 KB Output is correct
24 Correct 92 ms 53452 KB Output is correct
25 Correct 91 ms 53416 KB Output is correct
26 Incorrect 119 ms 51500 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20897672610412'
27 Halted 0 ms 0 KB -