oj.uz

Submission #1090470

# Submission time Handle Problem Language Result Execution time Memory
1090470 2024-09-18T11:59:57 Z kkkkkkkk Game (IOI13_game) C++14
27 / 100
 622 ms 33856 KB 
#include "game.h"
#include <bits/stdc++.h>

using namespace std;

long long tree[11][400005];
int n, m;

long long nzd(long long a, long long b) {
    if (b==0) return a;
    return nzd(b, a%b);
}

void updateST(int k, int left, int right, int red, int kol, long long br) {
    if (left==right) {
        if (left==kol)
            tree[red][k]=br;
        return;
    }
    if (left>right||right<kol||left>kol)
        return;
    int mid=(left+right)/2;
    updateST(2*k, left, mid, red, kol, br);
    updateST(2*k+1, mid+1, right, red, kol, br);
    tree[red][k]=nzd(tree[red][2*k], tree[red][2*k+1]);
}

long long queryST(int k, int left, int right, int red, int l, int r) {
    if (left>right||left>r||l>right) 
        return 0;
    if (l<=left&&right<=r)
        return tree[red][k];
    int mid=(left+right)/2;
    long long r1=queryST(2*k, left, mid, red, l, r);
    long long r2=queryST(2*k+1, mid+1, right, red, l, r);
    return nzd(r1, r2);
}

vector<vector<long long> > mat;

void init(int r, int c) {
    mat.resize(r, vector<long long> (c, 0));
    n=r, m=c;
} 

void update(int r, int c, long long br) {
    mat[r][c]=br;
    updateST(1, 0, m-1, r, c, br);
}

long long calculate(int x1, int y1, int x2, int y2) {
    long long rez=mat[x1][y1];
    for (int i=x1;i<=x2;i++)
        rez=nzd(rez, queryST(1, 0, m-1, i, y1, y2));
    return rez;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 352 KB Output is correct
2 Runtime error 1 ms 608 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 352 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 352 KB Output is correct
4 Correct 622 ms 32920 KB Output is correct
5 Correct 408 ms 32832 KB Output is correct
6 Correct 503 ms 33856 KB Output is correct
7 Correct 533 ms 33600 KB Output is correct
8 Correct 408 ms 31856 KB Output is correct
9 Correct 495 ms 33476 KB Output is correct
10 Correct 434 ms 33344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -