제출 #833661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833661		ALeonidou	메기 농장 (IOI22_fish)	C++17	0 / 100	22 ms	8092 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>

using namespace std;
#define ll int
#define sz(x) (ll)x.size()
#define F first
#define S second
#define pb push_back
#define MID ((l+r)/2)
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

typedef vector <ll> vi;
typedef vector <long long > vl;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;


void printVct(vl &v, string s = ""){
    cout<<s<<": ";
    for (ll i=0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

ll n,m;
vl dp, arr;
long long solve(ll c){
    if (c >= n) return 0;
    if (dp[c] == -1){
        dp[c] = max(arr[c] + solve(c+2), solve(c+1));
    }
    return dp[c];
}

long long max_weights(int N, int M, vi X, vi Y, vi W) {
    n= N, m =M;
    long long ans = 0;

    dp.assign(n, -1);
    arr.assign(n, 0);
    for (ll i =0 ; i<m; i++){
        arr[X[i]] = W[i];
    }
    
    ans = solve(0);

    return ans;
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16