제출 #206116

#제출 시각아이디문제언어결과실행 시간메모리
206116Segtree말 (IOI15_horses)C++14
34 / 100
1598 ms8340 KiB
#include"horses.h" #include<iostream> #include<algorithm> #include<vector> #include<queue> using namespace std; typedef long long ll; #define chmin(a,b) a=min(a,b) #define chmax(a,b) a=max(a,b) #define all(x) x,begin(),x.end() #define rep(i,n) for(int i=0;i<n;i++) #define mod 1000000007 #define mad(a,b) a=(a+b)%mod int N,X[500010],Y[500010]; int solve(){ ll rui=1,p; for(int i=N-1;i>=0;i--){ rui*=X[i]; if(rui<=(ll)2e9)p=i; else break; } ll ans=0; rui=1; if(p-1>=0)ans=Y[p-1]; for(int i=p;i<N;i++){ rui*=X[i]; chmax(ans,rui*Y[i]); } ans%=mod; for(int i=0;i<p;i++)ans=ans*X[i]%mod; return ans; } int init(int n,int x[],int y[]){ N=n; rep(i,N)X[i]=x[i],Y[i]=y[i]; return solve(); } int updateX(int pos,int val){ X[pos]=val; return solve(); } int updateY(int pos,int val){ Y[pos]=val; return solve(); }/* int main(){ cin>>N; rep(i,N)cin>>X[i]; rep(i,N)cin>>Y[i]; cout<<init(N,X,Y)<<endl; while(1){ string type; ll pos,val; cin>>type>>pos>>val; if(type=="X")cout<<updateX(pos,val)<<endl; if(type=="Y")cout<<updateY(pos,val)<<endl; } }*/

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

horses.cpp: In function 'int solve()':
horses.cpp:25:12: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  for(int i=p;i<N;i++){
            ^
horses.cpp:31:9: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  return ans;
         ^~~
horses.cpp:16:11: warning: 'p' may be used uninitialized in this function [-Wmaybe-uninitialized]
  ll rui=1,p;
           ^
#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...