結果

問題 No.1234 典型RMQ
ユーザー mugen_1337
提出日時 2020-09-18 22:32:19
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
CE  
(最新)
AC  
(最初)
実行時間 -
コード長 5,924 bytes
コンパイル時間 1,630 ms
コンパイル使用メモリ 191,432 KB
最終ジャッジ日時 2025-01-14 17:33:59
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。(リジャッジ後のコンパイルエラーは公開されます)
ただし、clay言語の場合は開発者のデバッグのため、公開されます。

コンパイルメッセージ
main.cpp: In instantiation of ‘std::istream& operator>>(std::istream&, std::vector<_Tp>&) [with T = __int128; std::istream = std::basic_istream<char>]’:
main.cpp:249:10:   required from here
main.cpp:43:18: error: no match for ‘operator>>’ (operand types are ‘std::istream’ {aka ‘std::basic_istream<char>’} and ‘__int128’)
   43 |     for(T &x:v)is>>x;
      |                ~~^~~
In file included from /usr/include/c++/13/sstream:40,
                 from /usr/include/c++/13/complex:45,
                 from /usr/include/c++/13/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:127,
                 from main.cpp:1:
/usr/include/c++/13/istream:325:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(void*&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ (near match)
  325 |       operator>>(void*& __p)
      |       ^~~~~~~~
/usr/include/c++/13/istream:325:7: note:   conversion of argument 1 would be ill-formed:
main.cpp:43:18: error: invalid conversion from ‘__int128’ to ‘void*’ [-fpermissive]
   43 |     for(T &x:v)is>>x;
      |                ~~^~~
      |                  |
      |                  __int128
main.cpp:43:18: error: cannot bind rvalue ‘(void*)((long int)x)’ to ‘void*&’
/usr/include/c++/13/istream:224:7: note: candidate: ‘std::basic_istream<_CharT, _Traits>::__istream_type& std::basic_istream<_CharT, _Traits>::operator>>(long double&) [with _CharT = char; _Traits = std::char_traits<char>; __istream_type = std::basic_istream<char>]’ (near match)
  224 |       operator>>(long double& __f)
      |       ^~~~~~~~
/usr/include/c++/13/istream:224:7: note:   conversion of argument 1 would be ill-formed:
main.cpp:43:18: error: cannot bind non-const lvalue reference of type ‘long double&’ to a value of type ‘__int128’
   43 |     for(T &x:v)is>>x;
      |

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}
struct IOSetup{
IOSetup(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(12);
}
} iosetup;
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
os<<p.first<<" "<<p.second;
return os;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
is>>p.first>>p.second;
return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
for(T &x:v)is>>x;
return is;
}
// 2^127 = 170141183460469231731687303715884105728 ~ 10^38
using int128=__int128;
ostream &operator<<(ostream &os,const __int128 n){
if(n==0){
os<<0;
return os;
}
__int128 num=n;
bool neg=false;
if(num<0)neg=true,num=-num;
string res="";
while(num>0){
res.push_back('0'+num%10);
num/=10;
}
if(neg) res.push_back('-');
reverse(begin(res),end(res));
os<<res;
return os;
}
istream &operator>>(istream &is,__int128 &n){
string s;
is>>s;
int idx=0;
bool neg=false;
if(s[0]=='-')neg=true,idx++;
n=0;
for(;idx<(int)s.size();idx++){
n=10*n+s[idx]-'0';
}
if(neg) n=-n;
return is;
}
__int128 parse(string s){
__int128 ret=0;
for(auto &c:s) ret=ret*10+c-'0';
return ret;
}
__int128 abs128(__int128 x){
return x<0?-x:x;
}
__int128 gcd128(__int128 a,__int128 b){
if(a==0) return b;
if(b==0) return a;
return b>0?gcd128(b,a%b):a;
}
template<typename Monoid, typename OperatorMonoid=Monoid>
struct LazySegmentTree{
using F=function<Monoid(Monoid,Monoid)>;
using G=function<Monoid(Monoid,OperatorMonoid)>;
using H=function<OperatorMonoid(OperatorMonoid,OperatorMonoid)>;
int sz,height;
vector<Monoid> data;
vector<OperatorMonoid> lazy;
const F f;
const G g;
const H h;
const Monoid M1;
const OperatorMonoid OM0;
LazySegmentTree(int n,const F f,const G g,const H h,const Monoid &M1,const OperatorMonoid OM0)
: f(f),g(g),h(h),M1(M1),OM0(OM0) {
sz=1;height=0;
while(sz<n) sz<<=1,height++;
data.assign(2*sz,M1);lazy.assign(2*sz,OM0);
}
void set(int k,const Monoid &x){data[k+sz]=x;}
void build(){for(int k=sz-1;k>0;k--) data[k]=f(data[2*k+0],data[2*k+1]);}
inline void propagate(int k){
if(lazy[k]!=OM0){
lazy[2*k+0]=h(lazy[2*k+0],lazy[k]);
lazy[2*k+1]=h(lazy[2*k+1],lazy[k]);
data[k]=reflect(k);
lazy[k]=OM0;
}
}
inline Monoid reflect(int k){
return lazy[k]==OM0?data[k]:g(data[k],lazy[k]);
}
inline void recalc(int k){
while(k>>=1)data[k]=f(reflect(2*k+0),reflect(2*k+1));
}
inline void thrust(int k){
for(int i=height;i>0;i--) propagate(k>>i);
}
void update(int a,int b,const OperatorMonoid &x){
if(a>=b) return ;
thrust(a+=sz);thrust(b+=sz-1);
for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
if(l&1) lazy[l]=h(lazy[l],x),l++;
if(r&1) --r,lazy[r]=h(lazy[r],x);
}
recalc(a);recalc(b);
}
Monoid query(int a,int b){
thrust(a+=sz);thrust(b+=sz-1);
Monoid L=M1,R=M1;
for(int l=a,r=b+1;l<r;l>>=1,r>>=1){
if(l&1) L=f(L,reflect(l++));
if(r&1) R=f(reflect(--r),R);
}
return f(L,R);
}
Monoid operator[](const int &k){
return query(k,k+1);
}
};
// // range set range min
// using M=ll;
// using OM=ll;
// const M M1=LINF;
// const OM OM0=-LINF;
// M segf(M a,M b){
// return (a<b?a:b);
// }
// M segg(M a,OM b){
// return (b==OM0?a:b);
// }
// OM segh(OM a,OM b){
// return (b==OM0?a:b);
// }
// // range set range max
// using M=ll;
// using OM=ll;
// const M M1=-LINF;
// const OM OM0=-LINF;
// M segf(M a,M b){
// return (a>b?a:b);
// }
// M segg(M a,OM b){
// return (b==OM0?a:b);
// }
// OM segh(OM a,OM b){
// return (b==OM0?a:b);
// }
// range add range min
using M=int128;
using OM=int128;
const OM OM0=0;
M segf(M a,M b){
return (a<b?a:b);
}
M segg(M a,OM b){
return a+b;
}
OM segh(OM a,OM b){
return a+b;
}
// // range add range max
// using M=ll;
// using OM=ll;
// const M M1=-LINF;
// const OM OM0=0;
// M segf(M a,M b){
// return (a>b?a:b);
// }
// M segg(M a,OM b){
// return a+b;
// }
// OM segh(OM a,OM b){
// return a+b;
// }
// // range set range sum (sum, count)
// using M=pair<ll,ll>;
// using OM=ll;
// const M M1=M(0,0);
// const OM OM0=-LINF;
// M segf(M a,M b){
// return M(a.first+b.first,a.second+b.second);
// }
// M segg(M a,OM b){
// return M(a.second*b,a.second);
// }
// ll segh(ll a,ll b){
// return (b==OM0?a:b);
// }
signed main(){
const M M1=parse("1001002003004005006192291");
int n;cin>>n;
vector<int128> v(n);
cin>>v;
LazySegmentTree<M,OM> seg(n,segf,segg,segh,M1,OM0);
rep(i,n)seg.set(i,v[i]);
seg.build();
int q;cin>>q;
while(q--){
int k,l,r;int128 c;cin>>k>>l>>r>>c;
l--;
if(k==1){
seg.update(l,r,c);
}else{
cout<<seg.query(l,r)<<endl;
}
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0