Submission #2448680

---

Source Code Expand

#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int convert_time(string s) {
	int hx = (s[0] - '0') * 10 + (s[1] - '0');
	int mx = (s[3] - '0') * 10 + (s[4] - '0');
	int sx = (s[6] - '0') * 10 + (s[7] - '0');
	int fx = (s[9] - '0') * 100 + (s[10] - '0') * 10 + (s[11] - '0');
	return hx * 3600000 + mx * 60000 + sx * 1000 + fx;
}
int n, a[109], b[109];
int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		string sa, sb;
		cin >> sa >> sb;
		a[i] = convert_time(sa);
		b[i] = convert_time(sb);
	}
	int pl = -1, pr = -1;
	for (int i = 0; i < n; i++) {
		if (a[i] < b[i]) continue;
		if (pl == -1) {
			pl = a[i];
			pr = b[i] + 1000;
		}
		else {
			pl = max(pl, a[i]);
			pr = min(pr, b[i] + 1000);
		}
	}
	if (pl == -1) {
		for (int i = 0; i < n; i++) {
			cout << "-1\n";
		}
	}
	else {
		for (int i = 0; i < n; i++) {
			if (a[i] < b[i]) {
				if ((pl < a[i] && a[i] < pr) || (pl - 1000 < b[i] && b[i] < pr)) {
					cout << "-1\n";
				}
				else if (a[i] <= pl && pr <= b[i]) {
					cout << b[i] - a[i] + 1000 << "\n";
				}
				else {
					cout << b[i] - a[i] << "\n";
				}
			}
			else {
				cout << b[i] - a[i] + 1000 << "\n";
			}
		}
	}
	return 0;
}

Submission Info

Judge Result