Submission #108257


Source Code Expand

#include <vector>
#include <string>
#include <iostream>
#include <fstream>
#include <sstream>
#include <list>
#include <algorithm>
#include <sstream>
#include <set>
#include <cmath>
#include <map>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <numeric>

#define INF (1<<30)
#define EPS 1e-6

using namespace std;

int
main()
{
	int N;
	int idx[2] = {3,8};
	char b[3] = {'6',':','f'};
	
	scanf("%d",&N);
	vector<string> vec;
	for (int i=0; i<N; ++i) {
		string str;
		cin >> str;
		for (int k=0; k<2; ++k) {
			int id = idx[k];
			if (str[id] > '5') {
				str[id] = !k ? '5' : '0';
				for (int j=1;k && j<=3; ++j) {
					str[id-j]++;
					if (str[id-j] != b[j-1]) {
						break;
					}
					str[id-j] = '0';
				}
			}
			else if (str[id] != '0' && str[id] != '5'){
				str[id] = !k ? '0' : '5';
			}
		}
		vec.push_back(str);
	}
	sort(vec.begin(), vec.end());
	vec.erase(unique(vec.begin(), vec.end()),vec.end());
	for (int i=1; i<vec.size(); ++i) {
		if (vec[i-1].substr(5,4) >= vec[i].substr(0,4)) {
			for (int j=0; j<4; ++j) {
				vec[i][j] = vec[i-1][j];
			}
			if (vec[i-1].substr(5,4) >= vec[i].substr(5,4)) {
				for (int j=0; j<4; ++j) {
					vec[i][5+j] = vec[i-1][5+j];
				}
			}
			vec[i-1] = "";
		}
	}
	
	for (int i=0; i<vec.size(); ++i) {
		if (vec[i] != "") {
			cout << vec[i] << endl;
		}
	}
	
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User even_eko
Language C++ (G++ 4.6.4)
Score 100
Code Size 1456 Byte
Status AC
Exec Time 102 ms
Memory 2528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:16: 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 20 ms 916 KB
00_sample_02.txt AC 22 ms 916 KB
00_sample_03.txt AC 24 ms 796 KB
cho_cho_chokudai.txt AC 68 ms 2340 KB
chokudai_ga_cho.txt AC 93 ms 2340 KB
test_01.txt AC 22 ms 800 KB
test_02.txt AC 22 ms 928 KB
test_03.txt AC 22 ms 924 KB
test_04.txt AC 21 ms 928 KB
test_05.txt AC 22 ms 920 KB
test_06.txt AC 22 ms 812 KB
test_07.txt AC 21 ms 852 KB
test_08.txt AC 22 ms 924 KB
test_09.txt AC 22 ms 924 KB
test_10.txt AC 21 ms 920 KB
test_11.txt AC 24 ms 920 KB
test_12.txt AC 22 ms 924 KB
test_13.txt AC 22 ms 928 KB
test_14.txt AC 22 ms 924 KB
test_15.txt AC 23 ms 924 KB
test_16.txt AC 24 ms 800 KB
test_17.txt AC 21 ms 920 KB
test_18.txt AC 21 ms 788 KB
test_19.txt AC 22 ms 928 KB
test_20.txt AC 22 ms 928 KB
test_21.txt AC 78 ms 2336 KB
test_22.txt AC 84 ms 2340 KB
test_23.txt AC 77 ms 2344 KB
test_24.txt AC 79 ms 2348 KB
test_25.txt AC 83 ms 2336 KB
test_26.txt AC 69 ms 2340 KB
test_27.txt AC 65 ms 2348 KB
test_28.txt AC 74 ms 2528 KB
test_29.txt AC 21 ms 796 KB
test_30.txt AC 21 ms 792 KB
test_31.txt AC 28 ms 1072 KB
test_32.txt AC 22 ms 924 KB
test_33.txt AC 51 ms 1824 KB
test_34.txt AC 22 ms 796 KB
test_35.txt AC 22 ms 928 KB
test_36.txt AC 85 ms 2336 KB
test_37.txt AC 69 ms 2348 KB
test_38.txt AC 102 ms 2340 KB
test_39.txt AC 79 ms 2340 KB
test_40.txt AC 83 ms 2344 KB
test_41.txt AC 71 ms 2344 KB
test_42.txt AC 74 ms 2344 KB
test_43.txt AC 87 ms 2444 KB