oj.uz

답안 #276916

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
276916 2020-08-20T18:50:37 Z _7_7_ 게임 (IOI13_game) C++14
80 / 100
 4323 ms 256004 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 = 1e6 + 11, mod = 998244353, N = 2e7 + 2e6 + 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;

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

ST T[N];

void upd1 (int pos, ll x, int v, int tl = 0, int tr = inf - 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 = inf - 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 = inf - 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 = inf - 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);
			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);
			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 = inf - 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 n, int m) {
//	assert(0);
	TT[++Sz1].v = ++Sz;
}

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

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 974 ms 27640 KB Output is correct
5 Correct 741 ms 27696 KB Output is correct
6 Correct 938 ms 24568 KB Output is correct
7 Correct 1043 ms 24212 KB Output is correct
8 Correct 717 ms 15492 KB Output is correct
9 Correct 1051 ms 24508 KB Output is correct
10 Correct 933 ms 23960 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 3 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1496 ms 11696 KB Output is correct
13 Correct 1883 ms 5084 KB Output is correct
14 Correct 717 ms 1152 KB Output is correct
15 Correct 2213 ms 7564 KB Output is correct
16 Correct 630 ms 12408 KB Output is correct
17 Correct 1269 ms 8984 KB Output is correct
18 Correct 2059 ms 12444 KB Output is correct
19 Correct 1996 ms 12864 KB Output is correct
20 Correct 1861 ms 12156 KB Output is correct
21 Correct 1 ms 384 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 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 932 ms 27384 KB Output is correct
13 Correct 737 ms 27512 KB Output is correct
14 Correct 921 ms 24568 KB Output is correct
15 Correct 1039 ms 24388 KB Output is correct
16 Correct 667 ms 15456 KB Output is correct
17 Correct 960 ms 24492 KB Output is correct
18 Correct 1000 ms 23956 KB Output is correct
19 Correct 1390 ms 11496 KB Output is correct
20 Correct 1840 ms 5364 KB Output is correct
21 Correct 635 ms 1144 KB Output is correct
22 Correct 2225 ms 7688 KB Output is correct
23 Correct 651 ms 12348 KB Output is correct
24 Correct 1313 ms 9208 KB Output is correct
25 Correct 2147 ms 12688 KB Output is correct
26 Correct 1892 ms 12724 KB Output is correct
27 Correct 1747 ms 12236 KB Output is correct
28 Correct 857 ms 125620 KB Output is correct
29 Correct 1927 ms 140904 KB Output is correct
30 Correct 4313 ms 102052 KB Output is correct
31 Correct 4101 ms 78052 KB Output is correct
32 Correct 619 ms 1272 KB Output is correct
33 Correct 759 ms 2296 KB Output is correct
34 Correct 500 ms 137848 KB Output is correct
35 Correct 1439 ms 70776 KB Output is correct
36 Correct 2623 ms 138356 KB Output is correct
37 Correct 2257 ms 138384 KB Output is correct
38 Correct 2268 ms 137900 KB Output is correct
39 Correct 1793 ms 106440 KB Output is correct
40 Correct 1 ms 384 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 2 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 935 ms 27364 KB Output is correct
13 Correct 721 ms 27628 KB Output is correct
14 Correct 925 ms 24544 KB Output is correct
15 Correct 990 ms 24312 KB Output is correct
16 Correct 661 ms 15608 KB Output is correct
17 Correct 975 ms 24632 KB Output is correct
18 Correct 915 ms 24128 KB Output is correct
19 Correct 1434 ms 11728 KB Output is correct
20 Correct 1857 ms 5132 KB Output is correct
21 Correct 636 ms 1272 KB Output is correct
22 Correct 2171 ms 7452 KB Output is correct
23 Correct 668 ms 12408 KB Output is correct
24 Correct 1287 ms 9044 KB Output is correct
25 Correct 2138 ms 12772 KB Output is correct
26 Correct 1808 ms 12968 KB Output is correct
27 Correct 1760 ms 12420 KB Output is correct
28 Correct 887 ms 125688 KB Output is correct
29 Correct 1898 ms 140912 KB Output is correct
30 Correct 4323 ms 101880 KB Output is correct
31 Correct 4035 ms 78012 KB Output is correct
32 Correct 588 ms 1144 KB Output is correct
33 Correct 744 ms 2424 KB Output is correct
34 Correct 506 ms 137848 KB Output is correct
35 Correct 1387 ms 70520 KB Output is correct
36 Correct 2900 ms 138232 KB Output is correct
37 Correct 2425 ms 138232 KB Output is correct
38 Correct 2242 ms 137720 KB Output is correct
39 Runtime error 1168 ms 256004 KB Execution killed with signal 9
40 Halted 0 ms 0 KB -