CF24C.Sequence of points

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given the following points with integer coordinates on the plane: M0,A0,A1,...,An1M_{0},A_{0},A_{1},...,A_{n-1} , where nn is odd number. Now we define the following infinite sequence of points MiM_{i} : MiM_{i} is symmetric to Mi1M_{i-1} according (for every natural number ii ). Here point BB is symmetric to AA according MM , if MM is the center of the line segment ABAB . Given index jj find the point MjM_{j} .

输入格式

On the first line you will be given an integer nn ( 1<=n<=1051<=n<=10^{5} ), which will be odd, and jj ( 1<=j<=10181<=j<=10^{18} ), where jj is the index of the desired point. The next line contains two space separated integers, the coordinates of M0M_{0} . After that nn lines follow, where the ii -th line contain the space separated integer coordinates of the point Ai1A_{i-1} . The absolute values of all input coordinates will not be greater then 10001000 .

输出格式

On a single line output the coordinates of MjM_{j} , space separated.

输入输出样例

  • 输入#1

    3 4
    0 0
    1 1
    2 3
    -5 3
    

    输出#1

    14 0
    
  • 输入#2

    3 1
    5 5
    1000 1000
    -1000 1000
    3 100
    

    输出#2

    1995 1995
    
首页