제출 #1241755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1241755		edga1	Catfish Farm (IOI22_fish)	C++20	9 / 100	17 ms	5448 KiB

fish

#include <bits/stdc++.h>
#include "fish.h"
#define ll long long
using namespace std;

struct fish{
    int x;
    int y;
    int w;
};

bool cmp(fish &a, fish &b){
    if(a.y!=b.y) return a.y<b.y;
    return a.x>b.x;
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    vector<int> w(N);
    for(int i=0; i<M; i++){
        w[X[i]]=W[i];
    }
    vector<ll> a(N),b(N),b2(N);
    a[0]=b[0]=0;
    for(int i=1; i<N; i++){
        a[i]=max({a[i-1],b[i-1],b2[i-1]+w[i-1]});
        b[i]=a[i-1]+w[i];
        b2[i]=b[i-1];
    }
    //for(int i=0; i<N; i++) cout<<a[i];
    return max(a[N-1],b[N-1]);
}

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