oj.uz

Submission #30026

# Submission time Handle Problem Language Result Execution time Memory
30026 2017-07-21T14:15:26 Z PrOAhMeT Game (IOI13_game) C++14
100 / 100
 10193 ms 218584 KB 
#include <bits/stdc++.h>
#include "game.h"
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

const int MAXR=1e9,MAXC=1e9;
const int MAX1=40*22000,MAX2=20*20*22000;

int root[MAX1],cl2[MAX2],cr2[MAX2],l2[MAX2],r2[MAX2];
int cl1[MAX1],cr1[MAX1],tme1,tme2,ROOT;
LL f[MAX2];

long long gcd2(long long X, long long Y) {
    if(X == 0 || Y == 0) {
        return X + Y;
    }
    long long tmp;
    while (X != Y && Y != 0) {
        tmp = X;
        X = Y;
        Y = tmp % Y;
    }
    return X;
}

int newNode1() {

	int v=++tme1;
	root[tme1]=++tme2;
	l2[tme2]=0; r2[tme2]=MAXC-1;
	return v;

}

int newNode2(int l,int r) {

	int v=++tme2;
	l2[v]=l; r2[v]=r;
	return v;

}

void init(int r,int c) {

	ROOT=newNode1();

}

LL que2(int x,int l,int r) {

	if(x==0||l2[x]>r||r2[x]<l) 
		return 0; 
	if(l2[x]>=l&&r2[x]<=r)
		return f[x];
	return gcd2(que2(cl2[x],l,r),que2(cr2[x],l,r));

}

LL que1(int x,int l,int r,int ll,int rr,int xx,int yy) {

	if(l>rr||r<ll||x==0)
		return 0;
	if(l>=ll&&r<=rr)
		return que2(root[x],xx,yy);
	int md=(l+r)/2;
	return gcd2(que1(cl1[x],l,md,ll,rr,xx,yy),que1(cr1[x],md+1,r,ll,rr,xx,yy));

}

void upd2(int x,int y,LL k) {
	//cout<<"upd2: "<<x<<" "<<l2[x]<<" "<<r2[x]<<endl;
	if(l2[x]==y&&r2[x]==y) {
		f[x]=k;
		return;
	}
	int mdo=(l2[x]+r2[x])/2;
	int &v=(y<=mdo?cl2[x]:cr2[x]);
	if(v==0) {
		v=newNode2(y,y);
		f[v]=k;
	}
	else if(l2[v]<=y&&r2[v]>=y) 
		upd2(v,y,k);
	else {
		//cout<<"oh no "<<l2[v]<<" "<<r2[v]<<" "<<y<<endl;
		int l=l2[x],r=r2[x],md=(l2[x]+r2[x])/2,t=v;
		do {
			if(y<=md) 
				r=md;
			else l=md+1;
			md=(l+r)/2;
		} while((y<=md)==(l2[v]<=md));
		//cout<<l<<" "<<r<<endl;
		int nw=newNode2(l,r);
		v=nw;
		if(l2[t]<=md) cl2[nw]=t;
		else cr2[nw]=t;
		upd2(nw,y,k);
	}
	f[x]=gcd2(f[cl2[x]],f[cr2[x]]);

}

void upd1(int &x,int l,int r,int ll,int y,LL k) {

	if(x==0) 
		x=newNode1();
	if(l==r) {
		upd2(root[x],y,k);
		return;
	}
	int md=(l+r)/2;
	if(ll<=md)
		upd1(cl1[x],l,md,ll,y,k);
	else upd1(cr1[x],md+1,r,ll,y,k);
	upd2(root[x],y,gcd2(que2(root[cl1[x]],y,y),que2(root[cr1[x]],y,y)));

}

void update(int x,int y,LL k) {

	upd1(ROOT,0,MAXR-1,x,y,k);

}

LL calculate(int p,int q,int u,int v) {

	return que1(ROOT,0,MAXR-1,p,u,q,v);

}

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 218584 KB Output is correct
2 Correct 0 ms 218584 KB Output is correct
3 Correct 0 ms 218584 KB Output is correct
4 Correct 0 ms 218584 KB Output is correct
5 Correct 0 ms 218584 KB Output is correct
6 Correct 0 ms 218584 KB Output is correct
7 Correct 0 ms 218584 KB Output is correct
8 Correct 0 ms 218584 KB Output is correct
9 Correct 0 ms 218584 KB Output is correct
10 Correct 0 ms 218584 KB Output is correct
11 Correct 0 ms 218584 KB Output is correct
12 Correct 0 ms 218584 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 218584 KB Output is correct
2 Correct 0 ms 218584 KB Output is correct
3 Correct 0 ms 218584 KB Output is correct
4 Correct 1219 ms 218584 KB Output is correct
5 Correct 763 ms 218584 KB Output is correct
6 Correct 1463 ms 218584 KB Output is correct
7 Correct 1813 ms 218584 KB Output is correct
8 Correct 899 ms 218584 KB Output is correct
9 Correct 1616 ms 218584 KB Output is correct
10 Correct 1353 ms 218584 KB Output is correct
11 Correct 0 ms 218584 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 218584 KB Output is correct
2 Correct 0 ms 218584 KB Output is correct
3 Correct 3 ms 218584 KB Output is correct
4 Correct 0 ms 218584 KB Output is correct
5 Correct 0 ms 218584 KB Output is correct
6 Correct 0 ms 218584 KB Output is correct
7 Correct 0 ms 218584 KB Output is correct
8 Correct 0 ms 218584 KB Output is correct
9 Correct 0 ms 218584 KB Output is correct
10 Correct 0 ms 218584 KB Output is correct
11 Correct 0 ms 218584 KB Output is correct
12 Correct 1266 ms 218584 KB Output is correct
13 Correct 2839 ms 218584 KB Output is correct
14 Correct 519 ms 218584 KB Output is correct
15 Correct 3169 ms 218584 KB Output is correct
16 Correct 436 ms 218584 KB Output is correct
17 Correct 1549 ms 218584 KB Output is correct
18 Correct 3073 ms 218584 KB Output is correct
19 Correct 2756 ms 218584 KB Output is correct
20 Correct 1929 ms 218584 KB Output is correct
21 Correct 0 ms 218584 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 218584 KB Output is correct
2 Correct 0 ms 218584 KB Output is correct
3 Correct 0 ms 218584 KB Output is correct
4 Correct 0 ms 218584 KB Output is correct
5 Correct 0 ms 218584 KB Output is correct
6 Correct 0 ms 218584 KB Output is correct
7 Correct 0 ms 218584 KB Output is correct
8 Correct 0 ms 218584 KB Output is correct
9 Correct 0 ms 218584 KB Output is correct
10 Correct 0 ms 218584 KB Output is correct
11 Correct 0 ms 218584 KB Output is correct
12 Correct 1123 ms 218584 KB Output is correct
13 Correct 879 ms 218584 KB Output is correct
14 Correct 1633 ms 218584 KB Output is correct
15 Correct 1716 ms 218584 KB Output is correct
16 Correct 913 ms 218584 KB Output is correct
17 Correct 1689 ms 218584 KB Output is correct
18 Correct 1543 ms 218584 KB Output is correct
19 Correct 1519 ms 218584 KB Output is correct
20 Correct 2883 ms 218584 KB Output is correct
21 Correct 559 ms 218584 KB Output is correct
22 Correct 3143 ms 218584 KB Output is correct
23 Correct 536 ms 218584 KB Output is correct
24 Correct 1633 ms 218584 KB Output is correct
25 Correct 2863 ms 218584 KB Output is correct
26 Correct 2406 ms 218584 KB Output is correct
27 Correct 2193 ms 218584 KB Output is correct
28 Correct 826 ms 218584 KB Output is correct
29 Correct 2516 ms 218584 KB Output is correct
30 Correct 5726 ms 218584 KB Output is correct
31 Correct 4816 ms 218584 KB Output is correct
32 Correct 483 ms 218584 KB Output is correct
33 Correct 846 ms 218584 KB Output is correct
34 Correct 439 ms 218584 KB Output is correct
35 Correct 1756 ms 218584 KB Output is correct
36 Correct 4013 ms 218584 KB Output is correct
37 Correct 3306 ms 218584 KB Output is correct
38 Correct 3139 ms 218584 KB Output is correct
39 Correct 1943 ms 218584 KB Output is correct
40 Correct 0 ms 218584 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 218584 KB Output is correct
2 Correct 0 ms 218584 KB Output is correct
3 Correct 0 ms 218584 KB Output is correct
4 Correct 0 ms 218584 KB Output is correct
5 Correct 0 ms 218584 KB Output is correct
6 Correct 0 ms 218584 KB Output is correct
7 Correct 0 ms 218584 KB Output is correct
8 Correct 0 ms 218584 KB Output is correct
9 Correct 0 ms 218584 KB Output is correct
10 Correct 0 ms 218584 KB Output is correct
11 Correct 0 ms 218584 KB Output is correct
12 Correct 1176 ms 218584 KB Output is correct
13 Correct 789 ms 218584 KB Output is correct
14 Correct 1576 ms 218584 KB Output is correct
15 Correct 1666 ms 218584 KB Output is correct
16 Correct 1046 ms 218584 KB Output is correct
17 Correct 1709 ms 218584 KB Output is correct
18 Correct 1656 ms 218584 KB Output is correct
19 Correct 1516 ms 218584 KB Output is correct
20 Correct 2853 ms 218584 KB Output is correct
21 Correct 513 ms 218584 KB Output is correct
22 Correct 3169 ms 218584 KB Output is correct
23 Correct 639 ms 218584 KB Output is correct
24 Correct 1483 ms 218584 KB Output is correct
25 Correct 3343 ms 218584 KB Output is correct
26 Correct 2673 ms 218584 KB Output is correct
27 Correct 2243 ms 218584 KB Output is correct
28 Correct 799 ms 218584 KB Output is correct
29 Correct 2153 ms 218584 KB Output is correct
30 Correct 5496 ms 218584 KB Output is correct
31 Correct 4859 ms 218584 KB Output is correct
32 Correct 483 ms 218584 KB Output is correct
33 Correct 866 ms 218584 KB Output is correct
34 Correct 426 ms 218584 KB Output is correct
35 Correct 1773 ms 218584 KB Output is correct
36 Correct 4046 ms 218584 KB Output is correct
37 Correct 2723 ms 218584 KB Output is correct
38 Correct 3146 ms 218584 KB Output is correct
39 Correct 1293 ms 218584 KB Output is correct
40 Correct 5089 ms 218584 KB Output is correct
41 Correct 10193 ms 218584 KB Output is correct
42 Correct 8048 ms 218584 KB Output is correct
43 Correct 963 ms 218584 KB Output is correct
44 Correct 639 ms 218584 KB Output is correct
45 Correct 1876 ms 218584 KB Output is correct
46 Correct 5516 ms 218584 KB Output is correct
47 Correct 5049 ms 218584 KB Output is correct
48 Correct 5619 ms 218584 KB Output is correct
49 Correct 0 ms 218584 KB Output is correct