Codeforces Round #234 (Div. 2) 解题报告

Problem A Inna and Choose Options

题意：水题

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-03-05 23:13
 * Filename     : Codeforce_234_2_A.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
int mp[20][20];
vector<pii> p;
string str;

void debug(int a, int b){
    for(int i=0; i<a; i++){
        for(int j=0; j<b; j++){
            cout << mp[i][j] << ' ';
        }cout << endl;
    }cout << endl;
}

bool calc(int a, int b){
    for(int i=0; i<a; i++){
        for(int j=0; j<b; j++){
            if(str[i*b+j] == 'X') mp[i][j] = 1;
            else mp[i][j] = 0;
        }
    }
    for(int i=0; i<b; i++){
        int f = 1;
        for(int j=0; j<a; j++){
            if(mp[j][i] == 0){
                f = 0;
               break;    
            }    
        }
        if(f) return true;
    }
    return false;
}

int main()
{
//    freopen("in.txt", "r", stdin);

    int t;
    cin >> t;
    while(t--){
        cin >> str;
        int ans = 0;
        p.clear();
        for(int i=1; i<=12; i++){
            for(int j=1; j<=12; j++){
                if(i*j==12){
                    if(calc(i, j)) {
                        p.PB(MP(i, j));
                        ans++;     
                    }
                }
            }
        }
        cout << ans;
        for(int i=0; i<ans; i++){
            cout << ' ' << p[i].first << 'x' << p[i].second;
        }
        cout << endl;
    }
    return 0;
}

Problem B Inna and New Matrix of Candies
思路：每次找一个最小的然后全部向右移动，计算次数。

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-03-05 23:15
 * Filename     : Codeforce_234_2_B.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
const int LEN = 1010;
int Map[LEN][LEN], n, m;
vector<int> p;

int main()
{
//    freopen("in.txt", "r", stdin);

    string str;
    int ans = 1, pos;
    while(cin >> n >> m){
        ans = 1;
        p.clear();
        for(int i=0; i<n; i++){
            cin >> str;
            pos = -1;
            for(int j=0; j<m; j++){
                if(str[j] == 'G') pos = j;
                if(pos == -1 && str[j] == 'S') ans = 0;
                if(str[j] == 'S') p.PB(j-pos);
            }
        }
        sort(p.begin(), p.end());
    //    for(int i=0; i<p.size(); i++)cout << p[i] << ' ';cout << endl;
        int cnt = 0;
        for(int i=0; i<p.size(); i++){
            if(p[i] == 0) continue;
            cnt ++;
            for(int j=p.size()-1; j>i; j--){
                p[j] -= p[i];
            }
        }
        if(ans) cout << cnt;
        else cout << "-1";
        cout << endl;
    }
    return 0;
}

Problem C Inna and Huge Candy Matrix

题意：一个矩阵中有糖果，告诉你糖果的位置，然后先顺时针转90度x次，镜像y次，逆时针90度z次问你糖果的位置。

思路：直接模拟，注意每次旋转交换n和m

代码如下：

/**************************************************
 * Author     : xiaohao Z
 * Blog     : http://www.cnblogs.com/shu-xiaohao/
 * Last modified : 2014-03-05 23:14
 * Filename     : Codeforce_234_2_C.cpp
 * Description     : 
 * ************************************************/

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#define MP(a, b) make_pair(a, b)
#define PB(a) push_back(a)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<unsigned int,unsigned int> puu;
typedef pair<int, double> pid;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;

const int INF = 0x3f3f3f3f;
const double eps = 1E-6;
int n, m, x, y, z, p, a, b;

pii ca(pii t, int x){
    pii ret;
    while(x--){
        ret = t;
        ret.first = t.second;
        ret.second = n - t.first + 1;
        t = ret;
        swap(n, m);
    }
    return t;
}

pii cb(pii t, int x){
    pii ret = t;
    while(x--){
        ret = t;
        ret.second = m - t.second + 1;
    }
    return ret;
}

pii cc(pii t, int x){
    pii ret;
    while(x--){
        ret = t;
        ret.second = t.first;
        ret.first = m - t.second + 1;
        t = ret;
        swap(n, m);
    }
    return t;
}

int main()
{
//    freopen("in.txt", "r", stdin);

    pii sw;
    int tn, tm;
    while(cin >> tn >> tm >> x >> y >> z >> p){
        for(int i=0; i<p; i++){
            cin >> a >> b;
            n = tn, m = tm;
            sw = MP(a, b);
            sw = ca(sw, x%4);
            sw = cb(sw, y%2);
            sw = cc(sw, z%4);
            cout << sw.first << ' ' << sw.second << endl;
        }
    }
    return 0;
}