oj.uz

Submission #962914

# Submission time Handle Problem Language Result Execution time Memory
962914 2024-04-14T09:43:00 Z n3rm1n Game (IOI13_game) C++17
10 / 100
 13000 ms 20020 KB 
#include<bits/stdc++.h>
#include "game.h"
using namespace std;

int r, c;
void init(int R, int C)
{
    r = R;
    c = C;
}
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;
}
long long t[2005][10005];
int line, ql, qr;
long long query(int i, int l, int r)
{
    if(ql > r || qr < l)return 0;
    if(ql <= l && r <= qr)return t[line][i];
    int mid = (l + r)/2;
    return gcd2(query(2*i, l, mid), query(2*i+1, mid+1, r));
}
int pnt;
long long val;
void upd(int i, int l, int r)
{
    if(l == r)
    {
        t[line][i] = val;
        return;
    }
    int mid = (l + r)/2;
    if(pnt <= mid)upd(2*i, l, mid);
    else upd(2*i+1, mid+1, r);
    t[line][i] = gcd2(t[line][2*i], t[line][2*i+1]);
}
void update(int P, int Q, long long K)
{
    P ++;
    Q ++;

    line = P;
    pnt = Q;
    val = K;
    upd(1, 1, c);
}
long long calculate(int P, int Q, int U, int V)
{
    P ++;
    Q ++;
    U ++;
    V ++;
    long long ans = 0;
    ql = Q;
    qr = V;
    for (line = P; line <= U; ++ line)
        ans = gcd2(ans, query(1, 1, c));
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 785 ms 3600 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 500 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 2 ms 4444 KB Output is correct
12 Execution timed out 13064 ms 20020 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Incorrect 788 ms 3764 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 8540 KB Output is correct
7 Correct 1 ms 412 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 8540 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Incorrect 797 ms 3600 KB Output isn't correct
13 Halted 0 ms 0 KB -