제출 #798769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798769		normankr07	Game (IOI13_game)	C++17	0 / 100	1 ms	212 KiB

game

#include "game.h"
#include <bits/stdc++.h>

int n;

int gcd(int x, int y)
{
    if (y == 0)
        return x;
    return gcd(y, x % y);
}
struct node1
{
    int l, r, ss;
    node1 *left, *right;
    node1(int _l, int _r)
    {
        l = _l;
        r = _r;
        ss = 0;
        left = right = NULL;
    }

    void down()
    {
        if (l != r && left == NULL)
        {
            int mid = (l + r) >> 1;
            left = new node1(l, mid);
            right = new node1(mid + 1, r);
        }
    }

    void update(int i, int v)
    {
        if (r < i || i < l)
            return;
        down();
        if (l == r)
        {
            ss = v;
            return;
        }
        left->update(i, v);
        right->update(i, v);
        ss = gcd(left->ss, right->ss);
    }

    int get(int a, int b)
    {
        if (r < a || b < l)
            return 0;
        down();
        if (a <= l && r <= b)
            return ss;
        return gcd(left->get(a, b), right->get(a, b));
    }
};
struct node2
{
    int l, r, ss;
    node2 *left, *right;
    node1 *node;
    node2(int _l, int _r)
    {
        l = _l;
        r = _r;
        ss = 0;
        left = right = NULL;
        node = new node1(1, n);
    }
    void down()
    {
        if (l != r && left == NULL)
        {
            int mid = (l + r) >> 1;
            left = new node2(l, mid);
            right = new node2(mid + 1, r);
        }
    }

    void update(int x, int y, int val)
    {
        if (r < x || x < l)
            return;
        down();
        node->update(y, val);
        if (l == r)
            return;
        left->update(x, y, val);
        right->update(x, y, val);
    }

    int get(int x, int y, int u, int v)
    {
        if (r < x || u < l)
            return 0;
        down();
        if (x <= l && r <= u)
            return node->get(y, v);
        return gcd(left->get(x, y, u, v), right->get(x, y, u, v));
    }
};

long long gcd2(long long X, long long Y)
{
    long long tmp;
    while (X != Y && Y != 0)
    {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}

node2 *root;

void init(int R, int C)
{
    n = C;
    root = new node2(1, R);
}

void update(int P, int Q, long long K)
{
    root->update(P + 1, Q + 1, K);
}

long long calculate(int P, int Q, int U, int V)
{
    return root->get(P + 1, U + 1, Q + 1, V + 1);
}

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