Submission #933202

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
933202	2024-02-25 09:02:24	LucaIlie	Swap (BOI16_swap)	C++17	100 / 100	172 ms	49752 KiB

swap

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>
using namespace std;
const int MAX_N = 2e5;
int v[2 * MAX_N + 2];
unordered_map<int, int> dp[MAX_N + 1];
int DP( int i, int x ) {
    if ( dp[i][x] != 0 )
        return dp[i][x];
    if ( x < v[2 * i] && x < v[2 * i + 1] )
        dp[i][x] = i;
    else if ( v[2 * i] < v[2 * i + 1] )
        dp[i][x] = DP( 2 * i, x );
    else {
        if ( x < v[2 * i] )  {
            DP( 2 *  i, x );
            DP( 2 * i + 1, x );
            if ( dp[2 * i][x] < dp[2 * i + 1][x] )
                dp[i][x] = DP( 2 * i, x );
            else
                dp[i][x] = DP( 2 * i + 1, x );
        }
        else {
            DP( 2 * i, v[2 * i] );
            DP( 2 * i + 1, v[2 * i] );
            if ( dp[2 * i][v[2 * i]] < dp[2 * i + 1][v[2 * i]] )
                dp[i][x] = DP( 2 * i + 1, x );
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 27 / 27
• Subtask 4: 20 / 20
• Subtask 5: 32 / 32