oj.uz

답안 #1046668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046668 2024-08-06T20:03:48 Z Trent 메기 농장 (IOI22_fish) C++17
44 / 100
 1000 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) {
    REP(h, 1, MH+1) {
      if(i == 0) I[i][h] = 0;
      else {
        forR(k, MH+1) {
          ll tot = E[i-1][k] + wpsa[i-1][h-1] - (k > 0 ? wpsa[i-1][k-1] : 0);
          // REP(y, k, h) tot += wp[i-1][y];
          I[i][h] = max(I[i][h], tot);
        }
        REP(k, 1, h+1) {
          ll tot = I[i-1][k] + wpsa[i-1][h-1] - (k > 0 ? wpsa[i-1][k-1] : 0);
          // REP(y, k, h) tot += wp[i-1][y];
          I[i][h] = max(I[i][h], tot);
        }
      }
    }
    REP(h, 1, MH+1) {
      if(i == 0) D[i][h] = 0;
      else {
        REP(k, h+1, MH+1) {
          ll tot = max(I[i-1][k], D[i-1][k]) + wpsa[i][k-1] - (h > 0 ? wpsa[i][h-1] : 0);
          // REP(y, h, k) tot += wp[i][y];
          D[i][h] = max(D[i][h], tot);
        }
      }
    }
    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], tot);
        forR(y, MH+1) E[i][h] = max(E[i][h], E[i-1][y]);
      }
    }
  }
  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 655 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 662 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 27740 KB Output is correct
2 Correct 22 ms 27740 KB Output is correct
3 Correct 29 ms 26196 KB Output is correct
4 Correct 33 ms 29276 KB Output is correct
5 Correct 38 ms 31572 KB Output is correct
6 Correct 35 ms 31060 KB Output is correct
7 Correct 37 ms 31568 KB Output is correct
8 Correct 37 ms 31700 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 600 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 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 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 600 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 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 51 ms 3932 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 58 ms 5856 KB Output is correct
18 Correct 58 ms 5720 KB Output is correct
19 Correct 61 ms 5724 KB Output is correct
20 Correct 58 ms 5720 KB Output is correct
21 Correct 20 ms 3928 KB Output is correct
22 Correct 65 ms 7632 KB Output is correct
23 Correct 52 ms 4188 KB Output is correct
24 Correct 57 ms 5212 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 53 ms 4336 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 600 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 348 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 51 ms 3932 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 58 ms 5856 KB Output is correct
18 Correct 58 ms 5720 KB Output is correct
19 Correct 61 ms 5724 KB Output is correct
20 Correct 58 ms 5720 KB Output is correct
21 Correct 20 ms 3928 KB Output is correct
22 Correct 65 ms 7632 KB Output is correct
23 Correct 52 ms 4188 KB Output is correct
24 Correct 57 ms 5212 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 53 ms 4336 KB Output is correct
27 Execution timed out 1040 ms 353104 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 27740 KB Output is correct
2 Correct 22 ms 27740 KB Output is correct
3 Correct 29 ms 26196 KB Output is correct
4 Correct 33 ms 29276 KB Output is correct
5 Correct 38 ms 31572 KB Output is correct
6 Correct 35 ms 31060 KB Output is correct
7 Correct 37 ms 31568 KB Output is correct
8 Correct 37 ms 31700 KB Output is correct
9 Runtime error 682 ms 2097152 KB Execution killed with signal 9
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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