oj.uz

Submission #93847

# Submission time Handle Problem Language Result Execution time Memory
93847 2019-01-12T12:18:48 Z alexpetrescu Game (IOI13_game) C++14
10 / 100
 271 ms 257024 KB 
#include "game.h"
#include <cstring>
#include <vector>
#include <algorithm>

long long ****rmq;
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) {
    nrlin = R;
    nrcol = C;
    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] + 1; a++) {
                rmq[i][j][a] = new long long[lg2[nrcol] + 1];
                for (int b = 0; b < lg2[nrcol] + 1; b++)
                    rmq[i][j][a][b] = 0;
            }
        }
    }
}

void update(int P, int Q, long long K) {
    rmq[P][Q][0][0] = K;
    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) {
    int a = lg2[U - P + 1], b = lg2[V - Q + 1];
    return 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]);
}

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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 197 ms 5496 KB Output is correct
3 Correct 200 ms 5476 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 8 ms 5372 KB Output is correct
6 Correct 200 ms 5432 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 1912 KB Output is correct
9 Correct 201 ms 5368 KB Output is correct
10 Correct 60 ms 5368 KB Output is correct
11 Correct 68 ms 5368 KB Output is correct
12 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Runtime error 228 ms 257024 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 201 ms 5368 KB Output is correct
3 Correct 190 ms 5468 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 8 ms 5496 KB Output is correct
6 Correct 197 ms 5476 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 1912 KB Output is correct
9 Correct 191 ms 5496 KB Output is correct
10 Correct 57 ms 5368 KB Output is correct
11 Correct 67 ms 5368 KB Output is correct
12 Runtime error 250 ms 257024 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 203 ms 5368 KB Output is correct
3 Correct 204 ms 5476 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 8 ms 5368 KB Output is correct
6 Correct 195 ms 5432 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 1912 KB Output is correct
9 Correct 183 ms 5368 KB Output is correct
10 Correct 58 ms 5368 KB Output is correct
11 Correct 68 ms 5436 KB Output is correct
12 Runtime error 224 ms 257024 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 192 ms 5368 KB Output is correct
3 Correct 189 ms 5496 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 7 ms 5368 KB Output is correct
6 Correct 204 ms 5368 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 4 ms 1912 KB Output is correct
9 Correct 199 ms 5368 KB Output is correct
10 Correct 53 ms 5368 KB Output is correct
11 Correct 67 ms 5368 KB Output is correct
12 Runtime error 271 ms 257024 KB Execution killed with signal 9 (could be triggered by violating memory limits)
13 Halted 0 ms 0 KB -