#include <iostream>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
vector<int> drop(1010, 0), idx;
int n, m, t = 0, e = 0;
cin >> n;
for (int i = 0; i < n; i++){
int tmp, cur_num;
bool df = false;
cin >> m >> cur_num;
while (--m){
cin >> tmp;
if (tmp > 0){
if (tmp != cur_num){
df = true;
drop[i] = 1;
cur_num = tmp;
}
}
else cur_num += tmp;
}
t += cur_num;
if (df) idx.push_back(i);
}
for (int i = 0; i < idx.size(); i++){
if (drop[(idx[i]+1)%n] && drop[(idx[i]+n-1)%n]) e++;
}
cout << t << " " << idx.size() << " " << e;
return 0;
}
【CSP】201909-2 小明种苹果 (续) 模拟 哈希
最新推荐文章于 2024-08-25 23:55:22 发布