模拟一下
(注:博客作为交流使用,切勿抄袭应付作业)
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <algorithm>
#include <sstream>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
using namespace std;
typedef long long ll;
const int maxn = 10000 + 7;
int n, m, L, sum;
struct node {
string name;
int t, p, len;
}a[maxn];
bool vis[maxn];
vector<string> vec;
map<string, int> mp;
void init() {
memset(vis, false, sizeof vis);
sum = 0;