牛客寒假算法基础集训营2 B. 处女座与cf(模拟)

#include <bits/stdc++.h>
using namespace std;
struct Node{
    string str;
    bool flag;
    int sum;
}Edge[505];
struct node{
  int t;
  string s,num,sta;
}a[10005];
int n,m;
typedef pair<string,string> p;
map<p,int> ma;
int A = 150, B = 300, C = 450, D = 600, E = 750;
int _A = 2, _B = 4, _C = 6, _D = 8, _E = 10;
 
bool cmp(Node a,Node b){
    return a.sum > b.sum;
}
 
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        cin>>Edge[i].str;
        Edge[i].sum = 0;
        Edge[i].flag = false;
    }
  for(int i=1;i<=m;i++){
    scanf("%d",&a[i].t);
    cin>>a[i].s>>a[i].num>>a[i].sta;
  }
  int cnt = 0;
  for(int i=m;i>=1;i--){
    if(ma[p(a[i].s,a[i].num)] == 0){
      if(a[i].sta == "CE" || a[i].sta == "WA" || a[i].sta == "TLE"){
        for(int j=1;j<=n;j++){
          if(Edge[j].str == a[i].s){
            if(Edge[j].flag == false) cnt ++;
            Edge[j].flag = true;
          }
        }
      }
      if(a[i].sta == "AC"){
        int xx = 0;
        for(int j=i-1;j>=1;j--){
          if(a[i].s == a[j].s && a[i].num == a[j].num && a[j].sta != "CE")xx ++;
        }
        if(a[i].num == "A"){
          for(int j=1;j<=n;j++){
            if(a[i].s == Edge[j].str){
              if(Edge[j].flag == false) cnt ++;
              Edge[j].flag = true;
              Edge[j].sum += max(A, 500 - (a[i].t * _A) - (xx * 50));
            }
          }
        }
        if(a[i].num == "B"){
          for(int j=1;j<=n;j++){
            if(a[i].s == Edge[j].str){
              if(Edge[j].flag == false) cnt ++;
              Edge[j].flag = true;
              Edge[j].sum += max(B, 1000 - (a[i].t * _B) - (xx * 50));
            }
          }
        }
        if(a[i].num == "C"){
          for(int j=1;j<=n;j++){
            if(a[i].s == Edge[j].str){
              if(Edge[j].flag == false) cnt ++;
              Edge[j].flag = true;
              Edge[j].sum += max(C, 1500 - (a[i].t * _C) - (xx * 50));
            }
          }
        }
        if(a[i].num == "D"){
          for(int j=1;j<=n;j++){
            if(a[i].s == Edge[j].str){
              if(Edge[j].flag == false) cnt ++;
              Edge[j].flag = true;
              Edge[j].sum += max(D, 2000 - (a[i].t * _D) - (xx * 50));
            }
          }
        }
        if(a[i].num == "E"){
          for(int j=1;j<=n;j++){
            if(a[i].s == Edge[j].str){
              if(Edge[j].flag == false) cnt ++;
              Edge[j].flag = true;
              Edge[j].sum += max(E, 2500 - (a[i].t * _E) - (xx * 50));
            }
          }
        }
      }
      ma[p(a[i].s, a[i].num)] = 1;
    }
  }
  sort(Edge+1,Edge+n+1,cmp);
  int yy = 0;
  int yy1 = 0;
    for(int i=1;i<=n;i++){
    yy1 ++;
        if(Edge[i].sum != Edge[i-1].sum)yy = yy1;
        if(Edge[i].str == "cnz"){
            if(Edge[i].flag == true){
                printf("%d\n",Edge[i].sum);
                printf("%d/%d\n",yy , cnt);
            }
            else{
                puts("-1");
            }
            break;
        }
    }
    return 0;
}