Submission #34938

#TimeUsernameProblemLanguageResultExecution timeMemory
34938wan2000스파이 (JOI13_spy)C++14
10 / 100
49 ms75736 KiB
#include <bits/stdc++.h> using namespace std; template<typename T> inline void read(T &x){ x = 0; char ch; while(!isdigit(ch=getchar())); do{x=10*x+ch-'0';}while(isdigit(ch=getchar())); } const int N = 2001; const int M = 1e5+1; int n, m, mx; bitset<M> D[2][N], F[N]; vector<int> Adj[2][N]; void DFS(int u, int tp){ F[u] &= D[tp][u]; for(int i = 0; i < (int)Adj[tp][u].size(); i++){ int v = Adj[tp][u][i]; D[tp][v] |= D[tp][u]; DFS(v,tp); } } int main() { ios_base::sync_with_stdio(0); cin.tie(0); read(n); read(m); for(int i = 1; i <= n; i++){ int x, y; read(x); read(y); Adj[0][x].push_back(i); Adj[1][y].push_back(i); } for(int i = 1; i <= m; i++){ int x, y; read(x); read(y); D[0][x].set(i); D[1][y].set(i); } mx = m/64+1; for(int i = 1; i <= n; i++){ F[i].flip(); } DFS(0,0); DFS(0,1); for(int i = 1; i <= n; i++){ cout<<F[i].count()<<'\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...