oj.uz

답안 #278373

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
278373 2020-08-21T12:14:11 Z _7_7_ 게임 (IOI13_game) C++
80 / 100
 3983 ms 256000 KB 
#include "game.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define fastio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
 
 
typedef pair < long long, long long > pll;    
typedef unsigned long long ull;
typedef pair < int, int > pii;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;
 
typedef tree < int, null_type, less < int >, rb_tree_tag, tree_order_statistics_node_update > ordered_set;
 
const int inf = 1e9, maxn = 3e5 + 11, mod = 998244353, N = 1e7 + 7e6 + 11;
const int dx[] = {-1, 0, 1, 0}, dy[] = {0, -1, 0, 1}, block = 300;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = acos(-1);
const ll INF = 1e18;

int Sz, n, m;
               	
ll gcd (ll x, ll y) {
	while (1) {
		if (x > y)
			swap(x, y);
		if (!x)				
			return y;		
//		cerr << x << ' ' << y << endl;
		y %= x;
	}
}

struct ST {
	int l, r;
	ll g;
};

ST T[N];

void upd1 (int pos, ll x, int v, int tl = 0, int tr = m - 1) {
	if (tl == tr) {
		T[v].g = x;
		return;
	}

	int tm = (tl + tr) >> 1;
	if (pos <= tm) {
		if (!T[v].l) 
			T[v].l = ++Sz;
		upd1(pos, x, T[v].l, tl, tm);
	} else {
		if (!T[v].r)
			T[v].r = ++Sz;
		upd1(pos, x, T[v].r, tm + 1, tr);
	}

	T[v].g = gcd(T[T[v].l].g, T[T[v].r].g);
}

ll get1 (int l, int r, int v, int tl = 0, int tr = m - 1) {
	if (l > r || tl > r || l > tr)
		return 0;

	if (l <= tl && tr <= r)
		return T[v].g;

	int tm = (tl + tr) >> 1;
	
	ll res = 0;
	
	if (T[v].l)
		res = get1(l, r, T[v].l, tl, tm);

	if (T[v].r)
		res = gcd(res, get1(l, r, T[v].r, tm + 1, tr));

 	return res;
}

ll get2 (int pos, int v, int tl = 0, int tr = m - 1) {
	if (tl == tr) 
		return T[v].g; 

	int tm = (tl + tr) >> 1;
	if (pos <= tm) {
		if (!T[v].l)
			return 0;
		return get2(pos, T[v].l, tl, tm);
	}

	if (!T[v].r)
		return 0;

	return get2(pos, T[v].r, tm + 1, tr);
}


struct STT {
	int l, r, v;
};

STT TT[maxn];

int Sz1;



void upd (int x, int y, ll z, int v = 1, int tl = 0, int tr = n - 1) {
	if (tl == tr) {
		upd1(y, z, TT[v].v);
		return;
	}

	int tm = (tl + tr) >> 1;

	if (x <= tm) {
		if (!TT[v].l) {
//			assert(Sz + 1 < N);
//			assert(Sz1 + 1 < maxn);
//			if (Sz + 1 == N || Sz1 + 1 == maxn) 
//				exit(0);
			TT[v].l = ++Sz1;
			TT[Sz1].v = ++Sz;
		}
		upd(x, y, z, TT[v].l, tl, tm);
	} else {
		if (!TT[v].r) {
//			assert(Sz + 1 < N);
//			assert(Sz1 + 1 < maxn);
//			if (Sz + 1 == N || Sz1 + 1 == maxn) 
//				exit(0);			
			TT[v].r = ++Sz1;
			TT[Sz1].v = ++Sz;
		}
		upd(x, y, z, TT[v].r, tm + 1, tr);
	}

	ll cur = 0;
	if (TT[v].l) 
		cur = get2(y, TT[TT[v].l].v); 
	
	if (TT[v].r)
		cur = gcd(cur, get2(y, TT[TT[v].r].v));

	upd1(y, cur, TT[v].v);
}

ll get (int l, int r, int x, int y, int v, int tl = 0, int tr = n - 1) {
	if (l > r || tl > r || l > tr)
		return 0;

	if (l <= tl && tr <= r)
		return get1(x, y, TT[v].v);

	int tm = (tl + tr) >> 1;	
	
	ll res = 0;
	
	if (TT[v].l)
		res = get(l, r, x, y, TT[v].l, tl, tm);

	if (TT[v].r)
		res = gcd(res, get(l, r, x, y, TT[v].r, tm + 1, tr));

	return res;
}


void init(int r, int c) {
//	assert(0);
	n = r, m = c;
	TT[++Sz1].v = ++Sz;
}

void update(int x, int y, ll z) {
//	cerr << x << ' ' << y << ' ' << z << endl;
	upd(x, y, z, 1);
//	cerr << Sz << ' ' << Sz1 << endl;
}

long long calculate(int lf, int x, int rg, int y) {		
//	cerr << x << ' ' << y << ' ' << lf << ' ' << rg << endl;
    return get(lf, rg, x, y, 1);
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 416 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 723 ms 8568 KB Output is correct
5 Correct 622 ms 8864 KB Output is correct
6 Correct 547 ms 5752 KB Output is correct
7 Correct 600 ms 5496 KB Output is correct
8 Correct 492 ms 4508 KB Output is correct
9 Correct 612 ms 5564 KB Output is correct
10 Correct 517 ms 5116 KB Output is correct
11 Correct 1 ms 256 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1030 ms 10104 KB Output is correct
13 Correct 1509 ms 3792 KB Output is correct
14 Correct 324 ms 1028 KB Output is correct
15 Correct 1803 ms 5064 KB Output is correct
16 Correct 222 ms 9712 KB Output is correct
17 Correct 966 ms 6632 KB Output is correct
18 Correct 1483 ms 10136 KB Output is correct
19 Correct 1333 ms 10212 KB Output is correct
20 Correct 1135 ms 9612 KB Output is correct
21 Correct 1 ms 288 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 659 ms 8576 KB Output is correct
13 Correct 458 ms 8844 KB Output is correct
14 Correct 495 ms 5712 KB Output is correct
15 Correct 580 ms 5428 KB Output is correct
16 Correct 426 ms 4408 KB Output is correct
17 Correct 566 ms 5624 KB Output is correct
18 Correct 512 ms 5112 KB Output is correct
19 Correct 1025 ms 10360 KB Output is correct
20 Correct 1519 ms 3640 KB Output is correct
21 Correct 338 ms 1016 KB Output is correct
22 Correct 1926 ms 4868 KB Output is correct
23 Correct 318 ms 9848 KB Output is correct
24 Correct 947 ms 6616 KB Output is correct
25 Correct 1411 ms 9976 KB Output is correct
26 Correct 1241 ms 10352 KB Output is correct
27 Correct 1207 ms 9720 KB Output is correct
28 Correct 830 ms 125564 KB Output is correct
29 Correct 1911 ms 140792 KB Output is correct
30 Correct 3978 ms 101880 KB Output is correct
31 Correct 3780 ms 77980 KB Output is correct
32 Correct 576 ms 1144 KB Output is correct
33 Correct 732 ms 2296 KB Output is correct
34 Correct 510 ms 137848 KB Output is correct
35 Correct 1292 ms 70376 KB Output is correct
36 Correct 2531 ms 138232 KB Output is correct
37 Correct 2118 ms 138268 KB Output is correct
38 Correct 2172 ms 137740 KB Output is correct
39 Correct 1900 ms 106356 KB Output is correct
40 Correct 0 ms 256 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 288 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 651 ms 8684 KB Output is correct
13 Correct 478 ms 8824 KB Output is correct
14 Correct 528 ms 5624 KB Output is correct
15 Correct 558 ms 5496 KB Output is correct
16 Correct 382 ms 4344 KB Output is correct
17 Correct 588 ms 5624 KB Output is correct
18 Correct 526 ms 5240 KB Output is correct
19 Correct 1027 ms 10104 KB Output is correct
20 Correct 1461 ms 3728 KB Output is correct
21 Correct 324 ms 924 KB Output is correct
22 Correct 1751 ms 4940 KB Output is correct
23 Correct 226 ms 9720 KB Output is correct
24 Correct 802 ms 6648 KB Output is correct
25 Correct 1385 ms 10096 KB Output is correct
26 Correct 1265 ms 10324 KB Output is correct
27 Correct 1058 ms 9848 KB Output is correct
28 Correct 806 ms 125816 KB Output is correct
29 Correct 1884 ms 141024 KB Output is correct
30 Correct 3983 ms 102048 KB Output is correct
31 Correct 3815 ms 78088 KB Output is correct
32 Correct 603 ms 1228 KB Output is correct
33 Correct 741 ms 2468 KB Output is correct
34 Correct 493 ms 137848 KB Output is correct
35 Correct 1364 ms 70324 KB Output is correct
36 Correct 2575 ms 138360 KB Output is correct
37 Correct 1999 ms 138488 KB Output is correct
38 Correct 1928 ms 137848 KB Output is correct
39 Runtime error 1185 ms 256000 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -