oj.uz

답안 #652466

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
652466 2022-10-22T17:18:45 Z Blagoj 메기 농장 (IOI22_fish) C++17
9 / 100
 88 ms 7264 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;
  long long sum1 = 0, sum2 = 0;
  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]);
  for (int i = 2; i < N; i++)
  {
    dp[i] = max(dp[i - 2] + p[i], dp[i - 1]);
  }
  return dp[N - 1];
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:9:13: warning: unused variable 'sum1' [-Wunused-variable]
    9 |   long long sum1 = 0, sum2 = 0;
      |             ^~~~
fish.cpp:9:23: warning: unused variable 'sum2' [-Wunused-variable]
    9 |   long long sum1 = 0, sum2 = 0;
      |                       ^~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2124 KB Output is correct
2 Correct 29 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 88 ms 7264 KB Output is correct
6 Correct 84 ms 7244 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 52 ms 6164 KB Output is correct
3 Correct 57 ms 7252 KB Output is correct
4 Correct 26 ms 2152 KB Output is correct
5 Correct 28 ms 2636 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 26 ms 4216 KB Output is correct
13 Correct 28 ms 4944 KB Output is correct
14 Correct 27 ms 4212 KB Output is correct
15 Correct 29 ms 4688 KB Output is correct
16 Correct 25 ms 4216 KB Output is correct
17 Correct 29 ms 4680 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 14 ms 2864 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 0 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 0 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 0 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 14 ms 2864 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 22 ms 2124 KB Output is correct
2 Correct 29 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 88 ms 7264 KB Output is correct
6 Correct 84 ms 7244 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 52 ms 6164 KB Output is correct
9 Correct 57 ms 7252 KB Output is correct
10 Correct 26 ms 2152 KB Output is correct
11 Correct 28 ms 2636 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 26 ms 4216 KB Output is correct
19 Correct 28 ms 4944 KB Output is correct
20 Correct 27 ms 4212 KB Output is correct
21 Correct 29 ms 4688 KB Output is correct
22 Correct 25 ms 4216 KB Output is correct
23 Correct 29 ms 4680 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 1748 KB Output is correct
26 Incorrect 14 ms 2864 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
27 Halted 0 ms 0 KB -