oj.uz

Submission #349644

# Submission time Handle Problem Language Result Execution time Memory
349644 2021-01-18T05:26:20 Z juggernaut Game (IOI13_game) C++14
10 / 100
 13000 ms 127084 KB 
#include"game.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.c"
#endif
using namespace std;
struct jfkdjflsfjldks{
    long long tree[8000];
    void build(){
        for(int i=0;i<8000;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[2000];
void init(int R,int C){
    for(int i=0;i<2000;i++)tree[i].build();
}
void update(int P,int Q,long long K){
    tree[P].update(1,0,1999,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,0,1999,Q,V));
    return res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 125548 KB Output is correct
2 Correct 73 ms 125548 KB Output is correct
3 Correct 73 ms 125548 KB Output is correct
4 Correct 73 ms 125548 KB Output is correct
5 Correct 83 ms 125548 KB Output is correct
6 Correct 74 ms 125676 KB Output is correct
7 Correct 78 ms 125548 KB Output is correct
8 Correct 72 ms 125548 KB Output is correct
9 Correct 74 ms 125548 KB Output is correct
10 Correct 73 ms 125548 KB Output is correct
11 Correct 74 ms 125548 KB Output is correct
12 Correct 74 ms 125548 KB Output is correct

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 125548 KB Output is correct
2 Correct 72 ms 125548 KB Output is correct
3 Correct 72 ms 125548 KB Output is correct
4 Incorrect 248 ms 126956 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 125548 KB Output is correct
2 Correct 73 ms 125556 KB Output is correct
3 Correct 73 ms 125548 KB Output is correct
4 Correct 74 ms 125548 KB Output is correct
5 Correct 72 ms 125548 KB Output is correct
6 Correct 73 ms 125548 KB Output is correct
7 Correct 72 ms 125548 KB Output is correct
8 Correct 73 ms 125548 KB Output is correct
9 Correct 72 ms 125548 KB Output is correct
10 Correct 73 ms 125548 KB Output is correct
11 Correct 72 ms 125548 KB Output is correct
12 Execution timed out 13088 ms 126860 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 125548 KB Output is correct
2 Correct 75 ms 125612 KB Output is correct
3 Correct 80 ms 125548 KB Output is correct
4 Correct 73 ms 125548 KB Output is correct
5 Correct 73 ms 125548 KB Output is correct
6 Correct 72 ms 125548 KB Output is correct
7 Correct 75 ms 125548 KB Output is correct
8 Correct 73 ms 125548 KB Output is correct
9 Correct 72 ms 125548 KB Output is correct
10 Correct 75 ms 125676 KB Output is correct
11 Correct 73 ms 125548 KB Output is correct
12 Incorrect 245 ms 126956 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 125548 KB Output is correct
2 Correct 73 ms 125760 KB Output is correct
3 Correct 79 ms 125548 KB Output is correct
4 Correct 72 ms 125548 KB Output is correct
5 Correct 72 ms 125548 KB Output is correct
6 Correct 73 ms 125548 KB Output is correct
7 Correct 72 ms 125548 KB Output is correct
8 Correct 73 ms 125548 KB Output is correct
9 Correct 74 ms 125548 KB Output is correct
10 Correct 73 ms 125548 KB Output is correct
11 Correct 73 ms 125604 KB Output is correct
12 Incorrect 249 ms 127084 KB Output isn't correct
13 Halted 0 ms 0 KB -