oj.uz

답안 #1090471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090471 2024-09-18T12:00:31 Z vjudge1 게임 (IOI13_game) C++17
27 / 100
 626 ms 29136 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 2 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 626 ms 28384 KB Output is correct
5 Correct 392 ms 29060 KB Output is correct
6 Correct 442 ms 29136 KB Output is correct
7 Correct 460 ms 28948 KB Output is correct
8 Correct 381 ms 27456 KB Output is correct
9 Correct 464 ms 28996 KB Output is correct
10 Correct 415 ms 28476 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Runtime error 1 ms 600 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 600 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 1 ms 604 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -