Submission #108347

---

Source Code Expand

#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_DEPRECATE

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <iterator>

using namespace std;
const int MOD = 1000000007; // check!!!
const int INF = 100000000; //1e8

typedef long long ll;
typedef pair<int,int> Pii;
typedef pair<ll,ll> Pll;

#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)(c).size())
#define ten(x) ((int)1e##x)
#define tenll(x) ((ll)1e##x)


int main(){
	int n; cin>>n;
	vector<Pii> vp;
	FOR(i,n){
		int a,b; scanf("%d-%d",&a,&b);
		a = a/5*5;
		b = (b+4)/5*5;
		if(b%100 == 60) b += 40;
		vp.emplace_back(a,b);
	}

	sort(vp.begin(),vp.end());

	vector<Pii> ans;
	ans.push_back(vp[0]);
	for(int i = 1; i < n; i++){
		if(ans.back().second >= vp[i].first){
			ans[sz(ans)-1].second = max(ans[sz(ans)-1].second,vp[i].second);
		} else {
			ans.push_back(vp[i]);
		}
	}

	FOR(i,sz(ans)){
		printf("%04d-%04d\n",ans[i].first,ans[i].second);
	}

	return 0;
}

Submission Info

Compile Error

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

Judge Result