제출 #751686

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
751686	2023-06-01 08:06:44	He_Huanglu	메기 농장 (IOI22_fish)	C++17	100 / 100	386 ms	40608 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 <bits/stdc++.h>
#define ii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 1e5 + 5;
long long f[3][2][2], g[3][2][2], res;
ii p[3][2][2], t[3][3];
vector <long long> col[N], pref[N], _h[N];
ii check(int i, int j, int k) {
    ii ret = t[0][i];
    if(!ret.fi) ret.fi = t[1][j].fi;
    else if(ret.fi == 2 && j) return {1e9, 1e9};
    if(!ret.se) ret.se = t[2][k].se;
    else if(ret.se == 1 && k) return {1e9, 1e9};
    return ret;
}
long long cal(int c, int h) {
    if(c < 0 || col[c].empty()) return 0;
    int it = lower_bound(_h[c].begin(), _h[c].end(), h) - _h[c].begin();
    return pref[c][it];
}
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
    t[0][2] = {1, 2};
    t[0][0].fi = 2; t[0][1].se = 1;
    t[1][1].fi = 1; t[2][1].se = 2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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