ACM竞赛算法解析-优快云博客

本文链接：https://blog.youkuaiyun.com/m0_74945216/article/details/127944877

Shift

不讲

Misjudge the Time

不讲

FF

用map做

#include <bits/stdc++.h>
using namespace std;
int N,Q;
int main() {
	cin >> N >> Q;
    set<pair<int,int> > follows;
    for (int i=1;i<=Q;i++) {
        int type, A, B;
        cin>>type>>A>>B;
        if (type==1)
            follows.insert(make_pair(A, B) );
        else if (type==2)
            follows.erase({A, B});
        else
            cout << (follows.count({A, B}) && follows.count({B, A}) ? "Yes" : "No") << endl;
    }
    return 0;
}

D - All Assign Point Add

模拟

#include<bits/stdc++.h>
using namespace std;
int n,q,t,x,y,s;
map<int,long long> a;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	cin>>q;
	for(int i=1;i<=q;i++){
		cin>>t;
		if(t==3){
			cin>>x;
			if(a[x]==0)
				a[x]+=s;
			cout<<a[x]<<endl;
		}
		if(t==1){
			cin>>x;
			a.clear();
			s=x;
		}
		if(t==2){
			cin>>x>>y;
			if(a[x]==0)
				a[x]+=s;
			a[x]+=y;
		}
	}
	return 0;
}

E - Grid Filling

暴力

#include<bits/stdc++.h>
using namespace std;
int H,W,n,h,w,a[310][310],sum[310],summ[310],ans;
int main(){
	cin>>H>>W>>n>>h>>w;
	for(int i=1;i<=H;i++)
		for(int j=1;j<=W;j++){
			cin>>a[i][j];
			sum[a[i][j]]++;
			summ[a[i][j]]++;
		}
	for(int i=1;i<=H-h+1;i++){
		for(int j=1;j<=n;j++)
			sum[j]=summ[j];
		for(int k=i;k<=i+h-1;k++)
			for(int j=1;j<=w;j++)
				sum[a[k][j]]--;
		ans=0;
		for(int l=1;l<=n;l++)
			if(sum[l]>0)
				ans++;
		cout<<ans;
		for(int j=2;j<=W-w+1;j++){
			for(int k=i;k<=i+h-1;k++){
				sum[a[k][j-1]]++,sum[a[k][j+w-1]]--;
			}
				
			ans=0;
			for(int l=1;l<=n;l++)
				if(sum[l]>0)
					ans++;	
			cout<<" "<<ans;
		}
		cout<<endl;
	}
	return 0;
}