QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#780072#9104. Zayin and ForestwallcrackTL 129ms17196kbC++201.0kb2024-11-25 00:33:132024-11-25 00:33:13

Judging History

你现在查看的是最新测评结果

  • [2024-11-25 00:33:13]
  • 评测
  • 测评结果:TL
  • 用时:129ms
  • 内存:17196kb
  • [2024-11-25 00:33:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
struct BIT 
{
	long long siz;
	map<long long,long long>c;
	BIT(long long n):siz(n){}
	long long lowbit(long long x)
	{
		return x&(-x);
	}
	void add(long long x,long long v)
	{
		for(long long i=x;i<=siz;i+=lowbit(i))
			c[i]+=v;
	}
	long long sum(long long l,long long r)
	{
		long long sum=0;
		for(long long i=r;i>=1;i-=lowbit(i))
			sum+=c[i];
		for(long long i=l-1;i>=1;i-=lowbit(i))
			sum-=c[i];
		return sum;
	}
};
long long F(long long x)
{
	int p=0;
	while(!((x>>p)&1 and !((x>>p+1)&1)))p++;
	long long res=(1ll<<p+1);
	for(int i=p+2;i<63;i++)
		if((x>>i)&1)res|=(1ll<<i);
	return res;
}
int main()
{
	ios::sync_with_stdio(false);
	long long n,m;
	cin>>n>>m;
	BIT seq(n);
	for(int i=1;i<=m;i++)
	{
		int op;
		cin>>op;
		if(op==1)
		{
			long long x,v;
			cin>>x>>v;
			while(x<=n)
			{
				seq.add(x,v);
				x=F(x);
			}
		}
		else
		{
			long long l,r;
			cin>>l>>r;
			cout<<seq.sum(l,r)<<"\n";
		}
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 129ms
memory: 17196kb

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
...

result:

ok 6649 lines

Test #2:

score: -100
Time Limit Exceeded

input:

1000000000000000000 100000
1 384578735 526547442
1 64211261 592970906
1 512065247 448267721
1 44993150 127180320
1 880319036 927623947
1 170536687 572121854
1 896600029 804033011
2 666246328 931651408754201635
1 654066651 179982083
1 984888006 240989825
1 372004567 858916479
1 76127818 98606736
1 18...

output:

144205553442
497561506762
903930740555
878459229726
689906696633
859703313829
735231510045
1177875391120
1461659121798
1612314483744
2027462020547
1991476058156
2381861014705
2033973986301
2117738140401
2946661001323
2187638958334
2593068002437
1854182975909
2262561461341
3038788266419
3070435321746...

result: