제출 #204771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
204771		TAISA_	말 (IOI15_horses)	C++14	54 / 100	1551 ms	29976 KiB

horses

#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int x[500000],y[500000];
int n;
const ll mod=1000000007LL;
struct segtree{
	int n;
	vector<ll> dat;
	void build(int n_){
		n=1;
		while(n<n_)n<<=1;
		dat.resize(2*n,1);
	}
	void upd(int k,ll s){
		k+=n;
		dat[k]=s%mod;
		k>>=1;
		while(k>0){
			dat[k]=dat[k<<1]*dat[k<<1|1]%mod;
			k>>=1;
		}
	}
	ll get(int a,int b,int k,int l,int r){
		if(b<=l||r<=a)return 1LL;
		if(a<=l&&r<=b)return dat[k]%mod;
		int m=(l+r)/2;
		return get(a,b,k<<1,l,m)*get(a,b,k<<1|1,m,r)%mod;
	}
	ll get(int a,int b){return get(a,b,1,0,n);}
} seg;
ll calc(){
	ll id=n-1,t=x[n-1];
	for(int i=n-2;i>=0;i--){
		if(y[i]>t*y[id]){
			id=i;
			t=1;
		}
		t*=x[i];
		if(t>=mod){
			break;
		}
	} 
	return y[id]*seg.get(0,id+1)%mod;
}
int init(int N, int X[], int Y[]) {
	n=N;
	seg.build(n+10);
	for(int i=0;i<n;i++){
		x[i]=X[i];
		y[i]=Y[i];
		seg.upd(i,x[i]);
	}
	return calc();
}
int updateX(int pos, int val) {	
	x[pos]=val;
	seg.upd(pos,val);
	return calc();
}

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

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

horses.cpp: In function 'll calc()':
horses.cpp:45:27: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return y[id]*seg.get(0,id+1)%mod;
                         ~~^~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:55:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return calc();
         ~~~~^~
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:60:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return calc();
         ~~~~^~
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:65:13: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return calc();
         ~~~~^~

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