Submission #2106606


Source Code Expand

#include<stdio.h>
#include<math.h>
#include<algorithm>
#include<queue>
#include<deque>
#include<stack>
#include<string>
#include<string.h>
#include<vector>
#include<set>
#include<map>
#include<bitset>
#include<stdlib.h>
#include<cassert>
#include<time.h>
#include<bitset>
using namespace std;
const long long mod=1000000007;
const long long inf=mod*mod;
const long long d2=(mod+1)/2;
const double EPS=1e-6;
const double PI=acos(-1.0);
int ABS(int a){return max(a,-a);}
long long ABS(long long a){return max(a,-a);}
pair<int,int> v[210000];
int p[210000];
int q[210000];
int x[210000];
int sz;
int solve(int a,int b){
	if(a>=b)return 1;
//	printf("%d %d\n",a,b);
	int t=x[a];
	int A=a;
	int B=b;
	if(A>B)B+=sz;
	if(!(A<=t&&t<B)&&!(A<=t+sz&&t+sz<B))return 0;
	if(solve(a+1,t)&&solve(t+1,b))return 1;
	return 0;
}
int main(){
	int a,b,c;scanf("%d%d%d",&a,&b,&c);
	for(int i=0;i<c;i++){
		int X1,Y1,X2,Y2;
		scanf("%d%d%d%d",&X1,&Y1,&X2,&Y2);
		bool ok=true;
		if(X1!=0&&X1!=a&&Y1!=0&&Y1!=b)ok=false;
		if(X2!=0&&X2!=a&&Y2!=0&&Y2!=b)ok=false;
		if(ok){
			int t1=0;
			if(X1==0)t1=Y1;
			else if(Y1==b)t1=b+X1;
			else if(X1==a)t1=a+b+(b-Y1);
			else t1=a+b+b+a-X1;
			int t2=0;
			if(X2==0)t2=Y2;
			else if(Y2==b)t2=b+X2;
			else if(X2==a)t2=a+b+(b-Y2);
			else t2=a+b+b+a-X2;
			v[sz++]=make_pair(t1,i);
			v[sz++]=make_pair(t2,i);
		//	printf("%d %d %d\n",i,t1,t2);
		}
	}
	for(int i=0;i<210000;i++)p[i]=q[i]=-1;
	std::sort(v,v+sz);
	for(int i=0;i<sz;i++){
		if(p[v[i].second]==-1){
			p[v[i].second]=i;
		}else q[v[i].second]=i;
	}
	for(int i=0;i<sz;i++){
		int f=v[i].second;
		if(p[f]==i)x[i]=q[f];
		else x[i]=p[f];
//		printf("%d\n",x[i]);
	}
	int ret=solve(0,sz);
	if(ret)printf("YES\n");
	else printf("NO\n");
}

Submission Info

Submission Time
Task E - Connected?
User tozangezan
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1798 Byte
Status AC
Exec Time 55 ms
Memory 6144 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a,b,c;scanf("%d%d%d",&a,&b,&c);
                                    ^
./Main.cpp:45:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d%d",&X1,&Y1,&X2,&Y2);
                                    ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 4
AC × 38
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 43.txt, 44.txt, 45.txt, 46.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt AC 47 ms 5248 KB
02.txt AC 46 ms 4864 KB
03.txt AC 47 ms 4992 KB
04.txt AC 40 ms 3968 KB
05.txt AC 47 ms 4864 KB
06.txt AC 54 ms 6016 KB
07.txt AC 39 ms 3712 KB
08.txt AC 47 ms 4096 KB
09.txt AC 43 ms 4096 KB
10.txt AC 52 ms 5760 KB
11.txt AC 49 ms 5248 KB
12.txt AC 37 ms 3456 KB
13.txt AC 39 ms 3712 KB
14.txt AC 42 ms 4224 KB
15.txt AC 44 ms 3712 KB
16.txt AC 39 ms 3584 KB
17.txt AC 38 ms 3456 KB
18.txt AC 37 ms 3456 KB
19.txt AC 41 ms 3840 KB
20.txt AC 52 ms 4352 KB
21.txt AC 43 ms 3840 KB
22.txt AC 44 ms 4096 KB
23.txt AC 52 ms 4352 KB
24.txt AC 53 ms 5120 KB
25.txt AC 55 ms 6144 KB
26.txt AC 54 ms 6016 KB
27.txt AC 54 ms 5376 KB
28.txt AC 53 ms 5888 KB
29.txt AC 54 ms 5248 KB
30.txt AC 53 ms 4736 KB
43.txt AC 2 ms 3456 KB
44.txt AC 2 ms 3456 KB
45.txt AC 2 ms 3456 KB
46.txt AC 1 ms 3456 KB
s1.txt AC 1 ms 3456 KB
s2.txt AC 1 ms 3456 KB
s3.txt AC 2 ms 3456 KB
s4.txt AC 2 ms 3456 KB