oj.uz

답안 #1046691

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046691 2024-08-06T20:29:40 Z Trent 메기 농장 (IOI22_fish) C++17
61 / 100
 680 ms 2097152 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)
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;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  int MH = Y[0] + 1;
  for(int i : Y) MH = max(MH, i + 1);
  vvll wp(N, vll(MH));
  vvll wpsa(N, vll(MH));
  forR(i, M) wp[X[i]][Y[i]] = W[i];
  forR(x, N) {
    wpsa[x][0] = wp[x][0];
    REP(y, 1, MH) wpsa[x][y] = wpsa[x][y-1] + wp[x][y];
  }

  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);
    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, vll(MH+1)), D(N, vll(MH+1)), E(N, vll(MH+1));
  // h = HEIGHT, not the index of last element!
  forR(i, N) {
    ll besIE = -INF, besII = -INF;
    if(i > 0) {
      forR(k, MH+1) besIE = max(besIE, E[i-1][k] - (k > 0 ? wpsa[i-1][k-1] : 0));
    }
    REP(h, 1, MH+1) {
      if(i == 0) I[i][h] = 0;
      else {
        I[i][h] = max(I[i][h], besIE + wpsa[i-1][h-1]);
        besII = max(besII, I[i-1][h]- (h > 0 ? wpsa[i-1][h-1] : 0));
        I[i][h] = max(I[i][h], besII + wpsa[i-1][h-1]);
      }
    }

    ll besD = -INF;
    for(int h = MH; h > 0; --h) {
      if(i == 0) D[i][h] = 0;
      else {
        if(h + 1 <= MH) {
          besD = max(besD, max(I[i-1][h+1], D[i-1][h+1]) + wpsa[i][h]);
        }
        D[i][h] = max(D[i][h], besD - (h > 0 ? wpsa[i][h-1] : 0));
      }
    }

    ll besE = -INF;
    if(i > 0) {
      forR(y, MH+1) besE = max(besE, E[i-1][y]);
    }
    forR(h, MH+1) {
      if(i == 0) E[i][h] = 0;
      else {
        ll tot = max(I[i-1][h], D[i-1][h]) + (h > 0 ? wpsa[i][h-1] : 0);
        // forR(y, h) tot += wp[i][y];
        E[i][h] = max(E[i][h], max(tot, besE));
      }
    }

    // forR(h, MH+1) if(!sCare[i].count(h)) I[i][h] = D[i][h] = E[i][h] = 0;
  }
  ll mx = 0;
  REP(h, 1, MH+1) mx = max(mx, max(I[N-1][h], D[N-1][h]));
  forR(h, MH+1) mx = max(mx, E[N-1][h]);
  return mx;
}

Compilation message

fish.cpp:2:25: warning: extra tokens at end of #include directive
    2 | #include "bits/stdc++.h";
      |                         ^

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 680 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 670 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 37212 KB Output is correct
2 Correct 28 ms 37136 KB Output is correct
3 Correct 39 ms 38480 KB Output is correct
4 Correct 39 ms 40664 KB Output is correct
5 Correct 56 ms 45652 KB Output is correct
6 Correct 51 ms 45140 KB Output is correct
7 Correct 53 ms 45656 KB Output is correct
8 Correct 54 ms 45648 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 1 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 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 1 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 26 ms 8704 KB Output is correct
18 Correct 21 ms 8136 KB Output is correct
19 Correct 20 ms 8320 KB Output is correct
20 Correct 19 ms 7764 KB Output is correct
21 Correct 19 ms 5980 KB Output is correct
22 Correct 39 ms 11724 KB Output is correct
23 Correct 10 ms 5464 KB Output is correct
24 Correct 19 ms 8028 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 5 ms 5212 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 1 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 2 ms 3932 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 26 ms 8704 KB Output is correct
18 Correct 21 ms 8136 KB Output is correct
19 Correct 20 ms 8320 KB Output is correct
20 Correct 19 ms 7764 KB Output is correct
21 Correct 19 ms 5980 KB Output is correct
22 Correct 39 ms 11724 KB Output is correct
23 Correct 10 ms 5464 KB Output is correct
24 Correct 19 ms 8028 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 5 ms 5212 KB Output is correct
27 Correct 181 ms 353876 KB Output is correct
28 Correct 136 ms 43856 KB Output is correct
29 Correct 415 ms 388712 KB Output is correct
30 Correct 507 ms 405848 KB Output is correct
31 Correct 519 ms 405356 KB Output is correct
32 Correct 183 ms 38224 KB Output is correct
33 Correct 543 ms 406608 KB Output is correct
34 Correct 523 ms 406760 KB Output is correct
35 Correct 83 ms 36436 KB Output is correct
36 Correct 484 ms 400212 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 37212 KB Output is correct
2 Correct 28 ms 37136 KB Output is correct
3 Correct 39 ms 38480 KB Output is correct
4 Correct 39 ms 40664 KB Output is correct
5 Correct 56 ms 45652 KB Output is correct
6 Correct 51 ms 45140 KB Output is correct
7 Correct 53 ms 45656 KB Output is correct
8 Correct 54 ms 45648 KB Output is correct
9 Runtime error 666 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 680 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -