Submission #7570311

---

Source Code Expand

#include <iostream> // cout, cin, endl
#include <string> // stoi
#include <vector> // vector
#include <algorithm> // max, min
#include <iomanip> // setw, setfill
#include <sstream> // ostringstream

using namespace std;

vector<int> round_to_five(int s, int e);
bool shall_we_combine(vector<int> se1, vector<int> se2);

int main() {

	// 入力受付
	int N;
	cin >> N;

	string SE_in;
	vector<vector<int>> SE(N);

	int sn, en;
	for (int n = 0; n<N; n++) {
		cin >> SE_in;
		// ベクトル化
		sn = stoi(SE_in.substr(0, SE_in.find_first_of("-")));
		en = stoi(SE_in.substr(SE_in.find_first_of("-")+1, 4));
		SE[n] = round_to_five(sn, en);
	}

	// 結合
	vector<int> se1, se2;
	bool flg = true;
	while (flg) {
		flg = false;

		for (unsigned int i = 0; i < SE.size(); i++) {
			for (unsigned int j = 1; j < (SE.size() - i); j++) {
				se1 = SE[i];
				se2 = SE[i+j];
				if (shall_we_combine(se1, se2)) {
					SE.erase(SE.begin() + i+j);
					SE.erase(SE.begin() + i);
					vector<int> new_vec = { min(se1[0], se2[0]), max(se1[1], se2[1]) };
					SE.push_back(new_vec);
					flg = true;
					goto LOOP_END;
				}
			}
		}
		LOOP_END:;
	}

	// 文字列化してソート
	vector<string> out;
	for (unsigned int i = 0; i < SE.size(); i++) {
		ostringstream ss;
		ss << setfill('0') << setw(4) << SE[i][0] << "-" << setfill('0') << setw(4) << SE[i][1];
		out.push_back(ss.str());
	}
	sort(out.begin(), out.end());

	// 結果出力
	for (unsigned int i = 0; i < out.size(); i++) {
		cout << out[i] << endl;
	}


	return 0;
}

vector<int> round_to_five(int s, int e) {

	// 5分単位にまるめてvectorを返す
	int s_fd;
	int e_fd;

	s_fd = s % 10;
	e_fd = e % 10;

	if (s_fd < 5) {
		s -= s_fd;
	
	} else {
		s = s - s_fd + 5;
	}

	if (e_fd != 0) {
		if (e_fd < 5) {
			e = e - e_fd + 5;
		} else {
			e = e - e_fd + 10;
		}
	}

	vector<int> ret = { s, e };
	return ret;
}

bool shall_we_combine(vector<int> se1, vector<int> se2) {

	// startの大きいほうと、endの小さいほうを比較。かぶっていたら結合(true)を返す
	// int s_larger = max(se1[0], se2[0]);
	// int e_smaller = min(se1[1], se2[1]);

	if (max(se1[0], se2[0]) <= min(se1[1], se2[1])) {
		return true;
	}
	else {
		return false;
	}

}

Submission Info

Judge Result