Submission #48985

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
48985	2018-05-21T06:08:40 Z	Namnamseo	Horses (IOI15_horses)	C++17	Compilation error	0 ms	0 KB

horses

#include "horses.h"

typedef long long ll;

#include <set>
#include <algorithm>
using namespace std;

int n;
int x[500010];
int y[500010];

struct segtype {
	double t[1048576];
	double left[1048576];
	int mi[1048576];
	static const int M=524288;
	void init(){
		for(int i=0; i<2*M; ++i){
			t[i]=left[i]=-1e300;
		}
	}
	void upd(int pos,double val){
		pos+=M;
		t[pos]=val; left[pos]=val; mi[pos]=pos-M; pos>>=1;
		while(pos){
			t[pos]=t[pos*2]+t[pos*2+1];
			left[pos]=max(left[pos*2], t[pos*2]+left[pos*2+1]);
			if(left[pos*2]>t[pos*2]+left[pos*2+1]) mi[pos]=mi[pos*2];
			else mi[pos]=mi[pos*2+1];
			pos>>=1;
		}
	}
} sumt;

const int D=int(1e9)+7;

struct segint{
	static const int M=524288;
	int t[M*2];
	void init(){
		for(int i=0; i<2*M; ++i) t[i]=1;
	}
	void upd(int pos,int val){
		pos+=M; t[pos]=val; pos>>=1;
		while(pos){
			t[pos]=t[pos*2]*1LL*t[pos*2+1]%D;
			pos>>=1;
		}
	}
	int rangePi(int l,int r){
		l+=M; r+=M;
		int ret=1;
		while(l<=r){
			if(l&1) ret=(ret*1LL*t[l++])%D;
			if((r&1)==0) ret=(ret*1LL*t[r--])%D;
			l>>=1; r>>=1;
		}
		return ret;
	}
} seg_int;

int init(int N, int X[], int Y[]) {
	n=N;
	for(int i=0; i<n; ++i){
		x[i]=X[i]; y[i]=Y[i];
	}
	sumt.init(); seg_int.init();
	sumt.upd(0, log(x[0]) + log(y[0]));
	seg_int.upd(0, x[0]);
	for(int i=1; i<n; ++i){
		sumt.upd(i, log(x[i])+log(y[i])-log(y[i-1]));
		seg_int.upd(i, x[i]);
	}
	int max_ind = sumt.mi[1];
	int a=seg_int.rangePi(0, max_ind);
	int b=y[max_ind];
	return a*1LL*b%D;
}

void refresh(int i){
	if(i>=n || i<0) return;
	double t=log(x[i])+log(y[i]);
	if(i) t -= log(y[i-1]);
	sumt.upd(i, t);
	seg_int.upd(i, x[i]);
}

int updateX(int pos, int val) {
	int i=pos;
	x[i]=val;
	refresh(i);
	int max_ind = sumt.mi[1];
	int a=seg_int.rangePi(0, max_ind);
	int b=y[max_ind];
	return a*1LL*b%D;
}

int updateY(int pos, int val) {
	y[pos]=val;
	refresh(pos); refresh(pos+1);
	int max_ind = sumt.mi[1];
	int a=seg_int.rangePi(0, max_ind);
	int b=y[max_ind];
	return a*1LL*b%D;
}

Compilation message

horses.cpp: In member function 'void segint::upd(int, int)':
horses.cpp:47:34: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
    t[pos]=t[pos*2]*1LL*t[pos*2+1]%D;
           ~~~~~~~~~~~~~~~~~~~~~~~^~
horses.cpp: In member function 'int segint::rangePi(int, int)':
horses.cpp:55:32: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
    if(l&1) ret=(ret*1LL*t[l++])%D;
                ~~~~~~~~~~~~~~~~^~
horses.cpp:56:37: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
    if((r&1)==0) ret=(ret*1LL*t[r--])%D;
                     ~~~~~~~~~~~~~~~~^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:69:14: error: 'log' was not declared in this scope
  sumt.upd(0, log(x[0]) + log(y[0]));
              ^~~
horses.cpp:69:14: note: suggested alternative: 'long'
  sumt.upd(0, log(x[0]) + log(y[0]));
              ^~~
              long
horses.cpp:78:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a*1LL*b%D;
         ~~~~~~~^~
horses.cpp: In function 'void refresh(int)':
horses.cpp:83:11: error: 'log' was not declared in this scope
  double t=log(x[i])+log(y[i]);
           ^~~
horses.cpp:83:11: note: suggested alternative: 'long'
  double t=log(x[i])+log(y[i]);
           ^~~
           long
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:96:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a*1LL*b%D;
         ~~~~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:105:16: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
  return a*1LL*b%D;
         ~~~~~~~^~