QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#504860 | #9104. Zayin and Forest | Xunwuqishi# | TL | 0ms | 0kb | C++20 | 1.2kb | 2024-08-04 16:48:49 | 2024-08-04 16:48:50 |
answer
#include<bits/stdc++.h>
#define Alex std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define double long double
#define int long long
const int QAQ = 0;
const double eps = 1e-10;
const int mod = 1e9 + 7;
const int N = 1e7 + 10;
long long n;
long long m;
__gnu_pbds::gp_hash_table<long long,long long> T;
inline long long lowbit(long long x)
{
return x & (-x);
}
inline void Update(long long x,long long y)
{
for(;x <= n;x = x + lowbit(x))
T[x] += y;
}
inline long long Query(long long x)
{
long long res = 0;
for(;x;x -= lowbit(x)) res += T[x];
return res;
}
signed main()
{
Alex;
int _;
_ = 1;
while(_--)
{
std::cin>>n>>m;
T.clear();
for(int i = 1;i <= m;i++)
{
int op;
std::cin>>op;
if(op == 1)
{
long long x,v;
std::cin>>x>>v;
for(x;x <= n;x = x + lowbit(x))
{
Update(x,v);
}
}else
{
long long l,r;
long long ans = 0;
std::cin>>l>>r;
ans = Query(r) - Query(l - 1);
std::cout<<ans<<'\n';
}
}
}
return QAQ;
}
詳細信息
Test #1:
score: 0
Time Limit Exceeded
input:
1000000000 20000 2 384578735 526547442 1 64211261 592970906 1 512065247 448267721 1 44993150 127180320 1 880319036 927623947 1 170536687 572121854 1 896600029 804033011 1 666246328 754201635 1 654066651 179982083 2 240989825 984888006 2 372004567 858916479 2 76127818 98606736 1 181794163 902842353 1...
output:
0 43148875202 17613404710 0 32808578044 28190043566 15641637055 78276219892 14955165236 20262224725 105057452192 17002492367 57916137452 27165464255 72766353838 39458327919 38294102627 264448717384 0 70928519548 279674530483 88885017175 111664599432 69703816663 211506104092 104120007714 34403738515 ...