toj4120.Zombies VS Plants

[code]#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include<sstream>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;

int main(){
    string s;
    int t;
    int n;
    int m;
    getline(cin,s);
    stringstream ss(s);
    ss>>t;                  //排除t输入前后的空格
    while(t--){
        getline(cin,s);
        stringstream ss(s);
        ss>>n;              //排除n输入前后的空格
        int ans=0;
        while(n--){
            int maxn=0;          //如果maxn一行处理完之后认为0，表示加1
            int sign=0;         //sign判断这一行是不是全部为空
            getline(cin,s);
            stringstream ss(s);
            while(ss>>m){
                maxn=max(m,maxn);
                sign=1;
            }
            if(maxn==0&&sign==1)
                ans+=1;
            else
                ans+=maxn;
        }
        printf("%d\n",ans);
    }
    return 0;
}
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include<sstream>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;

int main(){
    string s;
    int t;
    int n;
    int m;
    getline(cin,s);
    stringstream ss(s);
    ss>>t;                  //排除t输入前后的空格
    while(t--){
        getline(cin,s);
        stringstream ss(s);
        ss>>n;              //排除n输入前后的空格
        int ans=0;
        while(n--){
            int maxn=0;          //如果maxn一行处理完之后认为0，表示加1
            int sign=0;         //sign判断这一行是不是全部为空
            getline(cin,s);
            stringstream ss(s);
            while(ss>>m){
                maxn=max(m,maxn);
                sign=1;
            }
            if(maxn==0&&sign==1)
                ans+=1;
            else
                ans+=maxn;
        }
        printf("%d\n",ans);
    }
    return 0;
}