Submission #462716


Source Code Expand

#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include <errno.h>
#include <stdlib.h>
#include <math.h>
#include <unistd.h>
#include <termios.h>
#include <time.h>
#include <float.h>
 
#include <sys/socket.h>
#include <arpa/inet.h>
#include <sys/ioctl.h>
#include <netdb.h>
 
#include <fcntl.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <dirent.h>
 
#include <vector>
#include <complex>
 
using namespace std;
typedef std::complex<double> sdlab_complex;

int get_minbasetime(int hour, int min)
{
  int ret = hour * 60 + min;

  return ret;
}

int get_4digittime(int t)
{
  int hour = t / 60;
  int min = t % 60;

  return hour * 100 + min;
}

double saru_round(double t, double unit)
{
  double ret = t / unit;
  int val = round(((int) ret));
  ret = ((double) val) * unit;

  return ret;
}

double saru_floor(double t, double unit)
{
  double ret = t / unit;
  int val = floor(((int) ret));
  ret = ((double) val) * unit;

  return ret;
}


int main()
{
  int N;
  int start[30001];
  int end[30001];

  scanf("%d", &N);
  for(int i = 0; i < N; i++){
    scanf("%d-%d", &start[i], &end[i]);
    start[i] = get_minbasetime(start[i] / 100, start[i] % 100);
    start[i] = (int) saru_floor(start[i], 5);
    end[i] = get_minbasetime(end[i] / 100, end[i] % 100);
    end[i] = (int) saru_floor(end[i] + 4, 5);
  }

//  for(int i = 0; i < N; i++){
//    printf("%04d-%04d\n", get_4digittime(start[i]), get_4digittime(end[i]));
//  }

  int min_start;
  //search next top
  int its_end = -1;
  while(true){
    bool is_found = false;
    for(int i = 0;i < N; i++){
      if(start[i] > its_end){
        min_start = start[i];
        its_end = end[i];
        is_found = true;
        break;
      }
    }

    if(is_found == false){
      break;
    }

    bool is_extended = true;
    while(is_extended == true){
      is_extended = false;

      for(int i = 0; i < N; i++){
        if(its_end >= start[i] && its_end < end[i]){
          its_end = end[i];
          is_extended = true;
        }
      }
    }

    printf("%04d-%04d\n", get_4digittime(min_start), get_4digittime(its_end));
  }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User saru
Language C++ (G++ 4.6.4)
Score 0
Code Size 2227 Byte
Status WA
Exec Time 40 ms
Memory 1048 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:68:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:70:39: 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 0 / 100
Status
AC × 13
WA × 35
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 WA 23 ms 800 KB
00_sample_02.txt AC 24 ms 688 KB
00_sample_03.txt AC 25 ms 680 KB
cho_cho_chokudai.txt AC 34 ms 932 KB
chokudai_ga_cho.txt WA 33 ms 936 KB
test_01.txt AC 23 ms 688 KB
test_02.txt WA 26 ms 800 KB
test_03.txt WA 25 ms 684 KB
test_04.txt AC 23 ms 684 KB
test_05.txt WA 23 ms 680 KB
test_06.txt AC 23 ms 688 KB
test_07.txt AC 23 ms 680 KB
test_08.txt AC 25 ms 796 KB
test_09.txt AC 25 ms 676 KB
test_10.txt AC 24 ms 676 KB
test_11.txt WA 24 ms 688 KB
test_12.txt WA 23 ms 804 KB
test_13.txt WA 24 ms 680 KB
test_14.txt WA 24 ms 680 KB
test_15.txt WA 24 ms 800 KB
test_16.txt WA 24 ms 800 KB
test_17.txt WA 22 ms 684 KB
test_18.txt WA 25 ms 676 KB
test_19.txt WA 23 ms 796 KB
test_20.txt WA 24 ms 804 KB
test_21.txt WA 35 ms 924 KB
test_22.txt WA 32 ms 928 KB
test_23.txt WA 35 ms 924 KB
test_24.txt WA 35 ms 932 KB
test_25.txt WA 35 ms 924 KB
test_26.txt WA 35 ms 916 KB
test_27.txt AC 34 ms 932 KB
test_28.txt WA 35 ms 1048 KB
test_29.txt AC 23 ms 676 KB
test_30.txt WA 29 ms 676 KB
test_31.txt WA 28 ms 696 KB
test_32.txt WA 25 ms 672 KB
test_33.txt WA 32 ms 800 KB
test_34.txt WA 26 ms 684 KB
test_35.txt WA 24 ms 672 KB
test_36.txt WA 40 ms 884 KB
test_37.txt WA 37 ms 924 KB
test_38.txt WA 35 ms 932 KB
test_39.txt WA 36 ms 928 KB
test_40.txt WA 37 ms 908 KB
test_41.txt AC 34 ms 932 KB
test_42.txt WA 35 ms 928 KB
test_43.txt WA 35 ms 928 KB