QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#184413#5278. Mex and CardsZhou_JKRE 3ms13004kbC++142.2kb2023-09-20 18:44:242023-09-20 18:44:25

Judging History

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

  • [2023-09-20 18:44:25]
  • 评测
  • 测评结果:RE
  • 用时:3ms
  • 内存:13004kb
  • [2023-09-20 18:44:24]
  • 提交

answer

#include<iostream>
#include<cstdio>
#include<set>
using namespace std;
const int N=200005;
int n,m,q;
int c[N];
set<int>s;
set<int>pos[N];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>c[i];
	int premn=c[0],prei=0;
	s.insert(0);
	pos[c[0]].insert(0);
	long long ans=0;
	for(int i=1;i<n;i++)
	{
		if(c[i]<premn)
		{
			s.insert(i);
			ans+=(long long)(i-prei)*c[prei];
			prei=i;
		}
		premn=min(premn,c[i]);
		pos[c[i]].insert(i);
	}
	ans+=(long long)(n-prei)*c[prei];
	cout<<ans<<"\n";

	cin>>q;
	while(q--)
	{
		int p,v;
		cin>>p>>v;
		if(p==1)
		{
			bool del=false;
			auto it=s.find(v);
			if(it!=s.end())
			{
				if(it!=s.begin())
				{
					auto pre=prev(it);
					if(c[*pre]<=c[v]+1) del=true;
				}
				auto nxt=next(it);
				auto np=pos[c[v]].upper_bound(v);
				// cerr<<"nxt"<<*nxt<<"\n";
				// if(np!=pos[c[v]].end()) cerr<<"find"<<*np<<"\n";
				if(np!=pos[c[v]].end()&&(nxt==s.end()||*np<*nxt))
				{
					ans+=(*np-v);
					s.insert(*np);
					// cerr<<"insert"<<*np<<"\n";
					it=s.find(v);
				}
				else
				{
					if(nxt!=s.end()) ans+=(*nxt-v);
					else ans+=n-v;
				}
				if(del) s.erase(v);
			}
			pos[c[v]].erase(v);
			c[v]++;
			pos[c[v]].insert(v);
		}
		else if(p==2)
		{
			// exit(1);
			auto it=s.find(v);
			if(it!=s.end())
			{
				if(it!=s.begin())
				{
					auto pre=prev(it);
					auto np=pos[c[v]].upper_bound(*pre);
					if(np!=pos[c[v]].end()&&c[*pre]>c[v]&&(*np<v))
					{
						s.insert(*np);
						it=s.find(v);
					}
				}
				auto nxt=next(it);
				if(nxt!=s.end())
				{
					ans-=(*nxt-v);
					if(c[*nxt]>=c[v]-1) s.erase(nxt);
				}
				else ans-=(n-v);
			}
			else
			{
				if(s.empty()) exit(0);
				auto it=s.upper_bound(v);
				if(c[v]-1<c[*prev(it)])
				{
					if(it!=s.end())
					{
						ans-=*it-v;
						if(c[v]<=c[*it]) s.erase(it);
					}
					else ans-=n-v;
					s.insert(v);
				}
			}
			pos[c[v]].erase(v);
			c[v]--;
			pos[c[v]].insert(v);
		}
		// cerr<<"S:\n";
		// for(auto it:s)
			// cerr<<it<<" ";cerr<<"\n";
		cout<<ans<<"\n";
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 12880kb

input:

5
2 1 3 0 2
6
1 0
1 1
2 4
1 3
2 1
2 1

output:

4
5
7
7
9
7
3

result:

ok 7 numbers

Test #2:

score: 0
Accepted
time: 0ms
memory: 13004kb

input:

1
0
0

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 3ms
memory: 12908kb

input:

10
3 8 1 4 10 3 10 9 7 10
20
2 5
1 4
1 2
1 4
1 3
1 3
1 0
2 8
1 5
1 4
1 0
1 3
1 8
1 6
1 4
1 1
1 5
1 9
1 6
2 7

output:

14
14
14
22
22
22
22
24
24
24
24
26
26
26
26
26
26
26
26
26
26

result:

ok 21 numbers

Test #4:

score: 0
Accepted
time: 0ms
memory: 12912kb

input:

10
9 8 7 5 5 4 3 2 1 1
20
2 4
1 8
2 6
1 2
1 2
2 5
2 2
1 0
1 6
1 6
2 9
1 2
2 7
2 8
2 3
1 9
1 7
1 4
2 6
1 7

output:

45
44
45
44
45
45
44
44
45
46
46
45
45
43
43
42
43
44
44
44
45

result:

ok 21 numbers

Test #5:

score: 0
Accepted
time: 3ms
memory: 12944kb

input:

100
969 519 608 546 957 82 670 100 92 581 974 529 970 54 639 216 238 620 966 162 430 10 446 884 895 292 450 180 619 389 943 855 204 605 514 997 325 98 643 915 744 249 333 431 160 434 714 976 168 573 682 69 873 285 668 561 159 858 864 683 266 564 350 214 461 421 213 568 279 624 749 433 735 437 978 95...

output:

4923
4923
4923
4923
4923
4923
4923
4923
4923
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4927
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
4931
...

result:

ok 1001 numbers

Test #6:

score: 0
Accepted
time: 3ms
memory: 12784kb

input:

100
994 983 981 980 962 959 959 950 933 887 877 869 841 828 809 807 803 793 789 778 773 772 768 767 765 765 759 757 749 747 742 738 730 724 681 675 656 638 627 626 615 612 593 592 545 543 540 534 531 529 525 520 518 515 512 510 500 494 472 472 432 415 414 411 399 375 350 328 315 307 292 261 258 246 ...

output:

51041
51042
51041
51042
51043
51042
51043
51042
51040
51038
51037
51038
51039
51038
51039
51040
51039
51040
51039
51038
51037
51036
51037
51038
51037
51038
51037
51036
51035
51036
51037
51035
51034
51035
51034
51035
51036
51037
51036
51037
51039
51038
51037
51036
51035
51034
51033
51032
51031
51032
...

result:

ok 1001 numbers

Test #7:

score: -100
Runtime Error

input:

1000
549187 776775 748956 28001 575132 18015 112492 144497 206885 842190 403842 456113 424268 871411 648618 186832 693358 781526 443190 175126 586343 918652 923262 973941 509929 433837 392849 452585 497398 331180 118333 152788 959909 539943 747365 261855 819641 618091 801231 355664 285761 895793 398...

output:


result: