提出 f71b70d4-714e-4608-a5ac-d7d37b62569d

コード

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using ll=long long;
const int mod=998244353;
using mint=modint998244353;
using P=pair<int,int>;
const ll inf=1e18;
int main(){
    cin.tie(0)->sync_with_stdio(0);
	int n,m,a,b,q;
	cin>>n>>m;
	assert(2<=n&&n<=200000);
	ll nc2=(n-1ll)*n/2;
	assert(1<=m&&m<=200000&&m<=nc2);
	set<P>edge;
	for(int i=0;i<m;i++){
		cin>>a>>b;
		assert(1<=a&&a<b&&b<=n);
		a--,b--;
		assert(!edge.count({a,b}));
		edge.insert({a,b});
	}
	cin>>q;
	assert(1<=q&&q<=200000);
	vector<int>event(q),s(q),t(q),x(q),ans(q);
	vector<vector<int>>ans2(q);
	int c3=0,c5=0;
	for(int i=0;i<q;i++){
		cin>>event[i];
		if(event[i]==1){
			cin>>s[i]>>t[i];
			assert(1<=a&&s[i]<t[i]&&b<=n);
			s[i]--,t[i]--;
			//assert(edge.count({s[i],t[i]}));
			edge.erase({s[i],t[i]});
		}
		if(event[i]==2){
			cin>>s[i]>>t[i];
			assert(1<=a&&s[i]<t[i]&&b<=n);
			s[i]--,t[i]--;
		}
		if(event[i]==3){
			cin>>x[i];
			assert(1<=x[i]&&x[i]<=n);
			x[i]--;
			c3++;
		}
		if(event[i]==4){
			cin>>x[i];
			assert(1<=x[i]&&x[i]<=n);
			x[i]--;
		}
		if(event[i]==5){
			cin>>s[i]>>t[i];
			assert(1<=a&&s[i]<t[i]&&b<=n);
			s[i]--,t[i]--;
			assert(!edge.count({s[i],t[i]}));
			edge.insert({s[i],t[i]});
			c5++;
		}
	}
	assert(c3<=80&&c5<=3);
}
結果

問題	点数	言語	結果	実行時間	メモリ
G. Breaking Friends	0	C++ (gcc)	RE	199 ms	17512 KiB