제출 #583901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583901		M_W	말 (IOI15_horses)	C++17	100 / 100	943 ms	40356 KiB

horses

#include <bits/stdc++.h>
using namespace std;
long long tp[500001 << 2], tmd[500001 << 2], Y[500001], X[500001];
const long long md = 1e9 + 7;
int N;

void upd_product(int v, int tl, int tr, int pos, int val){
	if(tl == pos && tl == tr){
		tp[v] = tmd[v] = val * 1ll;
		return;
	}
	int tm = (tl + tr) >> 1;
	if(pos <= tm) upd_product(v * 2, tl, tm, pos, val);
	else upd_product(v * 2 + 1, tm + 1, tr, pos, val);
	
	tmd[v] = ((tmd[v * 2] % md) * (tmd[v * 2 + 1] % md)) % md;
	tp[v] = tp[v * 2] * tp[v * 2 + 1];
	if(abs(tp[v]) > md || tp[v * 2] == -1 || tp[v * 2 + 1] == -1) tp[v] = -1;
}

long long query_product(int v, int tl, int tr, int l, int r){
	if(l > r) return 1ll;
	if(tl == l && tr == r) return tp[v];
	int tm = (tl + tr) >> 1;
	
	long long left = query_product(v * 2, tl, tm, l, min(r, tm));
	long long right = query_product(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
	
	if(left == -1ll || right == -1ll || left * right > md) return -1ll;
	return left * right;
}


long long query_md(int v, int tl, int tr, int l, int r){
	if(l > r) return 1ll;
	if(tl == l && tr == r) return tmd[v];
	int tm = (tl + tr) >> 1;
	
	long long left = query_md(v * 2, tl, tm, l, min(r, tm));
	long long right = query_md(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
	
	return (left * right) % md;
}

// Actual query tree
int t[500001 << 2];

void build(int v, int tl, int tr){
	if(tl == tr){
		t[v] = tl;
		return;
	}
	int tm = (tl + tr) >> 1;
	build(v * 2, tl, tm);
	build(v * 2 + 1, tm + 1, tr);
	
	long long Yl = Y[t[v * 2]], Yr = Y[t[v * 2 + 1]];
	long long prod = query_product(1, 0, N - 1, t[v * 2] + 1, t[v * 2 + 1]);
	
	if(prod == -1ll || prod * Yr > Yl) t[v] = t[v * 2 + 1];
	else t[v] = t[v * 2];
}

void ins(int v, int tl, int tr, int pos){
	if(tl == pos && tl == tr) return;
	int tm = (tl + tr) >> 1;
	
	if(pos <= tm) ins(v * 2, tl, tm, pos);
	else ins(v * 2 + 1, tm + 1, tr, pos);
	
	long long Yl = Y[t[v * 2]], Yr = Y[t[v * 2 + 1]];
	long long prod = query_product(1, 0, N - 1, t[v * 2] + 1, t[v * 2 + 1]);
	
	if(prod == -1ll || prod * Yr > Yl) t[v] = t[v * 2 + 1];
	else t[v] = t[v * 2];
}

int cur;

int init(int N_tmp, int X_tmp[], int Y_tmp[]){
	N = N_tmp;
	for(int i = 0; i < N; i++) X[i] = X_tmp[i] * 1ll;
	for(int i = 0; i < N; i++) upd_product(1, 0, N - 1, i, X[i]);
	for(int i = 0; i < N; i++) Y[i] = Y_tmp[i] * 1ll;
	build(1, 0, N - 1);
	
	return int((query_md(1, 0, N - 1, 0, t[1]) * Y[t[1]]) % md);
}

int updateX(int pos, int val){
	X[pos] = val;
	upd_product(1, 0, N - 1, pos, val);
	ins(1, 0, N - 1, pos);
	return int((query_md(1, 0, N - 1, 0, t[1]) * Y[t[1]]) % md);
}

int updateY(int pos, int val){
	Y[pos] = val;
	ins(1, 0, N - 1, pos);
	return int((query_md(1, 0, N - 1, 0, t[1]) * Y[t[1]]) % md);
}

컴파일 시 표준 에러 (stderr) 메시지

horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:83:60: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   83 |  for(int i = 0; i < N; i++) upd_product(1, 0, N - 1, i, X[i]);
      |                                                         ~~~^

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