Submission #7247

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7247	2014-07-28 13:04:41	Rhak	Game (IOI13_game)	C++98	63 / 100	4540 ms	256000 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "game.h"
#include<stdio.h>
long long gcd2(long long x, long long y){ return y==0? x: gcd2(y, x%y); }
struct _node{
  _node *d[4];
  long long GCD;
  _node(long long GCD):GCD(GCD){ d[0] = d[1] = d[2] = d[3] = 0; }
};
struct _IndexTree{
  int S, E;
  _node *root;
  _IndexTree(int S,int E):S(S), E(E){ root = new _node(0);}
  void update(_node* n, int s, int e, int p, long long N, _IndexTree* l, _IndexTree* r)
  {
    if( p < s || e < p) return;
    else if( p == s && e == p){
      if( N != -1) n->GCD = N;
      else n->GCD = gcd2(l?l->read(s, e):0, r?r->read(s, e):0);
      return;
    }
    long long t[4] = {0}, fn = 0; 
    for(int i = 0; i < 4; i++) t[i] = n->d[i]? n->d[i]->GCD:0;
    if( e >= s+4){
      for(long long i = 0; i < 4; i++){
        int ml = (( s*(4-i) + e*i) >> 2) + 1;
        int mr = ( s*(3-i) + e*(i+1)) >> 2;
        if(i == 0) ml--;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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