Submission #109247


Source Code Expand

#include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <bitset>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cmath>

#define X first 
#define Y second
#define MP make_pair
using namespace std;

int main(){
	int n;
	map<int, int> tb, ans;
	cin >> n;
	for(int i = 0; i < n; i++){
		int tmp, tmps;
		scanf("%d-%d", &tmp, &tmps);
		
		if(tmp%10>5) tmp -= tmp%10-5;
		else if(tmp%10>=1 && tmp%10<5)tmp -= tmp%10;
		if(tmps%10>5){
			tmps = tmps-(tmps%10-5)+5;
			if(tmps%100>=60) tmps += 100-(tmps%100);
		}
		else if(tmps%10>=1 && tmps%10<5)tmps = tmps-(tmps%10)+5;

		if(tb.count(tmp)){
			if(tb[tmp] < tmps) tb[tmp] = tmps;
		}
		else tb[tmp] = tmps;
	}

	int prevf, prevs;
	for(map<int, int>::iterator it = tb.begin(); it != tb.end(); it++){
		if(it == tb.begin()){
			prevf = it->first;
			prevs = it->second;
		}
		else{
			if(it->first>prevs){
				ans[prevf] = prevs;
				prevf = it->first;
				prevs = it->second;
			}
			else{
				prevf = min(it->first, prevf);
				prevs = max(it->second, prevs);
			}
		}
	}
	ans[prevf] = prevs;

	for(map<int, int>::iterator it = ans.begin(); it != ans.end(); it++) printf("%04d-%04d\n", it->first, it->second);
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User keny30827
Language C++ (G++ 4.6.4)
Score 100
Code Size 1310 Byte
Status AC
Exec Time 36 ms
Memory 936 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:24:30: 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 22 ms 680 KB
00_sample_02.txt AC 23 ms 924 KB
00_sample_03.txt AC 21 ms 800 KB
cho_cho_chokudai.txt AC 31 ms 796 KB
chokudai_ga_cho.txt AC 31 ms 808 KB
test_01.txt AC 23 ms 720 KB
test_02.txt AC 23 ms 804 KB
test_03.txt AC 22 ms 804 KB
test_04.txt AC 22 ms 928 KB
test_05.txt AC 22 ms 800 KB
test_06.txt AC 32 ms 924 KB
test_07.txt AC 21 ms 804 KB
test_08.txt AC 22 ms 812 KB
test_09.txt AC 23 ms 796 KB
test_10.txt AC 22 ms 936 KB
test_11.txt AC 21 ms 804 KB
test_12.txt AC 22 ms 936 KB
test_13.txt AC 21 ms 808 KB
test_14.txt AC 23 ms 804 KB
test_15.txt AC 23 ms 924 KB
test_16.txt AC 22 ms 796 KB
test_17.txt AC 24 ms 800 KB
test_18.txt AC 22 ms 800 KB
test_19.txt AC 22 ms 804 KB
test_20.txt AC 22 ms 932 KB
test_21.txt AC 36 ms 812 KB
test_22.txt AC 34 ms 740 KB
test_23.txt AC 36 ms 812 KB
test_24.txt AC 35 ms 800 KB
test_25.txt AC 36 ms 804 KB
test_26.txt AC 36 ms 924 KB
test_27.txt AC 29 ms 796 KB
test_28.txt AC 36 ms 808 KB
test_29.txt AC 21 ms 804 KB
test_30.txt AC 23 ms 760 KB
test_31.txt AC 25 ms 816 KB
test_32.txt AC 23 ms 800 KB
test_33.txt AC 31 ms 812 KB
test_34.txt AC 23 ms 924 KB
test_35.txt AC 26 ms 748 KB
test_36.txt AC 33 ms 804 KB
test_37.txt AC 35 ms 804 KB
test_38.txt AC 35 ms 804 KB
test_39.txt AC 35 ms 800 KB
test_40.txt AC 34 ms 804 KB
test_41.txt AC 32 ms 800 KB
test_42.txt AC 34 ms 804 KB
test_43.txt AC 31 ms 924 KB