#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
Pi p[2000][2000];
char s[2000][2001];
Viii edge;
int parent[200000];
int find(int a)
{
if (parent[a] < 0)return a;
return parent[a] = find(parent[a]);
}
void merge(int a, int b)
{
a = find(a), b = find(b);
if (a != b)
{
parent[a] += parent[b];
parent[b] = a;
}
}
int L[200000], R[200000], res[200000];
Pi query[200000];
Vi v[20000];
int main() {
MEM_1(parent);
fill(&p[0][0],&p[1999][2000],mp(-1,-1));
int n,m,N,q;
scanf("%d%d%d%d",&n,&m,&N,&q);
fup(i,0,n-1,1)scanf("%s",s[i]);
queue<Pi> Q;
fup(i,0,N-1,1)
{
int x,y;
scanf("%d%d",&x,&y);
x--,y--;
p[x][y]=mp(i,0);
Q.push(mp(x,y));
}
while(!Q.empty())
{
int x,y;
tie(x,y)=Q.front();
Q.pop();
int i,d;
tie(i,d)=p[x][y];
fup(ii,0,3,1)
{
int nx=x+dx[ii],ny=y+dy[ii];
if(nx>=0 && nx<n && ny>=0 && ny<m && s[nx][ny]=='.')
{
if(p[nx][ny].X==-1)
{
p[nx][ny]=mp(i,d+1);
Q.push(mp(nx,ny));
}
else
{
Pi p1=p[x][y],p2=p[nx][ny];
if(p1.X<p2.X)edge.pb(iii(p1.Y+p2.Y,p1.X,p2.X));
}
}
}
}
sort(ALL(edge));
int nn=edge.size();
fup(i,0,q-1,1)
{
scanf("%d%d",&query[i].X,&query[i].Y);
query[i].X--,query[i].Y--;
L[i]=0,R[i]=nn-1;
}
bool ok = 1;
while (ok)
{
ok = 0;
MEM_1(parent);
fup(i, 0, nn - 1, 1)v[i].clear();
fup(i, 0, q - 1, 1)
{
if (L[i] <= R[i])v[(L[i] + R[i]) / 2].push_back(i);
}
fup(i, 0, nn - 1, 1)
{
merge(get<1>(edge[i]), get<2>(edge[i]));
while (!v[i].empty())
{
ok = 1;
int t = v[i].back();
v[i].pop_back();
if (find(query[t].X) == find(query[t].Y))
{
R[t] = i - 1;
res[t] = get<0>(edge[i]);
}
else
L[t] = i + 1;
}
}
}
fup(i, 0, q - 1, 1)
{
if (L[i] >= nn)puts("-1");
else printf("%d\n", res[i]);
}
}
Compilation message
bottle.cpp: In function 'int main()':
bottle.cpp:89:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d",&n,&m,&N,&q);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bottle.cpp:90:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
fup(i,0,n-1,1)scanf("%s",s[i]);
~~~~~^~~~~~~~~~~
bottle.cpp:95:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
~~~~~^~~~~~~~~~~~~~
bottle.cpp:129:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&query[i].X,&query[i].Y);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
33 ms |
33272 KB |
Output is correct |
| 2 |
Correct |
34 ms |
33448 KB |
Output is correct |
| 3 |
Correct |
34 ms |
33528 KB |
Output is correct |
| 4 |
Correct |
178 ms |
47652 KB |
Output is correct |
| 5 |
Correct |
179 ms |
47760 KB |
Output is correct |
| 6 |
Correct |
170 ms |
47272 KB |
Output is correct |
| 7 |
Correct |
182 ms |
47188 KB |
Output is correct |
| 8 |
Correct |
191 ms |
50028 KB |
Output is correct |
| 9 |
Correct |
171 ms |
46488 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
49 ms |
37112 KB |
Output is correct |
| 2 |
Correct |
70 ms |
34476 KB |
Output is correct |
| 3 |
Correct |
258 ms |
37588 KB |
Output is correct |
| 4 |
Correct |
502 ms |
41388 KB |
Output is correct |
| 5 |
Runtime error |
462 ms |
93132 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
51 ms |
37188 KB |
Output is correct |
| 2 |
Correct |
57 ms |
34336 KB |
Output is correct |
| 3 |
Correct |
219 ms |
41664 KB |
Output is correct |
| 4 |
Runtime error |
422 ms |
86960 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
370 ms |
84836 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
