AtCoder Beginner Contest 001

Submission #1111506

Source codeソースコード

#include <bits/stdc++.h>

using namespace std;
//#define int long long

pair<int, int> data[30000] = {};
signed main() {
	int N; cin >> N;
	for (int i = 0; i<N; i++) {
		string tmp;
		cin >> tmp;
		int a[4];
		int b[4];
		b[2] = ((int)tmp[0] - '0') * 10 + ((int)tmp[1] - '0');
		b[1] = ((int)tmp[2] - '0');
		b[0] = ((int)tmp[3] - '0');
		a[2] = ((int)tmp[5] - '0') * 10 + ((int)tmp[6] - '0');
		a[1] = ((int)tmp[7] - '0');
		a[0] = ((int)tmp[8] - '0');
		int ta = 0;
		for (int j = 0; j<3; j++) {
			if (j == 0) {
				if (a[j] % 5 != 0) {
          if(a[j]<=5) a[j]=5;
          else a[j]=10;
					if (a[j]>9) {
						a[j] = 0;
						ta++;
					}
				}
				if (b[j] % 5 != 0) {
          if(b[j]<=5) b[j]=0;
          else b[j]=5;
				}
			}
			else if (j == 1) {
				if (ta == 1) {
					a[j]++;
					if (a[j]>5) {
						a[j] = 0;
						ta++;
					}
				}
			}
			else if (j == 2) {
				if (ta == 2) {
					a[j]++;
				}
			}
		}
		data[i].first = b[2] * 100 + b[1] * 10 + b[0] * 1;
		data[i].second = a[2] * 100 + a[1] * 10 + a[0] * 1;
	}

  sort(data,data+N);

  int t1=0,t2=0;
  for(int i=0;i<N;i++){
    if(i==0){
      t1=data[i].first;
      t2=data[i].second;
    }
    else{
      if(data[i].first<=t2){
        t1=min(t1,data[i].first);
        t2=max(t2,data[i].second);
      }
      else{
         printf("%04d-%04d\n",t1,t2);
         t1=data[i].first;
         t2=data[i].second;
       }
    }
    if(i==(N-1)) printf("%04d-%04d\n",t1,t2);

  }
	return 0;
}

Submission

Task問題 D - 感雨時刻の整理
User nameユーザ名 misscode
Created time投稿日時
Language言語 C++ (GCC 5.4.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 1552 Byte
File nameファイル名
Exec time実行時間 25 ms
Memory usageメモリ使用量 512 KB

Test case

Set

Set name Score得点 / Max score Cases
all 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt AC 1 ms 512 KB
00_sample_02.txt AC 1 ms 512 KB
00_sample_03.txt AC 1 ms 512 KB
cho_cho_chokudai.txt AC 23 ms 512 KB
chokudai_ga_cho.txt AC 24 ms 512 KB
test_01.txt AC 2 ms 512 KB
test_02.txt AC 2 ms 512 KB
test_03.txt AC 2 ms 512 KB
test_04.txt AC 2 ms 512 KB
test_05.txt AC 2 ms 512 KB
test_06.txt AC 2 ms 512 KB
test_07.txt AC 2 ms 512 KB
test_08.txt AC 2 ms 512 KB
test_09.txt AC 2 ms 512 KB
test_10.txt AC 2 ms 512 KB
test_11.txt AC 2 ms 512 KB
test_12.txt AC 2 ms 512 KB
test_13.txt AC 2 ms 512 KB
test_14.txt AC 2 ms 512 KB
test_15.txt AC 2 ms 512 KB
test_16.txt AC 2 ms 512 KB
test_17.txt AC 2 ms 512 KB
test_18.txt AC 2 ms 512 KB
test_19.txt AC 2 ms 512 KB
test_20.txt AC 2 ms 512 KB
test_21.txt AC 25 ms 512 KB
test_22.txt AC 25 ms 512 KB
test_23.txt AC 25 ms 512 KB
test_24.txt AC 25 ms 512 KB
test_25.txt AC 25 ms 512 KB
test_26.txt AC 25 ms 512 KB
test_27.txt AC 24 ms 512 KB
test_28.txt AC 25 ms 512 KB
test_29.txt AC 1 ms 512 KB
test_30.txt AC 1 ms 512 KB
test_31.txt AC 5 ms 512 KB
test_32.txt AC 1 ms 512 KB
test_33.txt AC 17 ms 512 KB
test_34.txt AC 1 ms 512 KB
test_35.txt AC 2 ms 512 KB
test_36.txt AC 25 ms 512 KB
test_37.txt AC 25 ms 512 KB
test_38.txt AC 24 ms 512 KB
test_39.txt AC 25 ms 512 KB
test_40.txt AC 25 ms 512 KB
test_41.txt AC 23 ms 512 KB
test_42.txt AC 24 ms 512 KB
test_43.txt AC 23 ms 512 KB