Submission #1166229

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1166229	2025-03-13 10:00:22	Hanksburger	Game (IOI13_game)	C++20	80 / 100	3900 ms	244984 KiB

game

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 "game.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
int leftchild1[10400000], rightchild1[10400000], leftchild2[10400000], rightchild2[10400000];
ll segtree[10400000], large=1e9, cnt;
ll createNode()
{
    return (cnt++);
}
void update2(ll i, ll l1, ll r1, ll l2, ll r2, ll x, ll y, ll z)
{
    if (l2==r2)
    {
        if (l1==r1)
            segtree[i]=z;
        else
            segtree[i]=gcd(segtree[leftchild1[i]], segtree[rightchild1[i]]);
        return;
    }
    ll mid=(l2+r2)/2;
    if (y<=mid)
    {
        if (!leftchild2[i])
            leftchild2[i]=createNode();
        leftchild1[leftchild2[i]]=leftchild2[leftchild1[i]];
        rightchild1[leftchild2[i]]=leftchild2[rightchild1[i]];
        update2(leftchild2[i], l1, r1, l2, mid, x, y, z);
    }
    else
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 10 / 10
• Subtask 2: 27 / 27
• Subtask 3: 26 / 26
• Subtask 4: 17 / 17
• Subtask 5: 0 / 20