A1016-4.cpp

/*
 *	author:		zhouyuhao
 *	created:	2024-04-27 21:30:30
 *	modified:	2024-04-27 21:40:00
 *	item:		Programming Ability Test
 *	site:		914, Harbin
 */
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>

using namespace std;

struct per {
	string name;
	int M, d, h, m, t;
	string line;
};

int toll[26];
double calfare(per a) {
	double fare = a.d * toll[25] * 60;
	fare += toll[a.h] * 60;
	fare += (toll[a.h + 1] - toll[a.h]) * a.m;
	return fare;
}

int main(int argc, char const *argv[]) {

	for (int i = 1; i <= 24; i++) {
		cin >> toll[i];
		toll[25] += toll[i];
		toll[i] = toll[25];
	}
	int n;
	cin >> n;
	vector<per> p(n);
	for (int i = 0; i < n; i++) {
		cin >> p[i].name;
		int unused __attribute__((unused)) = 0;
		unused = scanf("%d:%d:%d:%d", &p[i].M, &p[i].d, &p[i].h, &p[i].m);
		p[i].t = p[i].d * 24 * 60 + p[i].h * 60 + p[i].m;
		cin >> p[i].line;
	}
	sort(p.begin(), p.end(), [](per a, per b) -> bool {
		if (a.name != b.name) {
			return a.name < b.name;
		} else {
			return a.t < b.t;
		}
	});
	vector<per> b;
	for (int i = 0; i < n; i++) {
		if (p[i].name == p[i + 1].name) {
			if (p[i].line == "on-line" && p[i + 1].line == "off-line") {
				b.emplace_back(p[i]);
				b.emplace_back(p[i + 1]);
			}
		}
	}
	double tf = 0;
	for (int i = 0; i < (int)b.size(); i += 2) {
		bool next = false, before = false;
		if (i + 2 < (int)b.size() && b[i + 2].name == b[i].name) {
			next = true;
		}
		if (i - 2 >= 0 && b[i - 2].name == b[i].name) {
			before = true;
		}
		if (!before) {
			cout << b[i].name << " " << setfill('0') << setw(2) << b[i].M << "\n";
		}
		printf("%02d:%02d:%02d ", b[i].d, b[i].h, b[i].m);
		printf("%02d:%02d:%02d ", b[i + 1].d, b[i + 1].h, b[i + 1].m);
		double f = (calfare(b[i + 1]) - calfare(b[i])) / 100;
		cout << b[i + 1].t - b[i].t << " $" << fixed << setprecision(2) << f << "\n";
		tf += f;
		if (!next) {
			cout << "Total amount: $" << fixed << setprecision(2) << tf << "\n";
			tf = 0;
		}
	}

	return 0;
}