1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
|
#include <vector>
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define PB push_back
#define PF push_front
#define EB emplace_back
#define EF emplace_front
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define lson(o) (o<<1)
#define rson(o) (o<<1|1)
#define SZ(a) ((long long) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define fsp(x) fixed<<setprecision(x)
#define minn(vec) *min_element(vec.begin(),vec.end())
#define maxx(vec) *max_element(vec.begin(),vec.end())
#define yyy cout<<"YES\n"
#define nnn cout<<"NO\n"
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;using vii=vector<int>;
using vpll = vector<pll>;using vtll = vector<tll>;
using vdb = vector<DB>;using vc=vector<char>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
using CD=complex<double>;
static constexpr ll MAXN=(ll)5e3+10,INF=(ll)1e17+3;
static constexpr ll mod=(ll)1e9+7;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
ll N,M,Q,X,K,T,lT;
struct Solve{
vector<bitset<MAXN>> A;
vector<bitset<MAXN>> IN;
vector<vll> Dis;
bitset<MAXN> ised;
Solve(){
cin>>N>>Q;
A.resize(N+5);
IN.resize(N+5);
Dis.resize(N+5, vll(N+5, -1));
FOR(i,1,N){
FOR(j,1,N-i){
char a; cin>>a;
int u=i, v=i+j;
if(a=='0'){
A[v].set(u);
IN[u].set(v);
}else{
A[u].set(v);
IN[v].set(u);
}
}
}
FOR(_,1,Q){
reply();
}
}
void bfs(ll u){
bitset<MAXN> vis, q;
vis.reset(); q.reset();
q[u]=1; vis[u]=1;
FOR(__,1,N){
if(q.none()) break;
bitset<MAXN> sum; sum.reset();
for(int i = q._Find_first(); i <= N; i = q._Find_next(i)){
sum |= A[i];
}
bitset<MAXN> qq = (~vis) & sum;
for(int i = qq._Find_first(); i <= N; i = qq._Find_next(i)){
Dis[u][i] = __ - 1;
}
vis |= qq;
q = qq;
}
}
void reply(){
ll u,v;
cin>>u>>v;
if(A[u][v]){
cout<<0<<"\n";
return;
}
if ( (A[u] & IN[v]).any() ){
cout<<1<<"\n";
return;
}
if(ised[u]){
cout<<Dis[u][v]<<"\n";
return;
}
ised[u]=true;
bfs(u);
cout<<Dis[u][v]<<"\n";
}
};
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
Solve a;
return 0;
}
|