oj.uz

Submission #1046684

# Submission time Handle Problem Language Result Execution time Memory
1046684 2024-08-06T20:19:43 Z Trent Catfish Farm (IOI22_fish) C++17
61 / 100
 686 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];
  }
  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));
      }
    }
  }
  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

# Verdict Execution time Memory Grader output
1 Runtime error 686 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 669 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 27736 KB Output is correct
2 Correct 24 ms 27740 KB Output is correct
3 Correct 30 ms 27100 KB Output is correct
4 Correct 28 ms 29336 KB Output is correct
5 Correct 39 ms 31732 KB Output is correct
6 Correct 35 ms 31068 KB Output is correct
7 Correct 36 ms 31568 KB Output is correct
8 Correct 39 ms 31492 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 508 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 344 KB Output is correct
12 Correct 0 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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 508 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 344 KB Output is correct
12 Correct 0 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 3928 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 8 ms 5708 KB Output is correct
18 Correct 9 ms 5724 KB Output is correct
19 Correct 10 ms 5724 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 8 ms 3932 KB Output is correct
22 Correct 15 ms 7516 KB Output is correct
23 Correct 4 ms 4188 KB Output is correct
24 Correct 7 ms 5212 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 3 ms 4228 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 508 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 344 KB Output is correct
12 Correct 0 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 3928 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 8 ms 5708 KB Output is correct
18 Correct 9 ms 5724 KB Output is correct
19 Correct 10 ms 5724 KB Output is correct
20 Correct 10 ms 5724 KB Output is correct
21 Correct 8 ms 3932 KB Output is correct
22 Correct 15 ms 7516 KB Output is correct
23 Correct 4 ms 4188 KB Output is correct
24 Correct 7 ms 5212 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 3 ms 4228 KB Output is correct
27 Correct 195 ms 353120 KB Output is correct
28 Correct 42 ms 31320 KB Output is correct
29 Correct 235 ms 365908 KB Output is correct
30 Correct 229 ms 365756 KB Output is correct
31 Correct 258 ms 365908 KB Output is correct
32 Correct 49 ms 24160 KB Output is correct
33 Correct 232 ms 365916 KB Output is correct
34 Correct 234 ms 365908 KB Output is correct
35 Correct 27 ms 24144 KB Output is correct
36 Correct 227 ms 365672 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 27736 KB Output is correct
2 Correct 24 ms 27740 KB Output is correct
3 Correct 30 ms 27100 KB Output is correct
4 Correct 28 ms 29336 KB Output is correct
5 Correct 39 ms 31732 KB Output is correct
6 Correct 35 ms 31068 KB Output is correct
7 Correct 36 ms 31568 KB Output is correct
8 Correct 39 ms 31492 KB Output is correct
9 Runtime error 678 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 686 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -