제출 #402645

#제출 시각아이디문제언어결과실행 시간메모리
402645prvocisloGame (IOI13_game)C++17
37 / 100
13091 ms24616 KiB
#include "game.h"
#include <iostream>
#include <vector>
typedef long long ll;
using namespace std;

long long gcd(long long X, long long Y) {
    long long tmp;
    while (X != Y && Y != 0) {
        tmp = X, X = Y, Y = tmp % Y;
    }
    return X;
}
int r, c;
void update_1d(int i, ll k, vector<ll>& v){
    v[i + c] = k;
    for (i = ((i + c) >> 1); i > 0; i >>= 1) v[i] = gcd(v[i << 1], v[i << 1 | 1]);
}
ll query_1d(int li, int ri, vector<ll>& v) {
    ll g = 0;
    for (li += c, ri += c + 1; li < ri; li >>= 1, ri >>= 1) {
        if (li & 1) g = gcd(g, v[li++]);
        if (ri & 1) g = gcd(g, v[--ri]);
    } return g;
}
vector<vector<ll> > st;
void init(int R, int C) {
    r = R, c = C; 
    st.assign(r, vector<ll>(c * 2, 0));
}
void update(int x, int y, long long k) {
    update_1d(y, k, st[x]);
}
long long calculate(int lx, int ly, int rx, int ry) {
    ll g = 0;
    for (int x = lx; x <= rx; x++)
        g = gcd(g, query_1d(ly, ry, st[x]));
    return g;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...