oj.uz

답안 #1079292

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079292 2024-08-28T12:41:13 Z glupan 메기 농장 (IOI22_fish) C++17
9 / 100
 53 ms 7272 KB 
#include "fish.h"

#include <bits/stdc++.h>

#define fore(i, l, r) for(int i=int(l); i<int(r); i++)

using namespace std;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
  long long ok=1,ok1=1;
    fore(i,0,M) {
        if(X[i] % 2)
            ok=0;
        if(X[i] > 1)
            ok1=0;
    }
    long long ans=0;
    if(ok)
      fore(i,0,M)
        ans+=W[i];
    else if(ok1) {
      long long grid[2][N+5];
      memset(grid,0,sizeof grid);
      fore(i,0,M)
        grid[X[i]][Y[i]] = W[i];
      long long sum1=0,sum2=0,temp1=0,temp2=0;
      if(N > 2) {
        fore(i,0,N) {
          sum1+=grid[0][i];
          sum2+=grid[1][i];
          if(sum1 >= sum2 and abs(sum1-sum2) >= abs(temp1-temp2)) {
            temp1=sum1;
            temp2=sum2;
          }
        }
        ans = sum2-temp2+temp1;
      } else {
        fore(i,0,N) {
          sum1+=grid[0][i];
          sum2+=grid[1][i];
        }
        return max(sum1,sum2);
      }
    } else {
      long long grid[N+5];
      memset(grid,0,sizeof grid);
      fore(i,0,M)
        grid[X[i]] = W[i];
      long long dp[N+5];
      memset(dp,0,sizeof dp);
      dp[1] = grid[0];
      fore(i,0,N) {
        dp[i] += grid[i+1];
        if(i>1)
          dp[i]+=dp[i-2];
        if(i)
          dp[i]=max(dp[i],dp[i-1]);
      }
      ans = dp[N-1];
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2140 KB Output is correct
2 Correct 16 ms 2648 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 52 ms 7272 KB Output is correct
6 Correct 53 ms 7248 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 28 ms 5432 KB Output is correct
3 Correct 36 ms 6624 KB Output is correct
4 Correct 14 ms 2136 KB Output is correct
5 Correct 16 ms 2652 KB Output is correct
6 Correct 0 ms 600 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 14 ms 3676 KB Output is correct
13 Correct 18 ms 4184 KB Output is correct
14 Correct 20 ms 3676 KB Output is correct
15 Correct 16 ms 4072 KB Output is correct
16 Correct 15 ms 3676 KB Output is correct
17 Correct 16 ms 4060 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Incorrect 11 ms 2908 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 344 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 344 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 344 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 348 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Incorrect 11 ms 2908 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 15 ms 2140 KB Output is correct
2 Correct 16 ms 2648 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 52 ms 7272 KB Output is correct
6 Correct 53 ms 7248 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 28 ms 5432 KB Output is correct
9 Correct 36 ms 6624 KB Output is correct
10 Correct 14 ms 2136 KB Output is correct
11 Correct 16 ms 2652 KB Output is correct
12 Correct 0 ms 600 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 14 ms 3676 KB Output is correct
19 Correct 18 ms 4184 KB Output is correct
20 Correct 20 ms 3676 KB Output is correct
21 Correct 16 ms 4072 KB Output is correct
22 Correct 15 ms 3676 KB Output is correct
23 Correct 16 ms 4060 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Incorrect 11 ms 2908 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16359027219341'
27 Halted 0 ms 0 KB -