oj.uz

Submission #923070

# Submission time Handle Problem Language Result Execution time Memory
923070 2024-02-06T14:12:56 Z oblantis Horses (IOI15_horses) C++17
57 / 100
 505 ms 87200 KB 
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
using namespace std;
using namespace __gnu_pbds;
typedef pair<int, int> pii;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const int mod = 1e9+7;
const int maxn = 5e5 + 4;
__int128 inf;
__int128 t[maxn * 4];
int it, xl;
int n;
__int128 a[maxn], b[maxn], mx[maxn * 4];
set<int> s;
void upd(int v, int l, int r){
	if(l + 1 == r){
		t[v] = a[l];
		mx[v] = b[l];
		return;
	}
	if((l + r) / 2 <= it)upd(v * 2 + 2, (l + r) / 2, r);
	else upd(v * 2 + 1, l, (l + r) / 2);
	t[v] = t[v * 2 + 1] * t[v * 2 + 2] % mod;
	mx[v] = max(mx[v * 2 + 1], mx[v * 2 + 2]);
}
__int128 gm(int v, int l, int r){
	if(xl <= l)return mx[v];
	if(r <= xl)return 0;
	return max(gm(v * 2 + 1, l, (l + r) / 2), gm(v * 2 + 2, (l + r) / 2, r));
}
__int128 mlp(int v, int l, int r){
	if(r <= xl + 1)return t[v];
	if(xl < l) return 1;
	return mlp(v * 2 + 1, l, (l + r) / 2) * mlp(v * 2 + 2, (l + r) / 2, r) % mod; 
}
int get(){
	xl = 0;
	__int128 ans = gm(0, 0, n), p = 1, k = 0;
	if(s.empty()){
		return ans;
	}
	auto i = --s.end();
	while(1){
		xl = *i;
		__int128 nx = gm(0, 0, n);
		if(p * k < nx){
			ans = nx * mlp(0, 0, n) % mod;
			k = nx;
		}
		p *= a[xl];
		if(p > inf)break;
		if(i == s.begin())break;
		--i;
	}
	xl = 0;
	__int128 nx = gm(0, 0, n);
	if(p * k < nx)ans = nx;
	return ans;
}
int init(int m, int x[], int y[]) {
	inf = 1;
	int wt = 50;
	while(wt--)inf *= 2;
	n = m;
	for(int i = 0; i < n; i++){
		a[i] = x[i], b[i] = y[i];
		it = i; 
		upd(0, 0, n);
		if(a[i] != 1)s.insert(i);
	}
	return get();
}
 
int updateX(int pos, int val) {	
	if(a[pos] == val)return get();
	if(a[pos] == 1)s.insert(pos);
	else if(val == 1)s.erase(pos);
	it = pos;
	a[it] = val;
	upd(0, 0, n);
	return get();
}
 
int updateY(int pos, int val) {
	if(b[pos] == val)return get();
	it = pos;
	b[it] = val;
	upd(0, 0, n);
	return get();
}
//int main(){
	//int n;
	//cin >> n;
	//int x[n], y[n];
	//for(int i = 0; i < n; i++)cin >> x[i];
	//for(int i = 0; i < n; i++)cin >> y[i];
	//cout << init(n, x, y) << '\n';
	//int m;
	//cin >> m;
	//while(m--){
		//int wt, pos, val;
		//cin >> wt >> pos >> val;
		//if(wt == 2)cout << updateY(pos,val) << '\n';
		//else cout << updateX(pos,val) << '\n';
	//}
	
	//return 0;
//}

Compilation message

horses.cpp: In function 'int get()':
horses.cpp:48:10: warning: conversion from '__int128' to 'int' may change value [-Wconversion]
   48 |   return ans;
      |          ^~~
horses.cpp:66:9: warning: conversion from '__int128' to 'int' may change value [-Wconversion]
   66 |  return ans;
      |         ^~~

Subtask #1
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 6488 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 432 KB Output is correct
15 Correct 0 ms 600 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 6644 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 616 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 0 ms 448 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 2 ms 460 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 505 ms 81068 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 7004 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 1 ms 6488 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 456 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 138 ms 56948 KB Output is correct
34 Correct 154 ms 56844 KB Output is correct
35 Correct 267 ms 87192 KB Output is correct
36 Correct 248 ms 87200 KB Output is correct
37 Correct 152 ms 55064 KB Output is correct
38 Correct 187 ms 68092 KB Output is correct
39 Correct 124 ms 54836 KB Output is correct
40 Correct 251 ms 82772 KB Output is correct
41 Correct 134 ms 55120 KB Output is correct
42 Correct 135 ms 55400 KB Output is correct
43 Correct 224 ms 82844 KB Output is correct
44 Correct 227 ms 83024 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6592 KB Output is correct
8 Correct 1 ms 6492 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6492 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 6488 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 1 ms 6492 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 456 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 6492 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 2 ms 6492 KB Output is correct
29 Correct 1 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Incorrect 491 ms 80944 KB Output isn't correct
34 Halted 0 ms 0 KB -