제출 #40049

#제출 시각아이디문제언어결과실행 시간메모리
40049igzi말 (IOI15_horses)C++14
17 / 100
78 ms47600 KiB
#include <bits/stdc++.h> #include "horses.h" #define maxN 500005 #define mod 1000000007 using namespace std; struct segment{ long long a,b;}; segment seg[4*maxN]; vector <long long> x,y; void build(int n,int l,int d){ if(l==d){ seg[n].a=x[l]; seg[n].b=(x[l]*y[l])%mod; } else{ int m=(l+d)/2; build(2*n,l,m); build(2*n+1,m+1,d); seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod; seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod; } } void updatex(int n,int l,int d,int p,long long v){ if(l==d){ x[l]=v; seg[n].a=x[l]; seg[n].b=(x[l]*y[l])%mod; } else{ int m=(l+d)/2; if(p<=m) updatex(2*n,l,m,p,v); else updatex(2*n+1,m+1,d,p,v); seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod; seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod; } } void updatey(int n,int l,int d,int p,long long v){ if(l==d){ y[l]=v; seg[n].b=(x[l]*y[l])%mod; } else{ int m=(l+d)/2; if(p<=m) updatey(2*n,l,m,p,v); else updatey(2*n+1,m+1,d,p,v); seg[n].a=(seg[2*n].a*seg[2*n+1].a)%mod; seg[n].b=(max(seg[2*n].b,(seg[2*n+1].b*seg[2*n].a)%mod))%mod; } } int init(int n,int a[],int b[]){ int i; long long ans; for(i=0;i<n;i++){ x.push_back(a[i]%mod); y.push_back(b[i]%mod); } build(1,0,n-1); ans=seg[1].b%mod; return (int) ans; } int updateX(int pos,int val){ long long ans; updatex(1,0,x.size()-1,pos,(long long) val); ans=seg[1].b%mod; return (int) ans; } int updateY(int pos,int val){ long long ans; updatey(1,0,y.size()-1,pos,(long long) val); ans=seg[1].b%mod; return (int) ans; }

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

horses.cpp: In function 'int updateX(int, int)':
horses.cpp:67:43: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
 updatex(1,0,x.size()-1,pos,(long long) val);
                                           ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:73:43: warning: conversion to 'int' from 'std::vector<long long int>::size_type {aka long unsigned int}' may alter its value [-Wconversion]
 updatey(1,0,y.size()-1,pos,(long long) val);
                                           ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...