Submission #1215271


Source Code Expand

#include <cstdio>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <string>
#include <queue>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <set>
#include <deque>
#include <utility>
#include <chrono>
#include <sstream>
#include <iomanip>

#define INF 1 << 30
#define MOD 1000000007;
#define PI 3.14159265358979
#define rep(i, n) for (int (i) = 0; (i) < (int)(n); (i)++)
#define reu(i, l, r) for (int (i) = (int)(l); (i) < (int)(r); (i)++)
#define D(x) cout << x << endl
#define d(x) cout << x
#define all(x) (x).begin(), (x).end()
#define pub(x) push_back(x)
#define pob() pop_back()
#define puf(x) push_front(x)
#define pof() pop_front()
#define mp(x, y) make_pair((x), (y))
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
template<typename T, typename U> inline void amin(T &x, U y) { if (y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if (x < y) x = y; }

static const int dx[] = {0, 0, 1, -1};
static const int dy[] = {-1, 1, 0, 0};

int main() { 
  int n;
  cin >> n;
  int imos[2000] = { 0 };

  rep(i, n) {
    int s, e;
    scanf("%d-%d", &s, &e);
    int smin, emin;
    smin = 60 * (s / 100) + (s % 100) - (s % 5);
    emin = 60 * (e / 100) + (e % 100) - (e % 5 == 0 ? 0 : (e % 5) - 5);
    ++ imos[smin];
    -- imos[emin];
  }

  reu(i, 1, 2000) {
    imos[i] += imos[i - 1];
  }

  vi ans;

  bool flag = false;
  rep (i, 2000) {
    if (imos[i] != 0 && !flag) {
      ans.pub(i);
      flag = true;
    } else if (flag && imos[i] == 0) {
      ans.pub(i);
      flag = false;
    }
  }

  for (int i = 0; i < ans.size(); i += 2) {
    D(setw(2) << setfill('0') << ans[i] / 60 << setw(2) << setfill('0') << ans[i] % 60 << "-" << setw(2) << setfill('0') << ans[i + 1] / 60 << setw(2) << setfill('0') << ans[i + 1] % 60);
  }

  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User KokiYmgch
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2238 Byte
Status AC
Exec Time 6 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:61:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d-%d", &s, &e);
                           ^

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 6 ms 256 KB
chokudai_ga_cho.txt AC 6 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 2 ms 256 KB
test_05.txt AC 2 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 6 ms 256 KB
test_22.txt AC 6 ms 256 KB
test_23.txt AC 6 ms 256 KB
test_24.txt AC 6 ms 256 KB
test_25.txt AC 6 ms 256 KB
test_26.txt AC 6 ms 256 KB
test_27.txt AC 6 ms 256 KB
test_28.txt AC 6 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 4 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 6 ms 256 KB
test_37.txt AC 6 ms 256 KB
test_38.txt AC 6 ms 256 KB
test_39.txt AC 6 ms 256 KB
test_40.txt AC 6 ms 256 KB
test_41.txt AC 6 ms 256 KB
test_42.txt AC 6 ms 256 KB
test_43.txt AC 6 ms 256 KB