Submission #1352756

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#define REP(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 1
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x)  cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) do{}while(0)
#define dump(x) do{}while(0)
#define BR
#endif

#define PRINT(s) cout << (s);
#define PRINTLN(s) cout << (s) << endl;

using namespace std;

// #define REP(i,N) for(int i = 0; i < N; i++)
int arr[25][12];

int main() {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        string tmp;
        cin >> tmp;
        int start = stoi(tmp.substr(0, 4));
        int end = stoi(tmp.substr(5, 4));
//        cout << tmp.substr(0, 4) << endl;
//        cout << start << endl;
//        cout << end << endl;
        int start_h = start / 100;
        int start_m = (start % 100) / 5;
        int end_h = end / 100;
        int end_m = ((end % 100) - 1) / 5 + 1;
        if(end_m == 12){
            end_h++;
            end_m = 0;
        }
        if(end % 100 == 0){
            end_m = 0;
        }
        for (int h = start_h; h <= end_h; h++) {
            for (int m = 0; m < 12; m++) {
                if (h > start_h && h < end_h) {
                    arr[h][m] = 1;
                } else if (start_h == end_h) {
                    if (m >= start_m && m <= end_m) {
//                        arr[h][m] =  1;
                        if(arr[h][m] != 1)arr[h][m] = m == end_m ? -1 : 1;
                    }
                } else if (h == start_h) {
                    if (m >= start_m) {
                        arr[h][m] = 1;
                    }
                } else if (h == end_h) {
                    if (m <= end_m) {
                        if(arr[h][m] != 1)arr[h][m] = m == end_m ? -1 : 1;
                    }
                } else {
                    cout << "err" << endl;
                }
            }
        }

    }

#ifdef LOCAL
    for(int i = 0; i < 25;i ++){
        for(int j = 0; j < 12; j++){
            cout << arr[i][j] << " ";
        }
        cout << endl;
    }
#endif
    //出力
    bool flag = false;
    int start_h,start_m,end_h,end_m;
    for (int h = 0; h < 25; h++) {
        for (int m = 0; m < 12; m++) {
            if (arr[h][m] && !flag) {
                flag = true;
                start_h = h;
                start_m = m;
//                cout << "trueになったよ" << endl;
            }
            if (flag && arr[h][m] == -1) {
                end_h = h;
//                end_m = m - 1;
//                if(end_m < 0){
//                    end_h--;
//                    end_m = 11;
//                }
                end_m = m;
//                cout << start_h << start_m << "-" << end_h << end_m << endl;
                printf("%02d%02d-%02d%02d\n",start_h,start_m * 5,end_h,end_m * 5);
                flag = false;
            }
        }
    }

    return 0;
}

Submission Info

Judge Result