제출 #722527

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
722527	2023-04-12 08:13:53	eltu0815	메기 농장 (IOI22_fish)	C++17	100 / 100	213 ms	54468 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 <bits/stdc++.h>
#define MAX 500005
#define INF (ll)(1e16)
using namespace std;
typedef long long ll;
int N, M;
ll up[MAX], down[MAX], sum[MAX], in[MAX], out[MAX];
vector<ll> X, Y, W;
vector<pair<int, ll> > pos[MAX];
long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y, std::vector<int> w) {
    N = n, M = m; X.resize(M); Y.resize(N + M + 1); W.resize(M);
    for(ll i = 0; i < M; ++i) X[i] = x[i] + 1, Y[i] = y[i] + 1, W[i] = w[i];
    for(ll i = 0; i < M; ++i) pos[X[i]].push_back({Y[i], W[i]});
    for(ll i = 1; i <= N; ++i) pos[i].push_back({N + 1, 0});
    for(ll i = 1; i <= N; ++i) sort(pos[i].begin(), pos[i].end());
    
    ll cnt = 0;
    for(ll i = 1; i <= N; ++i) {
        sum[++cnt] = pos[i][0].second; in[i] = cnt; Y[cnt] = pos[i][0].first;
        for(ll j = 1; j < (ll)pos[i].size(); ++j) {
            ++cnt;
            sum[cnt] = sum[cnt - 1] + pos[i][j].second;
            Y[cnt] = pos[i][j].first;
        }
        out[i] = cnt;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 3 / 3
• Subtask 2: 6 / 6
• Subtask 3: 9 / 9
• Subtask 4: 14 / 14
• Subtask 5: 21 / 21
• Subtask 6: 17 / 17
• Subtask 7: 14 / 14
• Subtask 8: 16 / 16