oj.uz

답안 #654809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
654809 2022-11-01T17:04:35 Z t6twotwo 메기 농장 (IOI22_fish) C++17
35 / 100
 822 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
const long long inf = -(1LL << 50);
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector P(n, vector<int>(n + 1));
  for (int i = 0; i < m; i++) {
    P[x[i]][y[i] + 1] = w[i];
  }
  vector s(n, vector<long long>(n + 2));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= n; j++) {
      s[i][j + 1] = s[i][j] + P[i][j];
    }
  }
  auto range_sum = [&](int i, int l, int r) -> long long {
    if (i == -1) {
      return 0;
    }
    return s[i][r + 1] - s[i][l + 1];
  };
  vector<vector<int>> b(n);
  for (int i = 0; i < m; i++) {
    b[x[i]].push_back(i);
  }
  vector d(n, vector<int>{0});
  vector<vector<int>> r(n), p(n);
  for (int i = 0; i < n; i++) {
    sort(b[i].begin(), b[i].end(), [&](int j, int k) {
      return y[j] < y[k];
    });
    for (int j : b[i]) {
      r[i].push_back(y[j] + 1);
      p[i].push_back(w[j]);
      if (i > 0) {
        d[i - 1].push_back(y[j] + 1);
      }
      if (i < n - 1) {
        d[i + 1].push_back(y[j] + 1);
      }
    }
  }
  vector<vector<long long>> ssum(n), psum(n);
  for (int i = 0; i < n; i++) {
    int k = p[i].size();
    psum[i] = vector<long long>(k + 1);
    ssum[i] = vector<long long>(k + 1);
    for (int j = 0; j < k; j++) {
      psum[i][j + 1] = psum[i][j] + p[i][j];
    }
    for (int j = k - 1; j >= 0; j--) {
      ssum[i][j] = ssum[i][j + 1] + p[i][j];
    }
  }
  // auto suf_sum = [&](int i, int x) -> long long {
  //   if (i == -1) {
  //     return 0;
  //   }
  //   long long ans = 0;
  //   for (int j = 0; j < p[i].size(); j++) {
  //     if (r[i][j] > x) {
  //       ans += p[i][j];
  //     }
  //   }
  //   return ans;
  //   return ssum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
  // };
  // auto pre_sum = [&](int i, int x) -> long long {
  //   if (i == -1) {
  //     return 0;
  //   }
  //   long long ans = 0;
  //   for (int j = 0; j < p[i].size(); j++) {
  //     if (r[i][j] <= x) {
  //       ans += p[i][j];
  //     }
  //   }
  //   return ans;
  //   return psum[i][upper_bound(r[i].begin(), r[i].end(), x) - r[i].begin()];
  // };
  vector<int> e{0};
  vector<array<long long, 2>> dp{{0, 0}};
  for (int i = 0; i < n; i++) {
    auto pd = dp;
    int l = d[i].size();
    dp = vector(l, array<long long, 2>{inf, inf});
    int k = pd.size();
    vector<long long> pmax(k + 1, inf);
    for (int j = 0; j < k; j++) {
      pmax[j + 1] = max(pmax[j], pd[j][0] + range_sum(i - 1, e[j], n)); //suf_sum(i - 1, e[j]));
    }
    vector<long long> smax(k + 1, inf);
    for (int j = k - 1; j >= 0; j--) {
      smax[j] = max(smax[j + 1], max(pd[j][0], pd[j][1]) - range_sum(i, e[j], n)); //suf_sum(i, e[j]));
    }
    for (int j = 0; j < k; j++) {
      dp[0][0] = max(dp[0][0], max(pd[j][0], pd[j][1]));
      dp[0][1] = max(dp[0][1], max(pd[j][0], pd[j][1]) + range_sum(i, 0, e[j])); //pre_sum(i, e[j]));
    }
    for (int j = 1; j < l; j++) {
      dp[j][0] = max({dp[j][0], max(pd[0][1], pd[0][0] + range_sum(i - 1, 0, d[i][j]) /*pre_sum(i - 1, d[i][j])*/), pmax[upper_bound(e.begin(), e.end(), d[i][j]) - e.begin()] - range_sum(i - 1, d[i][j], n)}); //suf_sum(i - 1, d[i][j])});
      dp[j][1] = max({dp[j][1], max(pd[0][1], pd[0][0] + range_sum(i - 1, 0, d[i][j]) /*pre_sum(i - 1, d[i][j])*/), smax[lower_bound(e.begin(), e.end(), d[i][j]) - e.begin()] + range_sum(i, d[i][j], n)}); //suf_sum(i, d[i][j])});
    }
    swap(e, d[i]);
  }
  long long ans = inf;
  for (auto v : dp) {
    ans = max(ans, max(v[0], v[1]));
  }
  return ans;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 799 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 212 KB Output is correct
2 Runtime error 822 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 2 ms 472 KB Output is correct
17 Correct 25 ms 4804 KB Output is correct
18 Correct 25 ms 5612 KB Output is correct
19 Correct 22 ms 5356 KB Output is correct
20 Correct 22 ms 5336 KB Output is correct
21 Correct 24 ms 5332 KB Output is correct
22 Correct 44 ms 9400 KB Output is correct
23 Correct 6 ms 2132 KB Output is correct
24 Correct 17 ms 3660 KB Output is correct
25 Correct 2 ms 1492 KB Output is correct
26 Correct 6 ms 2080 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 220 KB Output is correct
3 Correct 1 ms 216 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 2 ms 1492 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 2 ms 1492 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 ms 1496 KB Output is correct
15 Correct 1 ms 1368 KB Output is correct
16 Correct 2 ms 472 KB Output is correct
17 Correct 25 ms 4804 KB Output is correct
18 Correct 25 ms 5612 KB Output is correct
19 Correct 22 ms 5356 KB Output is correct
20 Correct 22 ms 5336 KB Output is correct
21 Correct 24 ms 5332 KB Output is correct
22 Correct 44 ms 9400 KB Output is correct
23 Correct 6 ms 2132 KB Output is correct
24 Correct 17 ms 3660 KB Output is correct
25 Correct 2 ms 1492 KB Output is correct
26 Correct 6 ms 2080 KB Output is correct
27 Correct 68 ms 107228 KB Output is correct
28 Correct 118 ms 26684 KB Output is correct
29 Correct 243 ms 132768 KB Output is correct
30 Incorrect 220 ms 131788 KB 1st lines differ - on the 1st token, expected: '102439236138254', found: '102437773898393'
31 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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