oj.uz

답안 #1079485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079485 2024-08-28T15:41:13 Z glupan 메기 농장 (IOI22_fish) C++17
9 / 100
 60 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][2];
      memset(dp,0,sizeof dp);
      dp[0][1] = grid[1];
      dp[0][0] = grid[0];
      fore(i,1,N) {
        dp[i][1] = max(dp[i-1][1]+grid[i+1]-grid[i],dp[i-1][0]+grid[i+1]);
        dp[i][0] = max(dp[i-1][1]+grid[i],dp[i-1][0]+grid[i]);
      }
      ans = max(dp[N-1][1],dp[N-1][0]);
    }
    return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2136 KB Output is correct
2 Correct 16 ms 2652 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 60 ms 7216 KB Output is correct
6 Correct 57 ms 7272 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 34 ms 6480 KB Output is correct
4 Correct 14 ms 2136 KB Output is correct
5 Correct 21 ms 2644 KB Output is correct
6 Correct 0 ms 348 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 1 ms 348 KB Output is correct
12 Correct 17 ms 3704 KB Output is correct
13 Correct 18 ms 4188 KB Output is correct
14 Correct 14 ms 3676 KB Output is correct
15 Correct 17 ms 4072 KB Output is correct
16 Correct 15 ms 3672 KB Output is correct
17 Correct 16 ms 3932 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 2652 KB 1st lines differ - on the 1st token, expected: '882019', found: '1764038'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '3'
9 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '3'
9 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '2', found: '3'
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 2 ms 2652 KB 1st lines differ - on the 1st token, expected: '882019', found: '1764038'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 2136 KB Output is correct
2 Correct 16 ms 2652 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 60 ms 7216 KB Output is correct
6 Correct 57 ms 7272 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 28 ms 5432 KB Output is correct
9 Correct 34 ms 6480 KB Output is correct
10 Correct 14 ms 2136 KB Output is correct
11 Correct 21 ms 2644 KB Output is correct
12 Correct 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 17 ms 3704 KB Output is correct
19 Correct 18 ms 4188 KB Output is correct
20 Correct 14 ms 3676 KB Output is correct
21 Correct 17 ms 4072 KB Output is correct
22 Correct 15 ms 3672 KB Output is correct
23 Correct 16 ms 3932 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Incorrect 2 ms 2652 KB 1st lines differ - on the 1st token, expected: '882019', found: '1764038'
26 Halted 0 ms 0 KB -