oj.uz

답안 #652471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652471 2022-10-22T17:25:09 Z Blagoj 메기 농장 (IOI22_fish) C++17
9 / 100
 94 ms 8048 KB 
#include "fish.h"
#include <bits/stdc++.h>
 
using namespace std;
 
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  
  bool Even = true, Less = true;
  for (auto x : X)
  {
    if (x % 2 != 0)
    {
      Even = false;
    }
    if (x > 1)
    {
      Less = false;
    }
  } 
  if (Even)
  {
    long long sum = 0;
    for (auto x : W)
    {
      sum += x;
    }
    return sum;
  }
  if (Less)
  {
    long long m[N + 3][3];
    memset(m, 0, sizeof(m));
    for (int i = 0; i < M; i++)
    {
      m[Y[i]][X[i]] = W[i];
    }
    for (int i = 1; i < N; i++)
    {
      m[i][0] += m[i - 1][0];
      m[i][1] += m[i - 1][1];
    }
    long long ans = max(m[N - 1][0], m[N - 1][1]);
    if (N == 2)
    {
      return ans;
    }
    for (int i = 0; i < N; i++)
    {
      ans = max(ans, m[i][0] + m[N - 1][1] - m[i][1]);
    }
    return ans;
  }
  long long dp[N + 3], p[N + 3];
  memset(dp, 0, sizeof(dp));
  memset(p, 0, sizeof(p));
  for (int i = 0; i < M; i++)
  {
    p[X[i]] = W[i];
  }
  dp[0] = p[0];
  dp[1] = max(p[0], p[1]);
  dp[2] = max(dp[0] + p[2], dp[1]);
  for (int i = 3; i < N; i++)
  {
    dp[i] = max({dp[i - 3] + p[i - 1],dp[i - 2] + p[i], dp[i - 1]});
  }
  return dp[N - 1];
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3168 KB Output is correct
2 Correct 32 ms 3572 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 93 ms 8048 KB Output is correct
6 Correct 94 ms 8048 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 292 KB Output is correct
2 Correct 57 ms 7536 KB Output is correct
3 Correct 58 ms 7768 KB Output is correct
4 Correct 27 ms 2644 KB Output is correct
5 Correct 35 ms 3144 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 25 ms 4788 KB Output is correct
13 Correct 31 ms 5472 KB Output is correct
14 Correct 27 ms 4772 KB Output is correct
15 Correct 31 ms 5208 KB Output is correct
16 Correct 27 ms 4816 KB Output is correct
17 Correct 33 ms 5184 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 18 ms 3472 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 18 ms 3472 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3168 KB Output is correct
2 Correct 32 ms 3572 KB Output is correct
3 Correct 1 ms 296 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 93 ms 8048 KB Output is correct
6 Correct 94 ms 8048 KB Output is correct
7 Correct 1 ms 292 KB Output is correct
8 Correct 57 ms 7536 KB Output is correct
9 Correct 58 ms 7768 KB Output is correct
10 Correct 27 ms 2644 KB Output is correct
11 Correct 35 ms 3144 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 25 ms 4788 KB Output is correct
19 Correct 31 ms 5472 KB Output is correct
20 Correct 27 ms 4772 KB Output is correct
21 Correct 31 ms 5208 KB Output is correct
22 Correct 27 ms 4816 KB Output is correct
23 Correct 33 ms 5184 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Incorrect 18 ms 3472 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
27 Halted 0 ms 0 KB -