[email protected] div2

训练地址

Problem A
CodeForces 353A Domino
题意：输入n对数（xi,yi），所有数对的xi之和为sumx，yi之和为sumy，判断需要交换几个数对的xi与yi值才能使sumx与sumy均为偶数，如果不行输出-1.

思路：
1.若sumx与sumy均为偶数，输出0；不是，则sumx与sumy必然均为奇数，继续2:；其余情况输出-1。
2.sumx与sumy均为奇数，若通过交换能得到sumx与sumy成为偶数，则必然存在一个（奇，偶）或（偶，奇）的数对，存在输出1；不存在，输出-1.

代码：

/*
*Author : Flint_x 
*Created Time : 2015-04-12 13:19:31 
*File name : 411a.cpp 
*/

#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;

int x[105];
int y[105];

int main(){
//    freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
    int n;

    while(cin >> n) {
        lint sumx = 0 , sumy = 0;
        for(int i = 1 ; i <= n ; i++){
            cin >> x[i] >> y[i];
            sumx += x[i];
            sumy += y[i];
        }
//      cout << sumx << endl;
//      cout << sumy << endl;
        int flag = -1;
        if(sumx % 2 == 0 && sumy % 2 == 0){
            flag = 0;
        }
        else if((sumx + sumy) % 2 == 0 ) {
            for(int i = 1 ; i <= n ; i++){
                if((x[i]%2==0&&y[i]%2!=0)||(x[i]%2!=0&&y[i]%2==0)){
                    flag = 1;
                    break;
                }
            }
        }
        else if((sumx +sumy) % 2 != 0){
            flag = -1;
        }
        cout << flag << endl;
    }

    return 0;
}

Problem B
CodeForces 353C Find Maximum

题意难以描述，请戳这里
思路：
由于n最大可达到10^5，于是无法真的求出m大小，只可以用字符串来分析，通过dp来求解。
此题用scanf可以快很多！

代码：

/*
*Author : Flint_x 
*Created Time : 2015-04-12 14:16:54 
*File name : 411c.cpp 
*/

#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;

int a[100005],sum[100005];
string s;

int main(){
    freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
    int n;
    while(cin >> n){
        sum[0] = 0;
        for(int i = 1 ; i <= n ; i++){
            cin >> a[i];
            sum[i] = sum[i - 1] + a[i];
        }
        cin >> s;
//      cout << s;
        int len = s.length() - 1;
//      cout << len << endl;
        while(len > 0 && s[len] == '0') len --;
        int ans = 0 , tmp = 0; 
        for(int i = len ; i >= 0; i--){
            if(s[i] == '1'){
                ans = max(ans , tmp + sum[i]);
                tmp += a[i+1];
            }
        }
        ans = max(ans , tmp);
        cout << ans << endl;
    }

    return 0;
}

Problem D
CodeForces 350A TL
简单模拟题
代码：

/*
*Author : Flint_x 
*Created Time : 2015-04-12 13:48:57 
*File name : 411d.cpp 
*/

#include<iostream>
#include<sstream>
#include<fstream>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<ctime>
#include<iomanip>
using namespace std;
const double eps(1e-8);
typedef long long lint;

int a[105];
int b[105];

int main(){
//    freopen("input.txt","r",stdin);
//  freopen("output.txt","w",stdout);
    int n,m;
    while(cin >> n >> m){
        int maxa = 0,mina = 105;
        int minb = 105;
        for(int i = 1 ; i <= n ; i++){
            cin >> a[i];
            maxa = max(a[i],maxa);
            mina = min(a[i],mina);
        }
        for(int i = 1 ; i <= m ; i++){
            cin >> b[i];
            minb = min(b[i],minb);
        }
        int ans = -1;
        if(maxa > minb){
            ans = -1;
        }
        else if(maxa < minb){
            for(int i = maxa ; i < minb ; i++){
                if(2 * mina <= i){
                    ans = i;
                    break;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;
}

（待续。。）