제출 #681013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
681013		nutella	게임 (IOI13_game)	C++17	63 / 100	1428 ms	256000 KiB

game

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

using namespace std;
using ll = long long;

struct segtree {
    int l, r;
    ll d = 0;

    segtree *left = nullptr, *right = nullptr;

    void pull() {
        d = gcd(left ? left->d : 0, right ? right->d : 0);
    }

    void update(int i, ll k) {
        if (l + 1 == r) {
            d = k;
        } else {
            int mid = (l + r) / 2;

            if (i < mid) {
                if (!left) {
                    left = new segtree({l, mid});
                }
                left->update(i, k);
            } else {
                if (!right) {
                    right = new segtree({mid, r});
                }
                right->update(i, k);
            }

            pull();
        }
    }

    ll query(int lx, int rx) {
        if (lx >= r || rx <= l) {
            return 0;
        } else if (lx <= l && r <= rx) {
            return d;
        } else {
            ll ans = 0;

            if (left) {
                ans = gcd(ans, left->query(lx, rx));
            }
            if (right) {
                ans = gcd(ans, right->query(lx, rx));
            }

            return ans;
        }
    }
};

int R, C;

struct SegmentTree {
    int l, r;
    segtree *st = nullptr;

    SegmentTree *left = nullptr, *right = nullptr;

    void build_st() {
        if (!st) {
            st = new segtree({0, C});
        }
    }

    ll simple_query(int y) {
        if (!st) {
            return 0;
        } else {
            return st->query(y, y + 1);
        }
    }

    void update(int x, int y, ll k) {
        build_st();

        if (l + 1 == r) {
            st->update(y, k);
        } else {
            int mid = (l + r) / 2;

            if (x < mid) {
                if (!left) {
                    left = new SegmentTree({l, mid});
                }

                left->update(x, y, k);
            } else {
                if (!right) {
                    right = new SegmentTree({mid, r});
                }

                right->update(x, y, k);
            }

            st->update(y, gcd((left ? left->simple_query(y) : 0), (right ? right->simple_query(y) : 0)));
        }
    }

    ll query(int lx, int rx, int ly, int ry) {
        if (l >= rx || lx >= r) {
            return 0;
        } else if (lx <= l && r <= rx) {
            if (!st) {
                return 0;
            } else {
                return st->query(ly, ry);
            }
        } else {
            ll ans = 0;

            if (left) {
                ans = gcd(ans, left->query(lx, rx, ly, ry));
            }
            if (right) {
                ans = gcd(ans, right->query(lx, rx, ly, ry));
            }

            return ans;
        }
    }
};

SegmentTree *root = nullptr;

void init(int R, int C) {
    ::R = R, ::C = C;

    root = new SegmentTree({0, R});
}

void update(int P, int Q, ll K) {
    root->update(P, Q, K);
}

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

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