oj.uz

Submission #29932

# Submission time Handle Problem Language Result Execution time Memory
29932 2017-07-21T10:54:02 Z ozaslan Game (IOI13_game) C++14
10 / 100
 13000 ms 127020 KB 
#include <bits/stdc++.h>
#include <stdio.h>
#include "game.h"
#define max_N 100001

long long gcd2(long long X, long long Y) {
	//printf("X\n");
    long long tmp;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}

long long st[2000][2000 * 4];
int sa, su;

void init(int R, int C) {
	sa = R;
	su = C;
}

void guncelle(int dugum, int sol, int sag, int satir, int sutun, long long K) {

    if (sol == sag) {
        st[satir][dugum] = K;
        return;
    }

    int orta = (sol + sag) / 2;

    if (orta >= sutun)
        guncelle(dugum*2, sol, orta, satir, sutun, K);
    else
        guncelle(dugum*2+1, orta+1, sag, satir, sutun, K);

    st[satir][dugum] = gcd2(st[satir][dugum*2], st[satir][dugum*2+1]);
}

void update(int P, int Q, long long K) {
    guncelle(1, 0, su-1, P, Q, K);
}

long long sorgu(int dugum, int sol, int sag, int satir, int aSol, int aSag) {
   // printf("Dugum: %d, sol: %d, sag: %d, satir: %d, aSol: %d, aSag: %d\n", dugum, sol, sag, satir, aSol, aSag);
    if(sol > aSag || sag < aSol)
        return -1;

    if(sol >= aSol && sag <= aSag)
        return st[satir][dugum];

    int orta = (sol + sag) / 2;
    long long s1 = sorgu(dugum*2, sol, orta, satir, aSol, aSag);
    long long s2 = sorgu(dugum*2+1, orta+1, sag, satir, aSol, aSag);

    if ( (s1 != -1) && (-1 != s2) )
        return gcd2(s1, s2);
    if (s1 == -1)
        return s2;
    return s1;
}


long long calculate(int P, int Q, int U, int V) {
    /* ... */

    long long ekok = sorgu(1, 0, su-1, P, Q, V);
   // printf("Satir: %d, s: %lld\n", P, ekok);

    for (int i = P+1; i <= U; i++) {
        long long s = sorgu(1, 0, su-1, i, Q, V);
     //   printf("Satir: %d, s: %lld\n", i, s);
        ekok = gcd2(ekok, s);
    }

    return ekok;
}

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

# Verdict Execution time Memory Grader output
1 Correct 0 ms 127020 KB Output is correct
2 Correct 0 ms 127020 KB Output is correct
3 Correct 0 ms 127020 KB Output is correct
4 Correct 0 ms 127020 KB Output is correct
5 Correct 0 ms 127020 KB Output is correct
6 Correct 0 ms 127020 KB Output is correct
7 Correct 0 ms 127020 KB Output is correct
8 Correct 0 ms 127020 KB Output is correct
9 Correct 0 ms 127020 KB Output is correct
10 Correct 0 ms 127020 KB Output is correct
11 Correct 0 ms 127020 KB Output is correct
12 Correct 0 ms 127020 KB Output is correct

Subtask #2
0 / 27.0

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

Subtask #3
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 127020 KB Output is correct
2 Correct 0 ms 127020 KB Output is correct
3 Correct 0 ms 127020 KB Output is correct
4 Correct 0 ms 127020 KB Output is correct
5 Correct 0 ms 127020 KB Output is correct
6 Correct 0 ms 127020 KB Output is correct
7 Correct 0 ms 127020 KB Output is correct
8 Correct 0 ms 127020 KB Output is correct
9 Correct 0 ms 127020 KB Output is correct
10 Correct 0 ms 127020 KB Output is correct
11 Correct 0 ms 127020 KB Output is correct
12 Execution timed out 13000 ms 127020 KB Execution timed out
13 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 127020 KB Output is correct
2 Correct 0 ms 127020 KB Output is correct
3 Correct 0 ms 127020 KB Output is correct
4 Correct 0 ms 127020 KB Output is correct
5 Correct 0 ms 127020 KB Output is correct
6 Correct 0 ms 127020 KB Output is correct
7 Correct 0 ms 127020 KB Output is correct
8 Correct 0 ms 127020 KB Output is correct
9 Correct 0 ms 127020 KB Output is correct
10 Correct 0 ms 127020 KB Output is correct
11 Correct 0 ms 127020 KB Output is correct
12 Incorrect 1839 ms 127020 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 127020 KB Output is correct
2 Correct 0 ms 127020 KB Output is correct
3 Correct 0 ms 127020 KB Output is correct
4 Correct 0 ms 127020 KB Output is correct
5 Correct 0 ms 127020 KB Output is correct
6 Correct 0 ms 127020 KB Output is correct
7 Correct 0 ms 127020 KB Output is correct
8 Correct 0 ms 127020 KB Output is correct
9 Correct 0 ms 127020 KB Output is correct
10 Correct 0 ms 127020 KB Output is correct
11 Correct 0 ms 127020 KB Output is correct
12 Incorrect 1683 ms 127020 KB Output isn't correct
13 Halted 0 ms 0 KB -