제출 #1180574

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180574		madamadam3	메기 농장 (IOI22_fish)	C++20	0 / 100	15 ms	4792 KiB

fish

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

using namespace std;

using vi = vector<int>;
typedef long long ll;
#define sz(x) (int) (x).size()
#define all(x) (x).begin(), (x).end()
#define pb push_back



int N, M;
vi X, Y, W;

bool cmp(int a, int b) { // compare two fish in the same col
  return Y[a] < Y[b];
}

ll max_weights(int _N, int _M, vi _X, vi _Y, vi _W) {
  N = _N; M = _M; X = _X; Y = _Y; for (int i = 0; i < M; i++) W.pb(ll(_W[i]));

  // subtask 2: x[i] <= 1: either use everything in col0, or col1 (as using 1 means you cant use the other)
  ll c1 = 0;
  ll fish[2][N];
  for (int i = 0; i < M; i++) {
    // cout << "i: " << i << " x: " << X[i] << " y: " << Y[i] << " W: " << W[i] << "\n";
    if (X[i] == 1) {
      c1 += W[i];
      fish[1][Y[i]] = W[i];
    } else if (X[i] == 0) {
      fish[0][Y[i]] = W[i];
    }
  }

  ll c0 = 0;
  ll ans = c1;

  for (int i = 0; i < N; i++) {
    c1 -= fish[1][i];
    c0 += fish[0][i];
    ans = max(ans, c0 + c1);
  }

  return max(ans, c1);
}

• 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