Submission #1961575

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

int t[24*3600+10];

int main(){
	int n;
	scanf("%d", &n);
	rep(i, n){
		int a, b, c, d;
		scanf("%2d%2d-%2d%2d", &a, &b, &c, &d);
		b = b/5*5;
		d = (d+4)/5*5;
		for(int i = a*60+b; i <= c*60+d; i++) t[i] = 1;
		//printf("%d %d %d %d\n", a, b, c, d);
	}
	bool r = false;
	rep(i, 24*3600+2){
		if(!r && t[i]){
			printf("%02d%02d-", i/60, i%60);
			r = true;
		} else if(r && !t[i]){
			printf("%02d%02d\n", (i-1)/60, (i-1)%60);
			r = false;
		}
	}
	return 0;
}

Submission Info

Compile Error

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

Judge Result