Submission #485397


Source Code Expand

#include <bits/stdc++.h> 
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;

#define all(a)  (a).begin(),(a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define loop(i,a,b) for(ull i=(a);i<ull(b);++i)
#define rep(i,n) loop(i,0,n)
#define iter(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define riter(i,c) for(auto i=(c).rbegin(); i!=(c).rend(); ++i)

const double eps = 1e-10;
const double pi  = acos(-1.0);
const double inf = (int)1e8;

#define clr(a,i) memset((a), (i) ,sizeof(a))

int main(){
	pii a;
	string x,y;
	int n;

	cin>> n;
	vector<pii> s(n);
	rep(i,n){
		scanf("%d-%d",&a.first,&a.second);
		if(a.first%5!=0) a.first-=a.first%5;
		if(a.second%5!=0) a.second+=(5-a.second%5);
		if(a.second%100==60) a.second+=40;
		s[i]=a;
	}
	sort(all(s));
	int tmp=0;
	rep(i,n){
		if(tmp==0){
			printf("%04d-",s[i].first);
			tmp=s[i].second;
		}
		if(i==n-1||tmp<s[i+1].first){
			printf("%04d\n",tmp); tmp=0;
		}else if(tmp<s[i+1].second){
			tmp=s[i+1].second;
		}
	}
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User menphim
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1254 Byte
Status AC
Exec Time 40 ms
Memory 1064 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d",&a.first,&a.second);
                                    ^

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 24 ms 800 KB
00_sample_02.txt AC 23 ms 804 KB
00_sample_03.txt AC 23 ms 808 KB
cho_cho_chokudai.txt AC 34 ms 932 KB
chokudai_ga_cho.txt AC 38 ms 932 KB
test_01.txt AC 24 ms 924 KB
test_02.txt AC 25 ms 932 KB
test_03.txt AC 26 ms 804 KB
test_04.txt AC 23 ms 748 KB
test_05.txt AC 24 ms 796 KB
test_06.txt AC 24 ms 804 KB
test_07.txt AC 24 ms 804 KB
test_08.txt AC 24 ms 928 KB
test_09.txt AC 25 ms 804 KB
test_10.txt AC 24 ms 808 KB
test_11.txt AC 32 ms 928 KB
test_12.txt AC 25 ms 844 KB
test_13.txt AC 25 ms 928 KB
test_14.txt AC 25 ms 800 KB
test_15.txt AC 24 ms 808 KB
test_16.txt AC 24 ms 932 KB
test_17.txt AC 24 ms 808 KB
test_18.txt AC 26 ms 680 KB
test_19.txt AC 24 ms 804 KB
test_20.txt AC 24 ms 676 KB
test_21.txt AC 37 ms 932 KB
test_22.txt AC 37 ms 932 KB
test_23.txt AC 37 ms 1064 KB
test_24.txt AC 36 ms 928 KB
test_25.txt AC 37 ms 1060 KB
test_26.txt AC 36 ms 932 KB
test_27.txt AC 34 ms 932 KB
test_28.txt AC 37 ms 1064 KB
test_29.txt AC 25 ms 804 KB
test_30.txt AC 25 ms 796 KB
test_31.txt AC 27 ms 808 KB
test_32.txt AC 27 ms 804 KB
test_33.txt AC 34 ms 864 KB
test_34.txt AC 24 ms 796 KB
test_35.txt AC 24 ms 924 KB
test_36.txt AC 38 ms 1056 KB
test_37.txt AC 39 ms 932 KB
test_38.txt AC 40 ms 932 KB
test_39.txt AC 39 ms 1056 KB
test_40.txt AC 37 ms 992 KB
test_41.txt AC 37 ms 932 KB
test_42.txt AC 37 ms 924 KB
test_43.txt AC 38 ms 928 KB