Submission #191018


Source Code Expand

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

#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);
  vector<int> E(N);

  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;

      }

    }

  }

  rep(i,N)
    cout << S[i] << "-" << E[i] << endl;


  if(N == 1){

    cout << S[0] << "-" << E[0] << endl;

  }
  else{

  int SS = S[0];
  int EE = E[0];

  rec(i,1,S.size()){

    if((SS <= S[i] && S[i] <= EE) && EE < E[i])

      EE = E[i];

    if(EE < S[i + 1]){

      cout << SS << "-" << EE << endl;

      if(i+1 < S.size()){
        SS = S[i + 1];
        EE = E[i + 1];
      }
    }
  }
  }
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User MurATa25
Language C++ (G++ 4.6.4)
Score 0
Code Size 1287 Byte
Status WA
Exec Time 1545 ms
Memory 1456 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22: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 0 / 100
Status
WA × 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 WA 26 ms 940 KB
00_sample_02.txt WA 32 ms 940 KB
00_sample_03.txt WA 61 ms 900 KB
cho_cho_chokudai.txt WA 1449 ms 1328 KB
chokudai_ga_cho.txt WA 1545 ms 1388 KB
test_01.txt WA 36 ms 888 KB
test_02.txt WA 29 ms 860 KB
test_03.txt WA 26 ms 928 KB
test_04.txt WA 27 ms 1052 KB
test_05.txt WA 33 ms 876 KB
test_06.txt WA 29 ms 900 KB
test_07.txt WA 41 ms 924 KB
test_08.txt WA 31 ms 888 KB
test_09.txt WA 34 ms 880 KB
test_10.txt WA 32 ms 884 KB
test_11.txt WA 28 ms 888 KB
test_12.txt WA 32 ms 1044 KB
test_13.txt WA 26 ms 884 KB
test_14.txt WA 33 ms 1056 KB
test_15.txt WA 36 ms 884 KB
test_16.txt WA 32 ms 888 KB
test_17.txt WA 53 ms 872 KB
test_18.txt WA 27 ms 860 KB
test_19.txt WA 28 ms 888 KB
test_20.txt WA 28 ms 936 KB
test_21.txt WA 1541 ms 1364 KB
test_22.txt WA 1489 ms 1456 KB
test_23.txt WA 1512 ms 1376 KB
test_24.txt WA 1501 ms 1384 KB
test_25.txt WA 1516 ms 1324 KB
test_26.txt WA 1536 ms 1312 KB
test_27.txt WA 1441 ms 1316 KB
test_28.txt WA 1486 ms 1316 KB
test_29.txt WA 48 ms 904 KB
test_30.txt WA 32 ms 900 KB
test_31.txt WA 92 ms 980 KB
test_32.txt WA 24 ms 1052 KB
test_33.txt WA 731 ms 1260 KB
test_34.txt WA 32 ms 876 KB
test_35.txt WA 31 ms 884 KB
test_36.txt WA 1524 ms 1388 KB
test_37.txt WA 1506 ms 1324 KB
test_38.txt WA 1515 ms 1324 KB
test_39.txt WA 1473 ms 1388 KB
test_40.txt WA 1493 ms 1384 KB
test_41.txt WA 1435 ms 1324 KB
test_42.txt WA 1491 ms 1388 KB
test_43.txt WA 1471 ms 1316 KB