Submission #30001

#	Time	Username	Problem	Language	Result	Execution time	Memory
30001		inqr	Game (IOI13_game)	C++14	10 / 100	13000 ms	80184 KiB

game

#include "game.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define DB printf("debug\n");
using namespace std;
long long g[100][100000];
int r,c,q;
long long kok[10][320];

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;
}
void init(int R, int C){
    r=R;c=C,q=(int)(sqrt(C));
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            kok[i][j/q]=gcd2(kok[i][j/q],g[i][j]);
        }
    }
}
void update(int P, int Q, long long K){
    if(kok[P][Q/q]==g[P][Q]){
        g[P][Q]=K;
        kok[P][Q/q]=0;
        for(int i=Q/q*q;i<Q/q*q+q;i++){
            kok[P][Q/q]=gcd2(kok[P][Q/q],g[P][i]);
        }
    }
    g[P][Q]=K;
    kok[P][Q/q]=gcd2(kok[P][Q/q],g[P][Q]);
}
long long calculate2(int P, int Q, int U, int V) {
    long long ans=g[P][Q];
    for(int i=P;i<=U;i++){
        for(int j=Q;j<=V;j++){
            ans=gcd2(ans,g[i][j]);
        }
    }
    return ans;
}
long long calculate3(int P, int Q, int U, int V) {
    long long ans=g[P][Q];
    for(int i=P;i<=U;i++){
        for(int j=Q;j<=V;j++){
            if(j+q<=V){
                ans=gcd2(ans,kok[i][j/q]);
                j+=q-1;
            }
            else ans=gcd2(ans,g[i][j]);
        }
    }
    return ans;
}
long long calculate(int P, int Q, int U, int V) {
    if(r<=100 and c<=100)return calculate2(P,Q,U,V);
    else if(r<=10 and c<=100000) return calculate3(P,Q,U,V);
}

Compilation message (stderr)

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^
game.cpp: In function 'long long int calculate(int, int, int, int)':
game.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 10 / 10
• Subtask 2: 0 / 27
• Subtask 3: 0 / 26
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20