【萌新题解】有向无权图存储1

萌新题解内容要完结咯

#include<iostream>
using namespace std;
int d[101][101];
int x,y;
int main(){
	int n,q,m;
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++){
		cin>>x>>y;
		d[x][y] = 1;
	}
	while(q--){
		cin>>x>>y;
		if(d[x][y]==1) cout<<"Cancel"<<endl;
		else cout<<"Accepted"<<endl;
	}
	return 0;
}