Submission #1114049

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
#include<queue>
#include<functional>
#include<numeric>
#include<sstream>
#include<math.h>
#include <iomanip>
#define ll long long
#define PLL pair<ll,ll>
#define VS vector<string>
#define VL vector<ll>
#define rep(i,a) for (ll i=0;i<a;i++)
#define nrep(i,n,a) for (ll i=n;i<a;i++)
#define mrep(i,a) for(ll i=a;i>=0;i--)
#define INF 1145141919810
#define VMIN(vec) *std::max_element(vec.begin(),vec.end())
#define VMIN(vec) *std::max_element(vec.begin(),vec.end())
#define VSUM(vec) std::accumulate(vec.begin(),vec.end(),0LL)
#define LTS(n) to_string(n)
#define STL(str) stoll(str);

using namespace std;

VL split_to_VL(const string &s, char cut){
	VL elements;
	stringstream ss(s);
	string item;
	ll temp;
	while (getline(ss, item, cut)) if (!item.empty()){
		temp = STL(item);
		elements.push_back(temp);
	}
	return elements;
}

int main() {
	VL dp(2401, 0),temp;
	VS sum;
	ll n, a, b;
	string str,str_temp;
	cin >> n;
	rep(i, n){
		cin >> str;
		temp = split_to_VL(str,'-');
		temp[0] -= temp[0] % 5;
		if(temp[1]%5!=0) temp[1] += (5 - temp[1] % 5);
		str_temp = LTS(temp[1]);
		if (str_temp.size()>=2 && str_temp[str_temp.size()-2] == '6'){
			str_temp[str_temp.size() - 2] = '0';
			temp[1] = STL(str_temp);
			temp[1] += 100;
		}//cout << temp[0] << " " << temp[1] << endl;
		//dp[temp[0]]++;
		//dp[temp[1]]--;
		nrep(i, temp[0], temp[1]+1) dp[i] = 1;
	}//cout << "sum" << endl;
	/*
	ll count = 0;
	ll index = 0;
	while (!dp[index]) index++;
	nrep(i, index, 2401){
		if (dp[i] >0){
			count++;
			if (count == 1){
				cout << i <<"-";
			}
		}
		if (dp[i] <0){
			count--;
			if (count == 0){
				cout << i << endl;
			}
		}
	}
	*/
	rep(i, 2401){
		if (dp[i] == 1){
			cout << setfill('0') << setw(4) << right << i++;
			while (i < 2401 && dp[i]) i++;
			str_temp = LTS(temp[1]);
			cout << "-" << setfill('0') << setw(4) << right << i - 1 << endl;
		}
	}
	return 0;
}

Submission Info

Judge Result