# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1216205 | vanea | 메기 농장 (IOI22_fish) | C++20 | 52 ms | 7240 KiB |
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
using ll = long long;
int n, m;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
n = N; m = M;
bool f = true, s = true, t = true;
for(int i = 0; i < m; i++) {
if(X[i] & 1) f = false;
if(X[i] > 1) s = false;
if(Y[i] != 0) t = false;
}
if(f) {
ll ans = 0;
for(int i = 0; i < m; i++) ans += W[i];
return ans;
}
if(s) {
ll f1 = 0, s1 = 0;
for(int i = 0; i < m; i++) {
if(X[i] == 0) f1++;
else s1++;
}
return max(s1, f1);
}
if(t) {
vector<array<ll, 2>> dp(m, {0, 0});
dp[0][0] = W[0];
for(int i = 1; i < m; i++) {
dp[i][0] = max(dp[i-1][0], dp[i-1][1] + W[i]);
dp[i][1] = W[i-1];
if(i >= 2) {
dp[i][1] = max({dp[i][1], dp[i-2][0]+W[i-1], dp[i-2][1]+W[i-1]});
}
}
return max(dp[m-1][0], dp[m-1][1]);
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |