Submission #60136963

---

Source Code Expand

#include<bits/stdc++.h>
#include"atcoder/all"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> P;
const ll mod=998244353;
const ll inf=1ll<<61;
typedef modint998244353 mi;

int x[100160],y[100160];
int a[100160],b[100160];
vector<int>G[100160];
vector<P>Q[100160];
bitset<320>B[100160];
bool ans[100160];

int main(){
	int n,m,q;cin>>n>>m>>q;
	rep(i,m){
		cin>>x[i]>>y[i];
		x[i]--;y[i]--;
		G[x[i]].push_back(y[i]);
	}
	rep(i,q){
		cin>>a[i]>>b[i];
		a[i]--;b[i]--;
		Q[a[i]].push_back({b[i],i});
	}

	for(int i=0;i<n;i+=320){
		rep(j,n)B[j].reset();
		for(int j=0;j<320;j++)B[i+j].set(j);
		
		for(int j=i;j<n;j++){
			for(auto &e:G[j]){
				B[e]|=B[j];
			}
		}

		for(int j=i;j<i+320;j++){
			if(j>=n)break;
			for(auto &e:Q[j]){
				if(B[e.first][j-i])ans[e.second]=true;
				else ans[e.second]=false;
			}
		}

	}

	rep(i,q){
		if(ans[i])cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
}

Submission Info

Judge Result