oj.uz

답안 #1079191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079191 2024-08-28T11:50:35 Z vjudge1 메기 농장 (IOI22_fish) C++17
3 / 100
 86 ms 13904 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 sum1=0,sum2=0;
        fore(i,0,M) {
            if(X[i] == 0)
                sum1+=W[i];
            else
                sum2+=W[i];
        }
        ans = max(sum1,sum2);
    } else {
        long long dp[N+5];
        memset(dp,0,sizeof dp);
        long long grid[N+5];
        memset(grid,0,sizeof grid);
        fore(i,0,M)
            grid[X[i]] = W[i];
        fore(i,0,N) {
            dp[i] = grid[i];
            if(i > 1)
                dp[i] += dp[i-2];
            if(i)
                dp[i] = max(dp[i],dp[i-1]);
        }
        ans = dp[N-1];
    }
    return ans;
  return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 3668 KB Output is correct
2 Correct 18 ms 4436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 86 ms 13668 KB Output is correct
6 Correct 60 ms 13904 KB Output is correct

Subtask #2
0 / 6.0

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

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 10 ms 3884 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 348 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 348 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 348 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 10 ms 3884 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 14 ms 3668 KB Output is correct
2 Correct 18 ms 4436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 86 ms 13668 KB Output is correct
6 Correct 60 ms 13904 KB Output is correct
7 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -