oj.uz

답안 #93855

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93855 2019-01-12T13:19:12 Z alexpetrescu 게임 (IOI13_game) C++14
10 / 100
 13000 ms 41884 KB 
#include "game.h"
#include <cstring>
#include <vector>
#include <algorithm>

#define W 5

long long **mat;
long long ****rmq;
std::vector < int > lin[2000], col[100000];
int nrlin, nrcol, lg2[100001];

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;
}

void init(int R, int C) {
    mat = new long long*[R];
    for (int i = 0; i < R; i++) {
        mat[i] = new long long[C];
        for (int j = 0; j < C; j++)
            mat[i][j] = 0;
    }
    nrlin = R / W;
    nrcol = C / W;
    int n = std::max(nrlin, nrcol);
    for (int i = 2; i <= n; i++)
        if ((1 << (lg2[i - 1] + 1)) == i)
            lg2[i] = lg2[i - 1] + 1;
        else
            lg2[i] = lg2[i - 1];
    rmq = new long long***[nrlin];
    for (int i = 0; i < nrlin; i++) {
        rmq[i] = new long long**[nrcol];
        for (int j = 0; j < nrcol; j++) {
            rmq[i][j] = new long long*[lg2[nrlin] + 1];
            for (int a = 0; a <= lg2[nrlin]; a++) {
                rmq[i][j][a] = new long long[lg2[nrcol] + 1];
                for (int b = 0; b <= lg2[nrcol]; b++)
                    rmq[i][j][a][b] = 0;
            }
        }
    }
}

void update(int P, int Q, long long K) {
    lin[P].push_back(Q);
    col[Q].push_back(P);
    mat[P][Q] = K;
    P /= W;
    Q /= W;
    if (P < nrlin && Q < nrcol) {
        rmq[P][Q][0][0] = 0;
        for (int i = W * P; i < W * P + W; i++)
            for (int j = W * Q; j < W * Q + W; j++)
                rmq[P][Q][0][0] = gcd2(rmq[P][Q][0][0], mat[i][j]);
        for (int i = P; i < nrlin; i++) {
            for (int j = Q; j < nrcol; j++) {
                for (int b = 1; (1 << b) <= j + 1; b++)
                    rmq[i][j][0][b] = gcd2(rmq[i][j][0][b - 1], rmq[i][j - (1 << (b - 1))][0][b - 1]);
                for (int a = 1; (1 << a) <= i + 1; a++)
                    for (int b = 0; (1 << b) <= j + 1; b++)
                        rmq[i][j][a][b] = gcd2(rmq[i][j][a - 1][b], rmq[i - (1 << (a - 1))][j][a - 1][b]);
            }
        }
    }
}

long long calculate(int p, int q, int u, int v) {
    long long ans = 0;
    int P = p / W + bool(p % W), Q = q / W + bool(q % W), U = u / W - 1 + bool(u % W == W - 1), V = v / W - 1 + bool(v % W == W - 1);
    if (P > U) {
        for (int i = p; i <= u; i++)
            for (auto &x : lin[i])
                if (q <= x && x <= v)
                    ans = gcd2(mat[i][x], ans);
    } else {
        if (p % W)
            for (int i = p; i % W; i++)
                for (auto &x : lin[i])
                    if (q <= x && x <= v)
                        ans = gcd2(mat[i][x], ans);
        if (u % W != W - 1)
            for (int i = u - u % W; i <= u; i++)
                for (auto &x : lin[i])
                    if (q <= x && x <= v)
                        ans = gcd2(mat[i][x], ans);
    }
    if (Q > V) {
        for (int i = q; i <= v; i++)
            for (auto &x : col[i])
                if (p <= x && x <= u)
                    ans = gcd2(mat[x][i], ans);
    } else {
        if (q % W)
            for (int i = q; i % W; i++)
                for (auto &x : col[i])
                    if (p <= x && x <= u)
                        ans = gcd2(mat[x][i], ans);
        if (v % W != W - 1)
            for (int i = v - v % W; i <= v; i++)
                for (auto &x : col[i])
                    if (p <= x && x <= u)
                        ans = gcd2(mat[x][i], ans);
    }

    if (P <= U && Q <= V) {
        int a = lg2[U - P + 1], b = lg2[V - Q + 1];
        ans = gcd2(ans, gcd2(gcd2(gcd2(rmq[U][V][a][b], rmq[P + (1 << a) - 1][V][a][b]), rmq[U][Q + (1 << b) - 1][a][b]), rmq[P + (1 << a) - 1][Q + (1 << b) - 1][a][b]));
    }
    return ans;
}

Compilation message

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 12 ms 2936 KB Output is correct
3 Correct 10 ms 2936 KB Output is correct
4 Correct 3 ms 2680 KB Output is correct
5 Correct 3 ms 2936 KB Output is correct
6 Correct 11 ms 2808 KB Output is correct
7 Correct 3 ms 2680 KB Output is correct
8 Correct 4 ms 2680 KB Output is correct
9 Correct 11 ms 2936 KB Output is correct
10 Correct 6 ms 2936 KB Output is correct
11 Correct 5 ms 2936 KB Output is correct
12 Correct 3 ms 2680 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2684 KB Output is correct
4 Execution timed out 13067 ms 25684 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2680 KB Output is correct
2 Correct 11 ms 2940 KB Output is correct
3 Correct 10 ms 2936 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 3 ms 2936 KB Output is correct
6 Correct 11 ms 2936 KB Output is correct
7 Correct 3 ms 2680 KB Output is correct
8 Correct 3 ms 2808 KB Output is correct
9 Correct 11 ms 2936 KB Output is correct
10 Correct 5 ms 2940 KB Output is correct
11 Correct 5 ms 2936 KB Output is correct
12 Execution timed out 13097 ms 41884 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2680 KB Output is correct
2 Correct 11 ms 2936 KB Output is correct
3 Correct 11 ms 2936 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2936 KB Output is correct
6 Correct 11 ms 2936 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 3 ms 2680 KB Output is correct
9 Correct 11 ms 2936 KB Output is correct
10 Correct 6 ms 2940 KB Output is correct
11 Correct 5 ms 2936 KB Output is correct
12 Execution timed out 13051 ms 25600 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2748 KB Output is correct
2 Correct 11 ms 2936 KB Output is correct
3 Correct 11 ms 2936 KB Output is correct
4 Correct 3 ms 2680 KB Output is correct
5 Correct 3 ms 2936 KB Output is correct
6 Correct 11 ms 2936 KB Output is correct
7 Correct 3 ms 2680 KB Output is correct
8 Correct 3 ms 2680 KB Output is correct
9 Correct 11 ms 2936 KB Output is correct
10 Correct 5 ms 2936 KB Output is correct
11 Correct 5 ms 2936 KB Output is correct
12 Execution timed out 13022 ms 25560 KB Time limit exceeded
13 Halted 0 ms 0 KB -