Submission #199916


Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rec(i,m,n) for(int i = m; i < n; ++i)

using namespace std;

int main(){

  int N;

  cin >> N;

  vector<int> S(N+1);
  vector<int> E(N+1);

  S[N] = -1;
  E[N] = -1;

  rep(i,N){

    scanf("%d-%d",&S[i],&E[i]);

    if(S[i]%10 < 5)
      S[i] -= S[i]%10;

    else if(S[i]%10 > 5)
      S[i] -= (S[i]%10 - 5);

    if(E[i]%10 < 5 && E[i]%10 != 0)
      E[i] += (5 - E[i]%10);

    else if(E[i]%10 > 5)
      E[i] += (10 - E[i]%10);

    if(E[i]%100 == 60)
      E[i] += 40;

  }

  rep(i,N){

    rep(j,N){

      if(S[i] < S[j]){

        int s,e;
        s = S[i];
        S[i] = S[j];
        S[j] = s;

        e = E[i];
        E[i] = E[j];
        E[j] = e;

      }

    }

  }

  if(0){
  rep(i,N){
    printf("%04d-%04d\n",S[i],E[i]);
  }
  }
  if(N == 1){

    printf("%04d-%04d\n",S[0],E[0]);

  }
  else{

  int SS = S[0];
  int EE = E[0];
  bool flag = false;

  rep(i,N+1){

    if(EE < S[i]){

      printf("%04d-%04d\n",SS,EE);
      SS = S[i];
      EE = E[i];

      flag = true;

    }
    else if((SS <= S[i] && S[i] <= EE) && EE < E[i])
      EE = E[i];
    else if(S[i] == -1 && flag){

      printf("%04d-%04d\n",SS,EE);

    }

  }

  if(!flag)
    printf("%04d-%04d\n",SS,EE);
  }

}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User MurATa25
Language C++ (G++ 4.6.4)
Score 100
Code Size 1423 Byte
Status AC
Exec Time 1402 ms
Memory 1060 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:31: 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 21 ms 800 KB
00_sample_02.txt AC 21 ms 804 KB
00_sample_03.txt AC 20 ms 804 KB
cho_cho_chokudai.txt AC 1304 ms 928 KB
chokudai_ga_cho.txt AC 1402 ms 928 KB
test_01.txt AC 21 ms 804 KB
test_02.txt AC 21 ms 800 KB
test_03.txt AC 21 ms 800 KB
test_04.txt AC 21 ms 804 KB
test_05.txt AC 22 ms 760 KB
test_06.txt AC 20 ms 800 KB
test_07.txt AC 21 ms 804 KB
test_08.txt AC 21 ms 808 KB
test_09.txt AC 23 ms 804 KB
test_10.txt AC 22 ms 808 KB
test_11.txt AC 23 ms 808 KB
test_12.txt AC 22 ms 800 KB
test_13.txt AC 21 ms 800 KB
test_14.txt AC 22 ms 804 KB
test_15.txt AC 23 ms 732 KB
test_16.txt AC 23 ms 764 KB
test_17.txt AC 22 ms 804 KB
test_18.txt AC 22 ms 844 KB
test_19.txt AC 24 ms 764 KB
test_20.txt AC 21 ms 804 KB
test_21.txt AC 1377 ms 1056 KB
test_22.txt AC 1356 ms 1060 KB
test_23.txt AC 1376 ms 1060 KB
test_24.txt AC 1356 ms 996 KB
test_25.txt AC 1365 ms 932 KB
test_26.txt AC 1394 ms 996 KB
test_27.txt AC 1301 ms 992 KB
test_28.txt AC 1342 ms 928 KB
test_29.txt AC 22 ms 740 KB
test_30.txt AC 22 ms 740 KB
test_31.txt AC 59 ms 932 KB
test_32.txt AC 22 ms 808 KB
test_33.txt AC 621 ms 864 KB
test_34.txt AC 21 ms 804 KB
test_35.txt AC 22 ms 732 KB
test_36.txt AC 1371 ms 936 KB
test_37.txt AC 1360 ms 988 KB
test_38.txt AC 1389 ms 988 KB
test_39.txt AC 1339 ms 1060 KB
test_40.txt AC 1357 ms 1056 KB
test_41.txt AC 1301 ms 932 KB
test_42.txt AC 1337 ms 996 KB
test_43.txt AC 1335 ms 932 KB