제출 #118911

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
118911		TuGSGeReL	말 (IOI15_horses)	C++17	17 / 100	18 ms	8448 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define ll long long
#define mp make_pair
#define pub push_back
#define pob pop_back()
#define ss second
#define ff first
#define mt make_tuple
#define pof pop_front()
#define fbo find_by_order
#define ook order_of_key
#define lb lower_bound
#define ub upper_bound

typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
using pll = pair <ll, ll>;
using pii = pair <int, int>;

ll mod = 1e9 + 7, ans[300001], n, terx[300001], tery[300001], sx[300001];
double mx[300001], sgx[300001], sgy[300001];

void upd(ll node, ll idx, ll l, ll r, ll x, ll y)
{
	if ( l > idx || r < idx )
		return;
	
	if ( l == r ) {
		if ( x != -1 ) {
			sgx[node] = (double)log(x);
			terx[node] = x;
		}
		
		if ( y != -1 ) {
			sgy[node] = (double)log(y);
			tery[node] = y;
		}
		
		sx[node] = x;
		mx[node] = sgx[node] + sgy[node];
		ans[node] = (terx[node] * tery[node]) % mod;
		return;
	}
	
	ll mid = (l + r) / 2;
	
	upd(node * 2, idx, l, mid, x, y);
	upd(node * 2 + 1, idx, mid + 1, r, x, y);
	
	sgx[node] = sgx[node * 2] + sgx[node * 2 + 1];
	sx[node] = (sx[node * 2] * sx[node * 2 + 1]) % mod;
	
	if ( mx[node * 2] > mx[node * 2 + 1] + sgx[node * 2] ) {
		mx[node] = mx[node * 2];
		ans[node] = ans[node * 2];
	} else {
		mx[node] = mx[node * 2 + 1] + sgx[node * 2];
		ans[node] = (ans[node * 2 + 1] * sx[node * 2]) % mod;
	}
}

int init(int N, int X[], int Y[]) {
	n = N;
		
	for (ll i = 0; i < N; i++)
		upd(1, i + 1, 1, N, X[i], Y[i]);
		
	return (int)ans[1];
}

int updateX(int pos, int val) {
	upd(1, pos + 1, 1, n, val, -1);
	return (int)ans[1];
}

int updateY(int pos, int val) {
	upd(1, pos + 1, 1, n, -1, val);
	return (int)ans[1];
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 17
• Subtask 3: 0 / 20
• Subtask 4: 0 / 23
• Subtask 5: 0 / 23