oj.uz

답안 #1046737

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046737 2024-08-06T21:23:10 Z Trent 메기 농장 (IOI22_fish) C++17
84 / 100
 1000 ms 167388 KB 
#include "fish.h"
#include "bits/stdc++.h";
using namespace std;
#define forR(i, x) for(int i = 0; i < (x); ++i)
#define REP(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) x.begin(), x.end()
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int> vi;
typedef vector<vi> vvi;
struct pii{int a, b;};

ll INF = 1e16;

ll rSum(int i, vector<pii>& wx, vll& psa) {
  int ind = upper_bound(all(wx), i, [](int a, pii b){return a < b.a;}) - wx.begin();
  if(ind - 1 == -1) return 0;
  return psa[ind-1];
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  vector<vector<pii>> wx(N);
  forR(i, M) wx[X[i]].push_back({Y[i], W[i]});
  forR(i, N) sort(all(wx[i]), [](pii a, pii b){return a.a < b.a;});
  vvll wpsa(N);
  forR(i, N) if(!wx[i].empty()) {
    wpsa[i].push_back(wx[i][0].b);
    REP(j, 1, wx[i].size()) wpsa[i].push_back(wx[i][j].b + wpsa[i].back());
  }

  vector<set<int>> sCare(N);
  forR(i, M) {
    if(X[i] > 0) sCare[X[i]-1].insert(Y[i] + 1);
    if(X[i] + 1 < N) sCare[X[i] + 1].insert(Y[i] + 1);
    if(X[i] > 1) sCare[X[i]-2].insert(Y[i] + 1);
    if(X[i] + 2 < N) sCare[X[i] + 2].insert(Y[i] + 1);
    sCare[X[i]].insert(Y[i]+1);
  }
  forR(i, N) sCare[i].insert(0);
  vector<vi> care(N);
  forR(i, N) for(int j : sCare[i]) care[i].push_back(j);
  vvll I(N), D(N), E(N);
  forR(i, N) I[i].resize(care[i].size()), D[i].resize(care[i].size()), E[i].resize(care[i].size());
  // h = HEIGHT, not the index of last element!
  forR(i, N) {
    ll besIE = -INF, besII = -INF;
    if(i > 0) {
      forR(ki, care[i-1].size()) {
        int k = care[i-1][ki];
        besIE = max(besIE, E[i-1][ki] - rSum(k-1, wx[i-1], wpsa[i-1]));
      }
    }
    int api = 0;
    forR(hi, care[i].size()) {
      int h = care[i][hi];
      if(h > 0) {
        if(i == 0) I[i][hi] = 0;
        else {
          I[i][hi] = max(I[i][hi], besIE + rSum(h-1, wx[i-1], wpsa[i-1]));
          while(api < care[i-1].size() && care[i-1][api] <= h) {
            int k = care[i-1][api];
            besII = max(besII, I[i-1][api] - rSum(k-1, wx[i-1], wpsa[i-1]));
            ++api;
          }
          I[i][hi] = max(I[i][hi], besII + rSum(h-1, wx[i-1], wpsa[i-1]));
        }
      }
    }

    api = (int) care[i-1].size() - 1;
    ll besD = -INF;
    for(int hi = (int) care[i].size() - 1; hi >= 0; --hi){
      int h = care[i][hi];
      if(h > 0) {
        if(i == 0) D[i][hi] = 0;
        else {
          while(api >= 0 && care[i-1][api] >= h + 1) {
            int k = care[i-1][api];
            besD = max(besD, max(I[i-1][api], D[i-1][api]) + rSum(k-1, wx[i], wpsa[i]));
            --api;
          }
          D[i][hi] = max(D[i][hi], besD - rSum(h-1, wx[i], wpsa[i]));
        }
      }
    }

    ll besE = -INF;
    if(i > 0) {
      forR(yi, care[i-1].size()) besE = max(besE, E[i-1][yi]);
    }
    forR(hi, care[i].size()){
      int h = care[i][hi];
      if(i == 0) E[i][hi] = 0;
      else {
        int pInd = lower_bound(all(care[i-1]), h) - care[i-1].begin();
        if(care[i-1][pInd] == h) {
          ll tot = max(I[i-1][pInd], D[i-1][pInd]) + rSum(h-1, wx[i], wpsa[i]);
          E[i][hi] = max(E[i][hi], max(tot, besE));
        }
      }
    }
  }
  ll mx = 0;
  forR(hi, care[N-1].size()) if(care[N-1][hi] > 0) mx = max(mx, max(I[N-1][hi], D[N-1][hi]));
  forR(hi, care[N-1].size()) mx = max(mx, E[N-1][hi]);
  return mx;
}

Compilation message

fish.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include "bits/stdc++.h";
      |                         ^
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:5:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<pii>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define REP(i, a, b) for(int i = (a); i < (b); ++i)
      |                                         ^
fish.cpp:30:5: note: in expansion of macro 'REP'
   30 |     REP(j, 1, wx[i].size()) wpsa[i].push_back(wx[i][j].b + wpsa[i].back());
      |     ^~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:50:7: note: in expansion of macro 'forR'
   50 |       forR(ki, care[i-1].size()) {
      |       ^~~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:56:5: note: in expansion of macro 'forR'
   56 |     forR(hi, care[i].size()) {
      |     ^~~~
fish.cpp:62:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |           while(api < care[i-1].size() && care[i-1][api] <= h) {
      |                 ~~~~^~~~~~~~~~~~~~~~~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:91:7: note: in expansion of macro 'forR'
   91 |       forR(yi, care[i-1].size()) besE = max(besE, E[i-1][yi]);
      |       ^~~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:93:5: note: in expansion of macro 'forR'
   93 |     forR(hi, care[i].size()){
      |     ^~~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:106:3: note: in expansion of macro 'forR'
  106 |   forR(hi, care[N-1].size()) if(care[N-1][hi] > 0) mx = max(mx, max(I[N-1][hi], D[N-1][hi]));
      |   ^~~~
fish.cpp:4:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define forR(i, x) for(int i = 0; i < (x); ++i)
      |                                     ^
fish.cpp:107:3: note: in expansion of macro 'forR'
  107 |   forR(hi, care[N-1].size()) mx = max(mx, E[N-1][hi]);
      |   ^~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 55364 KB Output is correct
2 Correct 149 ms 64552 KB Output is correct
3 Correct 26 ms 36444 KB Output is correct
4 Correct 32 ms 36444 KB Output is correct
5 Correct 895 ms 166536 KB Output is correct
6 Correct 655 ms 167388 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 239 ms 67672 KB Output is correct
3 Correct 303 ms 77432 KB Output is correct
4 Correct 133 ms 55448 KB Output is correct
5 Correct 152 ms 64324 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 412 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 27 ms 36456 KB Output is correct
11 Correct 26 ms 36440 KB Output is correct
12 Correct 155 ms 61608 KB Output is correct
13 Correct 209 ms 71756 KB Output is correct
14 Correct 151 ms 58356 KB Output is correct
15 Correct 125 ms 55828 KB Output is correct
16 Correct 148 ms 58440 KB Output is correct
17 Correct 162 ms 64852 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 36440 KB Output is correct
2 Correct 27 ms 36440 KB Output is correct
3 Correct 66 ms 40016 KB Output is correct
4 Correct 47 ms 41812 KB Output is correct
5 Correct 78 ms 49748 KB Output is correct
6 Correct 74 ms 49488 KB Output is correct
7 Correct 72 ms 49660 KB Output is correct
8 Correct 84 ms 49492 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 37 ms 7416 KB Output is correct
18 Correct 33 ms 7000 KB Output is correct
19 Correct 31 ms 7512 KB Output is correct
20 Correct 28 ms 6232 KB Output is correct
21 Correct 34 ms 6228 KB Output is correct
22 Correct 60 ms 11860 KB Output is correct
23 Correct 11 ms 3676 KB Output is correct
24 Correct 31 ms 8244 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 9 ms 2980 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 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 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 37 ms 7416 KB Output is correct
18 Correct 33 ms 7000 KB Output is correct
19 Correct 31 ms 7512 KB Output is correct
20 Correct 28 ms 6232 KB Output is correct
21 Correct 34 ms 6228 KB Output is correct
22 Correct 60 ms 11860 KB Output is correct
23 Correct 11 ms 3676 KB Output is correct
24 Correct 31 ms 8244 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 9 ms 2980 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 222 ms 34444 KB Output is correct
29 Correct 489 ms 65636 KB Output is correct
30 Correct 851 ms 118136 KB Output is correct
31 Correct 836 ms 115540 KB Output is correct
32 Correct 287 ms 41812 KB Output is correct
33 Correct 880 ms 122000 KB Output is correct
34 Correct 868 ms 122192 KB Output is correct
35 Correct 137 ms 32340 KB Output is correct
36 Correct 664 ms 94116 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 36440 KB Output is correct
2 Correct 27 ms 36440 KB Output is correct
3 Correct 66 ms 40016 KB Output is correct
4 Correct 47 ms 41812 KB Output is correct
5 Correct 78 ms 49748 KB Output is correct
6 Correct 74 ms 49488 KB Output is correct
7 Correct 72 ms 49660 KB Output is correct
8 Correct 84 ms 49492 KB Output is correct
9 Correct 143 ms 80720 KB Output is correct
10 Correct 56 ms 30128 KB Output is correct
11 Correct 129 ms 60260 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 26 ms 36380 KB Output is correct
19 Correct 25 ms 36444 KB Output is correct
20 Correct 26 ms 36384 KB Output is correct
21 Correct 30 ms 36444 KB Output is correct
22 Correct 168 ms 77948 KB Output is correct
23 Correct 214 ms 84440 KB Output is correct
24 Correct 253 ms 91604 KB Output is correct

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 116 ms 55364 KB Output is correct
2 Correct 149 ms 64552 KB Output is correct
3 Correct 26 ms 36444 KB Output is correct
4 Correct 32 ms 36444 KB Output is correct
5 Correct 895 ms 166536 KB Output is correct
6 Correct 655 ms 167388 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 239 ms 67672 KB Output is correct
9 Correct 303 ms 77432 KB Output is correct
10 Correct 133 ms 55448 KB Output is correct
11 Correct 152 ms 64324 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 412 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 27 ms 36456 KB Output is correct
17 Correct 26 ms 36440 KB Output is correct
18 Correct 155 ms 61608 KB Output is correct
19 Correct 209 ms 71756 KB Output is correct
20 Correct 151 ms 58356 KB Output is correct
21 Correct 125 ms 55828 KB Output is correct
22 Correct 148 ms 58440 KB Output is correct
23 Correct 162 ms 64852 KB Output is correct
24 Correct 26 ms 36440 KB Output is correct
25 Correct 27 ms 36440 KB Output is correct
26 Correct 66 ms 40016 KB Output is correct
27 Correct 47 ms 41812 KB Output is correct
28 Correct 78 ms 49748 KB Output is correct
29 Correct 74 ms 49488 KB Output is correct
30 Correct 72 ms 49660 KB Output is correct
31 Correct 84 ms 49492 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 37 ms 7416 KB Output is correct
49 Correct 33 ms 7000 KB Output is correct
50 Correct 31 ms 7512 KB Output is correct
51 Correct 28 ms 6232 KB Output is correct
52 Correct 34 ms 6228 KB Output is correct
53 Correct 60 ms 11860 KB Output is correct
54 Correct 11 ms 3676 KB Output is correct
55 Correct 31 ms 8244 KB Output is correct
56 Correct 1 ms 860 KB Output is correct
57 Correct 9 ms 2980 KB Output is correct
58 Correct 3 ms 2652 KB Output is correct
59 Correct 222 ms 34444 KB Output is correct
60 Correct 489 ms 65636 KB Output is correct
61 Correct 851 ms 118136 KB Output is correct
62 Correct 836 ms 115540 KB Output is correct
63 Correct 287 ms 41812 KB Output is correct
64 Correct 880 ms 122000 KB Output is correct
65 Correct 868 ms 122192 KB Output is correct
66 Correct 137 ms 32340 KB Output is correct
67 Correct 664 ms 94116 KB Output is correct
68 Correct 143 ms 80720 KB Output is correct
69 Correct 56 ms 30128 KB Output is correct
70 Correct 129 ms 60260 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 26 ms 36380 KB Output is correct
78 Correct 25 ms 36444 KB Output is correct
79 Correct 26 ms 36384 KB Output is correct
80 Correct 30 ms 36444 KB Output is correct
81 Correct 168 ms 77948 KB Output is correct
82 Correct 214 ms 84440 KB Output is correct
83 Correct 253 ms 91604 KB Output is correct
84 Execution timed out 1016 ms 141040 KB Time limit exceeded
85 Halted 0 ms 0 KB -