oj.uz

Submission #349624

# Submission time Handle Problem Language Result Execution time Memory
349624 2021-01-18T03:33:20 Z juggernaut Game (IOI13_game) C++14
0 / 100
 20 ms 31596 KB 
#include"game.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.c"
#endif
using namespace std;
struct jfkdjflsfjldks{
    long long tree[400005];
    void build(){
        for(int i=0;i<400005;i++)tree[i]=0;
    }
    long long get(int v,int l,int r,int ql,int qr){
        if(qr<l||r<ql)return 0ll;
        if(ql<=l&&r<=qr)return tree[v];
        int mid=(l+r)>>1;
        return __gcd(get(v<<1,l,mid,ql,qr),get(v<<1|1,mid+1,r,ql,qr));
    }
    void update(int v,int l,int r,int pos,long long val){
        if(l==r){
            tree[v]=val;
            return;
        }
        int mid=(l+r)>>1;
        if(pos<=mid)update(v<<1,l,mid,pos,val);
        else update(v<<1|1,mid+1,r,pos,val);
        tree[v]=__gcd(tree[v<<1],tree[v<<1|1]);
    }
}tree[10];
void init(int R,int C){
    for(int i=0;i<10;i++)tree[i].build();
}
void update(int P,int Q,long long K){
    tree[P].update(1,1,100000,Q,K);
}
long long calculate(int P,int Q,int U,int V){
    long long res=0;
    for(int i=P;i<=U;i++)
        res=__gcd(res,tree[i].get(1,1,100000,Q,V));
    return res;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 31596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 31596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Incorrect 20 ms 31596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 31596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 31596 KB Output isn't correct
2 Halted 0 ms 0 KB -