Submission #378291

---

Source Code Expand

#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>

using namespace std;

#define reE(i,a,b) for(auto (i)=(a);(i)<=(b);(i)++)
#define rE(i,b) reE(i,0,b)
#define reT(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rT(i,b) reT(i,0,b)
#define rep(i,a,b) reE(i,a,b);
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)
#define fe(i,b) for (auto &(x):b);
#define itr(i,b) for(auto (i)=(b).begin();(i)!=(b).end();++(i))
#define rti(i,b) for(auto (i)=(b).rbegin();(i)!=(b).rend();++(i))
#define LL long long
#define all(b) (b).begin(),(b).end()

#define input_init stringstream ss; string strtoken, token; istringstream is
#define input_line  getline(cin, strtoken);is.str(strtoken);is.clear(istringstream::goodbit)
#define input_token(num) ss.str(""); ss.clear(stringstream::goodbit); getline(is, token, ','); ss << token; ss >> num

#define dir(xx,yy,x,y,i) (xx)=(x)+dir[(i)],(yy)=(y)+dir[(i)+1]

typedef complex<double> P;
typedef vector<P> Poly;

const LL INF = 1 << 30;
const double eps = 1e-8;
const int dir[] = { 0, 1, 0, -1, 0 };

bool state[1010][1010] = {false};
bool mstate[1010][3] = { false };
int m,n;
P points[1010];
P press[1010];
P ms[3];

bool game(){
	switch (m){
	case 1:{
		if (abs(ms[0] - points[0]) - press[0].real() > eps)return false;
		if (n>1)return false;
		return true;
	}
	case 2:{
		bool f = false;
		if (abs(ms[0] - points[0]) - press[0].real() <eps){
			if (n<2||abs(ms[1] - points[1]) - press[1].real() < eps)
				f = true;
		}
		else 
			if (abs(ms[1] - points[0]) - press[0].real() <eps)
				if (n<2||abs(ms[0] - points[1]) - press[1].real() < eps)
					f = true;
		reT(i, 2, n)
			if (abs(points[i] - points[i - 2]) - (press[i].real() - press[i - 1].real()) > eps)f = false;
		
		return f;
	}
	case 3:{
		rT(i, 3){
			if (abs(ms[i] - points[0]) - press[0].real() < eps)
				mstate[0][i] = true;
		}
		rT(i, 3)if (n > 1 && mstate[0][i])
			rT(j, 2)if (abs(ms[(i + 1 + j) % 3] - points[1]) - press[1].real() < eps)mstate[1][(i + 1 + (j ^ 1)) % 3] = true;
		reT(i,1, n-1){
			if (abs(points[i + 1] - points[i - 1]) - (press[i + 1].real() - press[i].real()) < eps){
				rT(j, 3)mstate[i + 1][j] = mstate[i][j];
				rT(j, i)state[i + 1][j] = state[i][j];
			}
			rT(j, 3)if (mstate[i][j] && abs(points[i + 1] - ms[j]) - press[i + 1].real() < eps)state[i + 1][i - 1] = true;
			rT(j, i)if (state[i][j] && abs(points[i + 1] - points[j]) - (press[i + 1].real()-press[j].imag()) < eps)state[i + 1][i - 1] = true;

		}
		rT(i, 3)if (mstate[n - 1][i])return true;
		rT(i, n)if (state[n - 1][i])return true;
		return false;
	}
	}
	return true;
}

int main(void){
	double x, y,s,e;

	cin >> m;
	rT(i, m){ cin >> x >> y; ms[i].real(x); ms[i].imag(y); }
	cin >> n;
	rT(i, n){ 
		cin >> x >> y >> s >> e;
		points[i].real(x);
		points[i].imag(y);
		press[i].real(s);
		press[i].imag(e);
		if (i > 0 && points[i] == points[i - 1]){
			press[i - 1].imag(press[i].imag()); i--; n--;
		}
	}
	if (game())cout << "YES" << endl;
	else cout << "NO" << endl;
	

	return(0);
}

Submission Info

Judge Result