输入格式

第一行是两个整数n,m(0 <= n,m <= 100)，分别代表男生的数量和女生的数量接下来输入n个男生的数据，对于每个男生有一组数据
每组数据的第一行为一个整数t( 0 <= t <= 10 )，代表该男生拥有的空闲时间段数量
接下来为t行
每行的格式为XX:XX-XX:XX    (00:00 <= XX:XX <= 23:59)
代表其在XX:XX至XX:XX的时间段有空闲时间，但是可能跨越一天接下来m个女生的数据，输入格式同男生

输出格式

输出一个整数，代表有可能见面的男女的对数

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#define IOS ios::sync_with_stdio(false)
using namespace std;
#define inf (0x3f3f3f3f)
typedef long long int LL;#include <iostream>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <string>
const int maxn = 2400 + 20;
struct node {int num;bool book[maxn];
}boy[100 + 20], girl[100 + 20];
int n, m;
void work() {scanf("%d%d", &n, &m);for (int i = 1; i <= n; ++i) {int t;scanf("%d", &t);boy[i].num = t;while (t--) {int a, b, c, d;scanf("%d:%d-%d:%d", &a, &b, &c, &d);int begin = a * 100 + b;int end = c * 100 + d;if (begin > end) {for (int j = begin; j <= 2400; ++j) {boy[i].book[j] = true;}for (int j = 0; j <= end; ++j) {boy[i].book[j] = true;}} else {for (int j = begin; j <= end; ++j) {boy[i].book[j] = true;}}}}for (int i = 1; i <= m; ++i) {int t;scanf("%d", &t);girl[i].num = t;while (t--) {int a, b, c, d;scanf("%d:%d-%d:%d", &a, &b, &c, &d);int begin = a * 100 + b;int end = c * 100 + d;if (begin > end) {for (int j = begin; j <= 2400; ++j) {girl[i].book[j] = true;}for (int j = 0; j <= end; ++j) {girl[i].book[j] = true;}} else {for (int j = begin; j <= end; ++j) {girl[i].book[j] = true;}}}}int ans = 0;for (int i = 1; i <= n; ++i) {for (int j = 1; j <= m; ++j) {for (int k = 0; k <= maxn - 20; ++k) {if (boy[i].book[k] && girl[j].book[k]) {ans++;break;}}}}printf("%d\n", ans);
}int main() {
#ifdef localfreopen("data.txt","r",stdin);
#endifwork();return 0;
}