AlgorithmOJ
Problem
Local Problems
All Problems
Problem Category
Status
Contest
Standard Contests
Replay Contests
Virtual Contests
Ranklist
More...
News
About
F.A.Q
Recent Contests
Coming Soon...
Login
Register
2026-04-27 01:34:41
镜面对称
Time Limit:
1000ms
Memory Limit:
32768KB
64-bit integer IO format:
%lld
Java class name:
Main
Prev
Submit
Status
Statistics
Next
Font Size:
Description
给你一个简单多边形,请你判断这个简单多边形是不是镜面对称的。
例如下图两个简单多边形都是镜面对称的。
Input
输入包含多组测试数据。
每组输入的第一行是一个整数N(3<=N<=500),表示简单多边形有N个顶点。
接下来N行,每行输入两个整数x和y,表示简单多边形的某个顶点坐标。
顶点坐标保证按照顺时针顺序输入。
Output
对于每组输入,如果此简单多边形是镜面对称的则输出“YES”,否则输出“NO”。
Sample Input
3 -1 0 0 1 1 0
Sample Output
YES
Author
Admin
Language:
C++ (GCC 5.4.0)
C++11 (GCC 5.4.0)
C++14 (GCC 6.3.0)
C (GCC 5.4.0)
Java (OpenJDK 1.8.0)
Pascal (FPC 3.0.0)
Python2 (2.7.12)
Python3 (3.5.2)
Python3 (3.8.2)
C# (Mono 4.2.1)
Fortran
Perl
Ruby
Ada
SML
Visual C++
Visual C
CLang
CLang++
Theme:
Monokai
Solarized Light
Material
Share Code?
Yes
No
×
Login
Username:
Password:
Cookie:
Never
One Day
One Week
One Month
One Year
×
Register
Username:
Password:
Repeat Password:
Nickname:
School:
Email:
×
News Title
by