Pagini recente » Borderou de evaluare (job #2493753) | Cod sursa (job #2742709) | Cod sursa (job #993799) | Cod sursa (job #2302364) | Cod sursa (job #3334617)
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops,inline")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define setinf(x) memset(x,0x3f3f3f3f,sizeof(x));
#define set0(x) memset(x,0,sizeof(x));
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define vi vector<int>
#define ll long long
#define vll vector<ll>
#define pb push_back
#define fi first
#define se second
#define DD 100001
#define nl '\n'
using namespace std;
const string file="aib";
ifstream f(file+".in");
ofstream g(file+".out");
//#define f cin
//#define g cout
struct aib {
int n;
vi v;
aib(int _n) {
n=_n;
v.resize(n+1,0);
}
void update(int poz, int val) {
for (int i=poz; i<=n; i+=i&-i)
v[i]+=val;
}
int query(int poz) {
int s=0;
for (int i=poz; i>0; i-=i&-i)
s+=v[i];
return s;
}
int query(int st, int dr) {
return query(dr)-query(st-1);
}
};
int main(){
int n,m;
f>>n>>m;
aib a(n);
for (int i=1; i<=n; ++i) {
int x;
f>>x;
a.update(i,x);
}
while (m--) {
int t;
f>>t;
if (t==0) {
int x,y;
f>>x>>y;
a.update(x,y);
}
else if (t==1) {
int x,y;
f>>x>>y;
g<<a.query(x,y)<<"\n";
}
else {
int x;
f>>x;
int st=1,dr=n,poz=0;
while (st<=dr) {
int mid=(st+dr)>>1;
if (a.query(mid)==x) {
poz=mid;
break;
}
if (a.query(mid)>x) {
dr=mid-1;
}
else st=mid+1;
}
g<<(poz?poz:-1)<<nl;
}
}
system("pause");
return 0;
}