Codeforces #228 D2E / D1C:Fox and Card Game
2014-02-13 21:13
323 查看
题目:http://codeforces.com/contest/389/problem/E
参考:http://codeforces.com/blog/entry/10605
刚开始做的时候直接用贪心法,每次都选最大的卡片,结果WA。
代码:
// Fox and Card Game
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <bitset>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
typedef pair<int, int> pii;
typedef long long llong;
typedef pair<llong, llong> pll;
#define mkp make_pair
int main()
{
//#define LOCAL // 提交时注释掉 /*******************************************/
#ifdef LOCAL
freopen("data.txt", "r", stdin);
#endif
int n;
vector <int> middle;
while (cin >> n) {
middle.clear();
int cnt1, cnt2;
cnt1 = cnt2 = 0;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
int t = s / 2;
int c;
for (int j = 0; j < t; j++) {
scanf("%d", &c);
cnt1 += c;
}
if (s & 1) { // odd
scanf("%d", &c);
middle.push_back(c);
}
for (int j = 0; j < t; j++) {
scanf("%d", &c);
cnt2 += c;
}
}
sort(middle.begin(), middle.end(), greater <int>() );
for (int i = 0; i < middle.size(); i += 2) {
cnt1 += middle[i];
if (i + 1 < middle.size()) {
cnt2 += middle[i + 1];
}
}
cout << cnt1 << " " << cnt2 << endl;
}
return 0;
}
参考:http://codeforces.com/blog/entry/10605
刚开始做的时候直接用贪心法,每次都选最大的卡片,结果WA。
代码:
// Fox and Card Game
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <iostream>
#include <sstream>
#include <iomanip>
#include <bitset>
#include <string>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <climits>
using namespace std;
typedef pair<int, int> pii;
typedef long long llong;
typedef pair<llong, llong> pll;
#define mkp make_pair
int main()
{
//#define LOCAL // 提交时注释掉 /*******************************************/
#ifdef LOCAL
freopen("data.txt", "r", stdin);
#endif
int n;
vector <int> middle;
while (cin >> n) {
middle.clear();
int cnt1, cnt2;
cnt1 = cnt2 = 0;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
int t = s / 2;
int c;
for (int j = 0; j < t; j++) {
scanf("%d", &c);
cnt1 += c;
}
if (s & 1) { // odd
scanf("%d", &c);
middle.push_back(c);
}
for (int j = 0; j < t; j++) {
scanf("%d", &c);
cnt2 += c;
}
}
sort(middle.begin(), middle.end(), greater <int>() );
for (int i = 0; i < middle.size(); i += 2) {
cnt1 += middle[i];
if (i + 1 < middle.size()) {
cnt2 += middle[i + 1];
}
}
cout << cnt1 << " " << cnt2 << endl;
}
return 0;
}
相关文章推荐
- Codeforces Round #228 Fox and Card Game 解题报告
- Codeforces Round #228 (Div. 2), problem: (A) Fox and Number Game
- Codeforces Fox and Card Game (贪心,排序)
- Codeforces Round #228 (Div. 2) A. Fox and Number Game
- Fox and Card Game CodeForces - 388C
- Codeforces Round #228 (Div. 1) A. Fox and Box Accumulation 贪心
- Codeforces Round #228 Div1 B Fox and Minimal path
- codeforces A. Fox and Number Game
- Codeforces #228 D2D / D1B:Fox and Minimal path
- Codeforces Round #228 (Div. 2) C. Fox and Box Accumulation
- Appleman and Card Game CodeForces - 462B (贪心)
- Codeforces Round #228 (Div. 1) B. Fox and Minimal path
- Codeforces Round #228 (Div. 2)B. Fox and Cross
- 【Codeforces Round 263 (Div 2)B】【水题 贪心】Appleman and Card Game 选字符,每个字符个数的平方
- Codeforces Round #228 (Div. 2) B Fox and Cross(DFS)
- Codeforces Round #228 (Div. 2) B. Fox and Cross
- codeforces Fox and Number Game
- Codeforces #228 (Div. 2)C. Fox and Box Accumulation
- Educational Codeforces Round 21 F. Card Game(网络流之最大点权独立集)
- Codeforces Round #290 (Div. 2)-C. Fox And Names