제출 #210898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
210898		autumn_eel	말 (IOI15_horses)	C++14	37 / 100	485 ms	52316 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;

const int MOD=1000000007;

ll ppow(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1)res=(res*a)%MOD;
		a=(a*a)%MOD;
		b>>=1;
	}
	return res;
}

struct BIT{
	vector<ll>bit;
	BIT(){}
	BIT(int n){
		n=n+10;
		bit=vector<ll>(n,1);
	}
	void add(int k,ll x){
		k++;
		while(k<bit.size()){
			(bit[k]*=x)%=MOD;
			k+=k&-k;
		}
	}
	ll sum(int k){//[0,k)
		ll res=1;
		while(k){
			(res*=bit[k])%=MOD;
			k-=k&-k;
		}
		return res;
	}
}bit;

struct Segtree{
	int N;
	vector<int>dat;
	Segtree(){}
	Segtree(int n){
		N=1;while(N<n)N<<=1;
		dat=vector<int>(2*N);
	}
	void update(int k,int x){
		k+=N;dat[k]=x;
		while(k>1){
			k>>=1;
			dat[k]=max(dat[k*2],dat[k*2+1]);
		}
	}
	int query(int l,int r){
		int res=0;
		for(l+=N,r+=N;l<r;l>>=1,r>>=1){
			if(l&1)res=max(res,dat[l++]);
			if(r&1)res=max(res,dat[--r]);
		}
		return res;
	}
}seg;

int n;
ll x[600000],y[600000];
set<int>se;


ll calc(){
	if(se.empty())return seg.query(0,n);
	ll res=0;
	ll M=1;
	auto s=--se.end();
	while(1){
		M*=x[*s];
		if(M>1e9||s==se.begin())break;
		s--;
	}
	__int128 Max=0,cur=1;
	for(auto it=s;it!=se.end();it++){
		cur*=x[*it];
		Max=max(Max,cur*seg.query(*it,(it==--se.end()?n:*next(it))));
	}
	Max%=MOD;
	Max*=bit.sum(*s);
	return Max%MOD;
}

int init(int N, int X[], int Y[]) {
	n=N;
	bit=BIT(n);seg=Segtree(n);
	rep(i,n){
		x[i]=X[i],y[i]=Y[i];
		bit.add(i,x[i]);
		seg.update(i,y[i]);
		if(x[i]>1)se.insert(i);
	}
	return (int)calc();
}

int updateX(int pos, int val) {
	bit.add(pos,ppow(x[pos],MOD-2)*val%MOD);
	if(val==1){
		se.erase(pos);
	}
	else{
		se.insert(pos);
	}
	x[pos]=val;
	return (int)calc();
}

int updateY(int pos, int val) {
	y[pos]=val;
	seg.update(pos,val);
	return (int)calc();
}

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

horses.cpp: In member function 'void BIT::add(int, ll)':
horses.cpp:28:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(k<bit.size()){
         ~^~~~~~~~~~~
horses.cpp: In function 'll calc()':
horses.cpp:80:8: warning: conversion to 'double' from 'll {aka long long int}' may alter its value [-Wconversion]
   if(M>1e9||s==se.begin())break;
        ^~~
horses.cpp:90:12: warning: conversion to 'll {aka long long int}' from '__int128' may alter its value [-Wconversion]
  return Max%MOD;
         ~~~^~~~
horses.cpp:75:5: warning: unused variable 'res' [-Wunused-variable]
  ll res=0;
     ^~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:99:19: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
   seg.update(i,y[i]);
                ~~~^

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