Submission #1166249

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1166249	2025-03-13 11:16:18	Hanksburger	Game (IOI13_game)	C++20	63 / 100	2554 ms	321536 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;
struct node
{
    node *leftchild1=0, *rightchild1=0, *leftchild2=0, *rightchild2=0;
    ll segtree=0;
} root;
ll large=1e9;
void update2(node& i, ll l1, ll r1, ll l2, ll r2, ll x, ll y, ll z)
{
    //cout << "update2 " << l1 << ' ' << r1 << ' ' << l2 << ' ' << r2 << '\n';
    if (l2==r2)
    {
        if (l1==r1)
            i.segtree=z;
        else
            i.segtree=gcd(i.leftchild1==0?0:i.leftchild1->segtree, i.rightchild1==0?0:i.rightchild1->segtree);
        //cout << "segtree " << l1 << ' ' << r1 << ' ' << l2 << ' ' << r2 << " = " << i.segtree << '\n';
        return;
    }
    ll mid=(l2+r2)/2;
    if (y<=mid)
    {
        if (i.leftchild2==0)
            i.leftchild2=new node;
        //cout << "here\n";
        if (i.leftchild1!=0)
            i.leftchild2->leftchild1=i.leftchild1->leftchild2;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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