oj.uz

답안 #1079283

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2136 KB Output is correct
2 Correct 33 ms 2652 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 55 ms 7252 KB Output is correct
6 Correct 63 ms 7252 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 33 ms 5460 KB Output is correct
3 Correct 36 ms 6492 KB Output is correct
4 Correct 14 ms 2140 KB Output is correct
5 Correct 31 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 0 ms 432 KB Output is correct
12 Correct 15 ms 3676 KB Output is correct
13 Correct 17 ms 4180 KB Output is correct
14 Correct 17 ms 3676 KB Output is correct
15 Correct 23 ms 4076 KB Output is correct
16 Correct 16 ms 3676 KB Output is correct
17 Correct 17 ms 3952 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '84248892991'
10 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 1880 KB Output is correct
3 Incorrect 10 ms 2908 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '31413834858038'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 2136 KB Output is correct
2 Correct 33 ms 2652 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 55 ms 7252 KB Output is correct
6 Correct 63 ms 7252 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 33 ms 5460 KB Output is correct
9 Correct 36 ms 6492 KB Output is correct
10 Correct 14 ms 2140 KB Output is correct
11 Correct 31 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 0 ms 432 KB Output is correct
18 Correct 15 ms 3676 KB Output is correct
19 Correct 17 ms 4180 KB Output is correct
20 Correct 17 ms 3676 KB Output is correct
21 Correct 23 ms 4076 KB Output is correct
22 Correct 16 ms 3676 KB Output is correct
23 Correct 17 ms 3952 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 1880 KB Output is correct
26 Incorrect 10 ms 2908 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '31413834858038'
27 Halted 0 ms 0 KB -