CCF-CSP 201909-2 小明种苹果(续)
题目描述
思路
奇怪的题目描述增加了。但依然不涉及复杂的算法。暴力就完事了。
代码
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> drops;
int sum = 0;
int i,j;
int m;
int amout;
int temp;
bool drop;
for (i = 0; i < n; i++) {
drop = false;
cin >> m;
for (j = 0; j < m; j++){
if (j == 0) {
cin >> amout;
}
else {
cin >> temp;
if (temp > 0) {
if (temp != amout) {
amout = temp;
drop = true;
}
}
else {
amout += temp;
}
}
}
sum += amout;
drops.push_back(drop);
}
int count = 0;
int triCount = 0;
for (i = 0; i < n; ++i) {
if (drops[i] && drops[(i + 1) % n] && drops[(i + 2) % n]){
triCount++;
}
if (drops[i]){
count ++;
}
}
cout << sum << " " << count << " " << triCount << "\n";
}