QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#504841#9104. Zayin and ForestXunwuqishi#TL 111ms17276kbC++201.0kb2024-08-04 16:40:012024-08-04 16:40:01

Judging History

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

  • [2024-08-04 16:40:01]
  • 评测
  • 测评结果:TL
  • 用时:111ms
  • 内存:17276kb
  • [2024-08-04 16:40:01]
  • 提交

answer

#include<bits/stdc++.h>
#define Alex std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);
#define int long long
#define double long double
const int QAQ = 0;
const double eps = 1e-10;
const int mod = 1e9 + 7;
const int N = 1e7 + 10;
int n,m;
std::map<int,int> T;
inline int lowbit(int x)
{
	return x & (-x);
}
inline void Update(int x,int y)
{
	for(;x <= n;x = x + lowbit(x)) 
	    T[x] += y;
}
inline int Query(int x)
{
	int res = 0;
	for(;x;x -= lowbit(x)) res += T[x];
	return res;
}
signed main()
{
	Alex;
	int _;
	_ = 1;
	while(_--)
	{
		std::cin>>n>>m;
		T.clear();
		int s = 0;
		int rt = 0;
		for(int i = 1;i <= m;i++)
		{
			int op;
			std::cin>>op;
			if(op == 1)
			{
				int x,v;
				std::cin>>x>>v;
                for(x;x <= n;x = x + lowbit(x))   
                {
                	Update(x,v);
				}
			}else
			{
				int l,r;
				int ans = 0;
				std::cin>>l>>r;
				ans = Query(r) - Query(l - 1);
                std::cout<<ans<<'\n';
			}
		}
	}
	return QAQ;
}

详细

Test #1:

score: 100
Accepted
time: 111ms
memory: 17276kb

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: