제출 #1002336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002336		overwatch9	메기 농장 (IOI22_fish)	C++17	3 / 100	49 ms	13908 KiB

fish

#include "fish.h"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// vector <vector <pair <int, ll>>> fish;
// vector <vector <ll>> pfx;
// int n, m;
// ll get_sum(int l, int r, int col) {
//     int it = upper_bound(fish[col].begin(), fish[col].end(), l) - fish[col].begin();
//     it--;
//     int it2 = upper_bound(fish[col].begin(), fish[col].end(), r) - fish[col].begin();
//     it2--;
//     return pfx[col][it2] - pfx[col][it];
// }
vector <vector <ll>> dp;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
    // n = N;
    // m = M;
    // fish.resize(N+1);
    // pfx.resize(N+1);
    // dp = vector <vector <ll>> (N+1, vector <ll> (N+1, -1));
    ll ans = 0;
    for (int i = 0; i < M; i++) {
        // fish[X[i]+1].push_back({Y[i]+1, W[i]});
        ans += W[i];
    }
    return ans;
    // for (int i = 1; i <= N; i++) {
    //     fish[i].push_back(0);
    //     sort(fish[i].begin(), fish[i].end());
    //     for (int j = 1; j < fish[i].size(); j++)
    //         pfx[i][j] = pfx[i][j-1] + fish[i][j].second;
    // }
    
}

• Subtask 1: 3 / 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