제출 #621350

#제출 시각아이디문제언어결과실행 시간메모리
621350A_D말 (IOI15_horses)C++14
100 / 100
1415 ms64744 KiB
#include "horses.h" #include <bits/stdc++.h> using namespace std; const int N=1e6+100; const long long MOD=1e9+7; const long long L=32; long long x[N]; long long y[N]; set<int> st; int n; vector<int> vec; long long seg[4*N]; long long seg2[4*N]; void build(int p,int s,int e) { if(s==e){ seg[p]=y[s]; seg2[p]=x[s]; return; } int mid=(s+e)/2; build(p*2,s,mid); build(p*2+1,mid+1,e); seg[p]=max(seg[p*2],seg[p*2+1]); seg2[p]=(seg2[p*2]*seg2[p*2+1])%MOD; } void update(int p,int s,int e,int i,int val) { if(s==e){ seg[p]=val; return; } int mid=(s+e)/2; if(i<=mid){ update(p*2,s,mid,i,val); } else{ update(p*2+1,mid+1,e,i,val); } seg[p]=max(seg[p*2],seg[p*2+1]); } void update2(int p,int s,int e,int i,int val) { if(s==e){ seg2[p]=val; return; } int mid=(s+e)/2; if(i<=mid){ update2(p*2,s,mid,i,val); } else{ update2(p*2+1,mid+1,e,i,val); } seg2[p]=(seg2[p*2]*seg2[p*2+1])%MOD; } long long get(int p,int s,int e,int a,int b) { if(a<=s&&e<=b){ return seg[p]; } if(s>b||e<a)return 1; int mid=(s+e)/2; return max(get(p*2,s,mid,a,b),get(p*2+1,mid+1,e,a,b)); } long long get2(int p,int s,int e,int a,int b) { if(b==-1)return 1; if(a<=s&&e<=b){ return seg2[p]; } if(s>b||e<a)return 1; int mid=(s+e)/2; return (get2(p*2,s,mid,a,b)*get2(p*2+1,mid+1,e,a,b))%MOD; } void filvec() { vec.clear(); int cnt=0; for(auto x:st){ vec.push_back(-x); cnt++; if(cnt==L)break; } if(vec.empty()||vec.back()!=0)vec.push_back(0); reverse(vec.begin(),vec.end()); } long long getansst() { filvec(); long long ret=0; long long sum2=1,val=0; for(int h=0;h<vec.size();h++){ int i=vec[h]; int i2; if(h==vec.size()-1)i2=n; else i2=vec[h+1]; sum2*=x[i]; long long cc=get(1,0,n-1,i,i2-1); long long u=sum2*cc; if((sum2>val)||(u>val)){ sum2=1; ret=cc*get2(1,0,n-1,0,i); val=cc; } } ret%=MOD; return ret; } int init(int N, int X[], int Y[]){ st.clear(); n=N; for(int i=0;i<N;i++){ x[i]=X[i]; y[i]=Y[i]; if(x[i]!=1){ st.insert(-i); } } build(1,0,n-1); long long u=getansst(); return u; } int updateX(int pos, int val) { if(x[pos]!=1)st.erase(-pos); x[pos]=val; if(x[pos]!=1)st.insert(-pos); update2(1,0,n-1,pos,val); long long u=getansst(); return u; } int updateY(int pos, int val) { y[pos] = val; update(1,0,n-1,pos,val); long long u=getansst(); return u; }

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

horses.cpp: In function 'void filvec()':
horses.cpp:89:14: warning: declaration of 'x' shadows a global declaration [-Wshadow]
   89 |     for(auto x:st){
      |              ^
horses.cpp:10:11: note: shadowed declaration is here
   10 | long long x[N];
      |           ^
horses.cpp: In function 'long long int getansst()':
horses.cpp:103:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |     for(int h=0;h<vec.size();h++){
      |                 ~^~~~~~~~~~~
horses.cpp:106:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |         if(h==vec.size()-1)i2=n;
      |            ~^~~~~~~~~~~~~~
horses.cpp: In function 'int init(int, int*, int*)':
horses.cpp:121:14: warning: declaration of 'N' shadows a global declaration [-Wshadow]
  121 | int init(int N, int X[], int Y[]){
      |          ~~~~^
horses.cpp:7:11: note: shadowed declaration is here
    7 | const int N=1e6+100;
      |           ^
horses.cpp:134:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  134 |     return u;
      |            ^
horses.cpp: In function 'int updateX(int, int)':
horses.cpp:146:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  146 |     return u;
      |            ^
horses.cpp: In function 'int updateY(int, int)':
horses.cpp:155:12: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
  155 |     return u;
      |            ^
#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...