Submission #338424

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
338424	2020-12-23 05:54:03	KoD	Xylophone (JOI18_xylophone)	C++17	100 / 100	157 ms	98540 KiB

xylophone

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>
template <class T>
using Vec = std::vector<T>;
#ifdef __APPLE__ 
int query(int, int);
void answer(int, int);
#else 
#include "xylophone.h"
#endif
void solve(int N) {
    Vec<Vec<int>> memo(N, Vec<int>(N, -1));
    const auto ask = [&](int s, int t) {
        if (memo[s][t] != -1) {
            return memo[s][t];
        }
        return memo[s][t] = query(s + 1, t + 1);
    };
    const auto fill = [&](Vec<int> &vec) {
        for (int i = 2; i < N; ++i) {
            const auto a = ask(i - 2, i - 1);
            const auto b = ask(i - 1, i);
            const auto c = ask(i - 2, i);
            if (vec[i - 2] < vec[i - 1]) {
                if (a + b == c) {
                    vec[i] = vec[i - 1] + b;
                }
                else {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 36 / 36
• Subtask 3: 53 / 53