Submission #629863

#	Time	Username	Problem	Language	Result	Execution time	Memory
629863		europium	Catfish Farm (IOI22_fish)	C++17	6 / 100	338 ms	24488 KiB

fish

#include "fish.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <cmath>
#include<iterator>
#include <set>
#include <map>
#include <math.h>
#include <iomanip>
#include <unordered_set>
using namespace std;

using ll = long long;

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w){

    map<ll,ll> zero, one;
    ll one_sum = 0;

    set<ll> y_cor;

    for (int i = 0; i < m; i++){
        if (x[i] == 0) zero[y[i]] = w[i];
        else{
            one[y[i]] = w[i];
            one_sum += w[i];
        }
        y_cor.insert(y[i]);
    }

    ll curr_zero = 0, curr_one = 0, ans = one_sum;

    for (auto y_pos : y_cor){
        curr_zero += zero[y_pos];
        curr_one += one[y_pos];

        // cout << y_pos << ' ' << curr_zero << ' ' << curr_one << ' ' << curr_zero + one_sum - curr_one <<  '\n';
        ans = max(ans, curr_zero + one_sum - curr_one);
    }

    if (n == 2) return max(curr_zero, one_sum);
    return ans;
}

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