Submission #2411492

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stdio.h>
#include <map>
#include <queue>
#include <numeric>
#include <iomanip>
#include <climits>
#include <functional>
using namespace std;
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
using ll = unsigned long long;
const ll mod = 1000000007;
const int M_MAX = 10000;
string al = "abcdefghijklmnopqrstuvwxyz";
//bool less_sec(const pair<int, int>&a, const pair<int, int>&b) {
//	return a.second > b.second;
//}
// << 左シフト(値が大きくなる(*‘ω‘ *))
// >> 右シフト
// 0xFFFFFFFC
int main() {
	int time[24*(60/5)+1] = { 0 };
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n; cin >> n;
	for (int i = 0; i < n; ++i) {
		int a, b;
		cin >> a >> b;
		b =-b;
      	a = a/5*5;
      	if(b%5!=0) b = b/5*5+5;
      	int rs = (a/100)*12 + (a%100)/5;
      	int re = (b/100)*12 + (b%100)/5;
		for(int i=rs; i<re; ++i){
          time[i] = 1;
		}

	}
	bool flag = true;
	for (int i = 0, l=0; i <289; l = time[i++]) {
		int t = (i/12)*100+(i%12)*5;
      	if(l==0&&time[i]==1){
          cout << setfill('0') << setw(4) << t << "-";
        }else if(l==1&& time[i]==0){
          cout << setfill('0') << setw(4) << t << endl;
        }
	}
	return 0;
}

Submission Info

Judge Result