Submission #154155


Source Code Expand

#include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <complex>
#include <cmath>
using namespace std;

int to_Min(int time){
  return (time / 100 * 60 + time % 100);
}

string to_hour(int time){
  string hour = "0000";
  hour[0] = time / 600 + '0';
  time %= 600;
  if(time / 60 > 9) hour[1] = time/60 - 10 +'0';
  else hour[1] = time/60 + '0';
  time %= 60;
  hour[2] = time / 10 + '0';
  hour[3] = time % 10 + '0';
  return hour;
}

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

  bool time[2000]={0};
  int a,b;
  for(int i=0;i<N;i++){
    scanf("%d-%d",&a,&b);
    //cout << "a:" <<a << " " << (a%1000) % 5 << endl;
    //cout << "b:" << b << " " << (b%1000) % 5 << endl;
    if(a % 5  != 0) a -= (a%1000)%5;
    a = to_Min(a);
    if( b % 5 != 0){
      b -=  (b%1000)%5;
      b+=5;
    }
    b = to_Min(b);
    //cout << "a,b:" << a << " " << b << endl;
    for(int i=a;i<=b;i++) time[i]=true;
  }

  for(int i=0;i<2000;i++){
    if(time[i]){
      cout << to_hour(i) << "-";
      while(i < 2000 && time[i++]);
      i--;i--;

      cout << to_hour(i) << endl;
    }
  }

  return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User ioryz
Language C++ (G++ 4.6.4)
Score 100
Code Size 1418 Byte
Status AC
Exec Time 93 ms
Memory 932 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 35 ms 808 KB
00_sample_02.txt AC 23 ms 880 KB
00_sample_03.txt AC 23 ms 932 KB
cho_cho_chokudai.txt AC 93 ms 884 KB
chokudai_ga_cho.txt AC 52 ms 876 KB
test_01.txt AC 23 ms 924 KB
test_02.txt AC 25 ms 872 KB
test_03.txt AC 25 ms 876 KB
test_04.txt AC 34 ms 920 KB
test_05.txt AC 23 ms 868 KB
test_06.txt AC 23 ms 920 KB
test_07.txt AC 24 ms 804 KB
test_08.txt AC 22 ms 924 KB
test_09.txt AC 23 ms 796 KB
test_10.txt AC 24 ms 804 KB
test_11.txt AC 25 ms 920 KB
test_12.txt AC 25 ms 928 KB
test_13.txt AC 24 ms 880 KB
test_14.txt AC 24 ms 920 KB
test_15.txt AC 25 ms 868 KB
test_16.txt AC 24 ms 872 KB
test_17.txt AC 25 ms 932 KB
test_18.txt AC 25 ms 920 KB
test_19.txt AC 24 ms 884 KB
test_20.txt AC 22 ms 924 KB
test_21.txt AC 35 ms 876 KB
test_22.txt AC 42 ms 872 KB
test_23.txt AC 36 ms 876 KB
test_24.txt AC 42 ms 872 KB
test_25.txt AC 37 ms 872 KB
test_26.txt AC 32 ms 876 KB
test_27.txt AC 32 ms 876 KB
test_28.txt AC 33 ms 880 KB
test_29.txt AC 24 ms 876 KB
test_30.txt AC 23 ms 876 KB
test_31.txt AC 26 ms 808 KB
test_32.txt AC 23 ms 924 KB
test_33.txt AC 29 ms 804 KB
test_34.txt AC 23 ms 920 KB
test_35.txt AC 23 ms 860 KB
test_36.txt AC 46 ms 884 KB
test_37.txt AC 32 ms 860 KB
test_38.txt AC 32 ms 872 KB
test_39.txt AC 34 ms 880 KB
test_40.txt AC 33 ms 868 KB
test_41.txt AC 62 ms 880 KB
test_42.txt AC 61 ms 876 KB
test_43.txt AC 61 ms 872 KB