oj.uz

답안 #65108

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65108 2018-08-06T16:11:25 Z theknife2001 게임 (IOI13_game) C++17
10 / 100
 13000 ms 121708 KB 
#include "game.h"
#include <bits/stdc++.h>
#define mid (l+r)/2



using namespace std;


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;
}

const int N=2055;
long long sp[N][N*2][15];
int lg[N];
int n,m;

void init(int R, int C)
{
    n=R;
    m=C;
    int j=0;
    for(int i=0;i<=m;i++)
    {
        if((1<<(j+1))==i)
            j++;
        lg[i]=j;
    }

}



void update(int P, int Q, long long K)
{
    sp[P][Q][0]=K;
    for(int i=1;i<=10;i++)
    {
        for(int j=0;j<m;j++)
        {
//            if(j+(1<<(i-1))>=m)
//                break ;
            sp[P][j][i]=gcd2(sp[P][j+(1<<(i-1))][i-1],sp[P][j][i-1]);
        }
    }
}

long long calculate(int P, int Q, int U, int V)
{
    long long ans=0;
    for(int i=P;i<=U;i++)
    {
        ans=gcd2(sp[i][Q][lg[V-Q]],gcd2(sp[i][V-(1<<lg[V-Q])+1][lg[V-Q]],ans));
    }
    return ans;
}

Compilation message

grader.c: In function 'int main()':
grader.c:18:6: warning: variable 'res' set but not used [-Wunused-but-set-variable]
  int res;
      ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 6 ms 1484 KB Output is correct
3 Correct 6 ms 1556 KB Output is correct
4 Correct 2 ms 1556 KB Output is correct
5 Correct 3 ms 1556 KB Output is correct
6 Correct 4 ms 1556 KB Output is correct
7 Correct 2 ms 1556 KB Output is correct
8 Correct 2 ms 1556 KB Output is correct
9 Correct 4 ms 1556 KB Output is correct
10 Correct 4 ms 1556 KB Output is correct
11 Correct 3 ms 1556 KB Output is correct
12 Correct 3 ms 1556 KB Output is correct

Subtask #2
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1556 KB Output is correct
2 Correct 3 ms 1556 KB Output is correct
3 Correct 2 ms 1556 KB Output is correct
4 Execution timed out 13098 ms 17040 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 17040 KB Output is correct
2 Correct 6 ms 17040 KB Output is correct
3 Correct 6 ms 17040 KB Output is correct
4 Correct 3 ms 17040 KB Output is correct
5 Correct 3 ms 17040 KB Output is correct
6 Correct 5 ms 17040 KB Output is correct
7 Correct 3 ms 17040 KB Output is correct
8 Correct 3 ms 17040 KB Output is correct
9 Correct 4 ms 17040 KB Output is correct
10 Correct 4 ms 17040 KB Output is correct
11 Correct 3 ms 17040 KB Output is correct
12 Execution timed out 13017 ms 121708 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 121708 KB Output is correct
2 Correct 6 ms 121708 KB Output is correct
3 Correct 6 ms 121708 KB Output is correct
4 Correct 2 ms 121708 KB Output is correct
5 Correct 3 ms 121708 KB Output is correct
6 Correct 6 ms 121708 KB Output is correct
7 Correct 4 ms 121708 KB Output is correct
8 Correct 4 ms 121708 KB Output is correct
9 Correct 6 ms 121708 KB Output is correct
10 Correct 4 ms 121708 KB Output is correct
11 Correct 4 ms 121708 KB Output is correct
12 Execution timed out 13034 ms 121708 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 121708 KB Output is correct
2 Correct 5 ms 121708 KB Output is correct
3 Correct 6 ms 121708 KB Output is correct
4 Correct 2 ms 121708 KB Output is correct
5 Correct 3 ms 121708 KB Output is correct
6 Correct 6 ms 121708 KB Output is correct
7 Correct 3 ms 121708 KB Output is correct
8 Correct 3 ms 121708 KB Output is correct
9 Correct 6 ms 121708 KB Output is correct
10 Correct 5 ms 121708 KB Output is correct
11 Correct 5 ms 121708 KB Output is correct
12 Execution timed out 13098 ms 121708 KB Time limit exceeded
13 Halted 0 ms 0 KB -