Submission #143205

#	Time	Username	Problem	Language	Result	Execution time	Memory
143205		cheetose	물병 (JOI14_bottle)	C++11	0 / 100	517 ms	66252 KiB

bottle

#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];
set<int> S[200000];
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;
	}
}
Viii e;

int L[200000], R[200000], res[200000];
Pi query[200000];
Vi v[200000];
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)swap(p1,p2);
					if(p1.X!=p2.X)
					{
						if(S[p1.X].find(p2.X)==S[p1.X].end())
						{
							S[p1.X].insert(p2.X);
							edge.pb(iii(p1.Y+p2.Y,p1.X,p2.X));
						}
					}
				}
			}
		}
	}
	sort(ALL(edge));
	for(auto &I:edge)
	{
		int z,x,y;
		tie(z,x,y)=I;
		if(find(x)==find(y))continue;
		merge(x,y);
		e.pb(I);
	}
	int nn=e.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 (stderr)

bottle.cpp: In function 'int main()':
bottle.cpp:91: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:92: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:97: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:147: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);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 30
• Subtask 3: 0 / 30
• Subtask 4: 0 / 30