제출 #631133

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
631133	2022-08-17 17:44:16	oliversommer	메기 농장 (IOI22_fish)	C++17	6 / 100	104 ms	24928 KiB

fish

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "fish.h"
#include <assert.h>
#include <algorithm>
#include <numeric>
#include <vector>
using namespace std;
struct Fish {
  int x, y, weight;
  bool operator<(const Fish& a) const {
    return y < a.y;  // x == a.x ? y < a.y : x < a.x;
  }
};
long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
  vector<Fish> all_fish(M);
  for (int i = 0; i < M; ++i) {
    all_fish[i] = {X[i], Y[i], W[i]};
  }
  // sort(all_fish.begin(), all_fish.end());
  vector<long long> pref_sum0(N + 1), pref_sum1(N + 1);
  int pivot = 0;
  for (int i = 0; i < M; ++i) {
    Fish& a = all_fish[i];
    assert(a.x == 0 || a.x == 1);
    if (a.x == 0) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• 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