Submission #3402597


Source Code Expand

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <string.h>
#include <sstream>
using namespace std;
#define N_MAX 30000
int N;
int S[N_MAX], E[N_MAX];

std::vector<std::string> split(const std::string &str, char sep)
{
    std::vector<std::string> v;
    std::stringstream ss(str);
    std::string buffer;
    while( std::getline(ss, buffer, sep) ) {
        v.push_back(buffer);
    }
    return v;
}
int main(){
  cin >> N;
  for(int i = 0; i < N; i++){
    string tmp;
    cin >> tmp;
    vector<string> str = split(tmp, '-');
    S[i] = atoi(str[0].c_str());
    E[i] = atoi(str[1].c_str());
  }
  for(int i = 0; i < N; i++){
    S[i] = S[i] - S[i]%5;
    if(S[i] % 100 == 60) S[i] += 40;
    if(E[i] % 5 != 0){
      E[i] = E[i] + (5-E[i]%5);
      if(E[i] % 100 == 60) E[i] += 40;
    }
  }

  int time[482] = {0};
  for(int i = 0; i < N; i++){
    time[S[i]/5+1]++;
    time[E[i]/5+1]--;
  }
  for(int i = 1; i < 482; i++){
    time[i] += time[i-1];
  }

  if(time[0] > 0)
    cout << setfill('0') << setw(4) << 0 << "-";
  for(int i = 0; i < 482 - 1; i++){
    if(time[i] == 0 && time[i+1] > 0)
      cout << setfill('0') << setw(4) << (i)*5 << "-";
    if(time[i] > 0 && time[i+1] == 0)
      cout << setfill('0') << setw(4) << (i)*5 << endl;
  }
}

Submission Info

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

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 49 ms 512 KB
chokudai_ga_cho.txt AC 52 ms 512 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 2 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 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 2 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 52 ms 512 KB
test_22.txt AC 50 ms 512 KB
test_23.txt AC 49 ms 512 KB
test_24.txt AC 49 ms 512 KB
test_25.txt AC 50 ms 512 KB
test_26.txt AC 50 ms 512 KB
test_27.txt AC 49 ms 512 KB
test_28.txt AC 49 ms 512 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 8 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 35 ms 384 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 50 ms 512 KB
test_37.txt AC 49 ms 512 KB
test_38.txt AC 49 ms 512 KB
test_39.txt AC 50 ms 512 KB
test_40.txt AC 52 ms 512 KB
test_41.txt AC 49 ms 512 KB
test_42.txt AC 49 ms 512 KB
test_43.txt AC 49 ms 512 KB