제출 #712552

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

fish

#include "fish.h"
#include<bits/stdc++.h>
#include<iostream>
#include<math.h>
#include <vector>
using namespace std;
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,std::vector<int> w) {
    int mx1 = -1, mx2 = -1;
    vector<vector<long long>> grid(n, vector<long long>(2,0LL));
    for (int i = 0; i < m; i++) {
        if (x[i] == 0) mx1 = max(mx1, y[i]);
        else mx2 = max(mx2, y[i]);
        grid[y[i]][x[i]] = w[i];
    }
    if (mx1 == -1 || mx2 == -1) {
        long long ans = 0;
        for (int i = 0; i < m; i++) {
            ans += (long long)w[i];
        }
        return ans;
    }
    else {
        long long ans = 0;
        for (int i = min(mx1, mx2) + 1; i <= max(mx1, mx2) && i<=n-1; i++) {
            ans += grid[i][0] + grid[i][1];
        }
        long long meow0 = 0,meow1 = 0;
        for (int i = min(mx1, mx2); i >= 0;i--) {
            meow0 += grid[i][0];
            meow1 += grid[i][1];
        }
        return ans + max(meow0,meow1);
    }
}

• 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