Codeforces 400C Inna and Huge Candy Matrix

最新推荐文章于 2019-03-07 10:17:16 发布

原创最新推荐文章于 2019-03-07 10:17:16 发布 · 707 阅读

0 ·

CC 4.0 BY-SA版权

数据结构与算法专栏收录该内容

338 篇文章

订阅专栏

本文介绍了一个在 Codeforces 平台上的中等难度编程挑战题目的解决策略。通过细致分析题目要求，本文揭示了如何利用规律寻找最优解。包括翻转操作的细节和行列交换的技巧，帮助读者理解和解决此类问题。

题目链接：Codeforces 400C Inna and Huge Candy Matrix

不是难题，需要耐心找规律。

记得某些翻转后需要交换行列值。

#include <iostream>

using namespace std;

const int MAX_N = 100000 + 1000;
struct Point
{
    int x,y;
};
int n,m,x,y,z,p;

Point point[MAX_N];

void clockwise(int k)
{
    k = k % 4;
    if(k == 1)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = temp_y;
            point[i].y = n + 1 - temp_x;
        }
        int temp = n;
        n = m;
        m = temp;
    }
    else if(k == 2)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = n + 1 - temp_x;
            point[i].y = m + 1 - temp_y;
        }
    }
    else if(k == 3)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = m + 1 - temp_y;
            point[i].y = temp_x;
        }
        int temp = n;
        n = m;
        m = temp;
    }
}
void horizontal_rotate(int k)
{
    k = k % 2;
    if(k == 0)
        return;
    for(int i = 0;i < p;i++)
        point[i].y = m + 1 - point[i].y;
}
void counterclockwise (int k)
{
    k = k % 4;
    if(k == 1)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = m + 1 - temp_y;
            point[i].y = temp_x;
        }
        int temp = n;
        n = m;
        m = temp;
    }
    else if(k == 2)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = n + 1 - temp_x;
            point[i].y = m + 1 - temp_y;
        }
    }
    else if(k == 3)
    {
        for(int i = 0;i < p;i++)
        {
            int temp_x = point[i].x;
            int temp_y = point[i].y;
            point[i].x = temp_y;
            point[i].y = n + 1 - temp_x;
        }
        int temp = n;
        n = m;
        m = temp;
    }
}
int main()
{
    while(cin >> n >> m >> x >> y >> z >> p)
    {
        for(int i = 0;i < p;i++)
            cin >> point[i].x >> point[i].y;
        clockwise(x);
        horizontal_rotate(y);
        counterclockwise(z);
        for(int i = 0;i < p;i++)
            cout << point[i].x << " " << point[i].y << endl;
    }
    return 0;
}