제출 #1046653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1046653		Trent	메기 농장 (IOI22_fish)	C++17	0 / 100	824 ms	2097152 KiB

fish

#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) {
  vvi wp(N, vi(N));
  forR(i, M) wp[X[i]][Y[i]] = W[i];
  int MH = Y[0] + 1;
  for(int i : Y) MH = max(MH, i + 1);
  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) {
    I[i][0] = D[i][0] = -INF;
    REP(h, 1, MH+1) {
      I[i][h] = 0;
      if(i == 0) I[i][h] = 0;
      else {
        forR(k, MH+1) {
          ll tot = E[i-1][k];
          REP(y, k, h) tot += wp[i-1][y];
          I[i][h] = max(I[i][h], tot);
        }
        forR(k, h+1) {
          ll tot = I[i-1][k];
          REP(y, k, h) tot += wp[i-1][y];
          I[i][h] = max(I[i][h], tot);
        }
      }
    }
    REP(h, 1, MH+1) {
      D[i][h] = 0;
      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]);
          REP(y, h, k) tot += wp[i][y];
          D[i][h] = max(D[i][h], tot);
        }
      }
    }
    forR(h, MH+1) {
      E[i][h] = 0;
      if(i == 0) E[i][h] = 0;
      else {
        ll tot = max(I[i-1][h], D[i-1][h]);
        forR(y, h) tot += wp[i][y];
        E[i][h] = max(E[i][h], tot);
      }
    }
  }
  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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16