Submission #1648065

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<complex>
#include<cstdlib>
#include<set>
#include<cctype>

#define DBG cout << '!' << endl;
#define REP(i,n) for(int i = 0;i < (n);++i)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v,n) {for(int i = 0;i < (n);i++)cout << v[i] << ' ';cout << endl << endl;}
#define SHOW2d(v,i,j) {for(int a = 0;a < i;a++){for(int b = 0;b < j;b++)cout << v[a][b] << ' ';cout << endl;}cout << endl;}
#define ALL(v) v.begin(),v.end()

using namespace std;

typedef long long ll;
typedef vector<int> iv;
typedef vector<iv> iiv;
typedef vector<string> sv;

int main()
{
	int n;
	cin >> n;
	
	vector<pair<int ,int > > v;
	
	REP(i,n)
	{
		int a,b;
		scanf("%d-%d",&a,&b);
		a -= a % 5;
		if(b % 5 != 0)
		{
			b += 5 - (b % 5);
			if((b % 100) == 60)
			{
				b += 40;
			}
		}
		v.PB(MP(a,b));
	}
	
	sort(ALL(v));

	/*
	puts("");
	REP(i,v.size())
	{
		printf("%04d-%04d\n",v[i].FI,v[i].SE);
	}
	puts("");
	*/
	
	
	for(int i = 0;i < v.size()-1;i++)
	{
		if(v[i].SE >= v[i+1].FI)
		{
			
			pair<int ,int> p = MP(v[i].FI,max(v[i].SE,v[i+1].SE));
			v.erase(v.begin()+i,v.begin()+i+2);
			v.insert(v.begin()+i,p);
			--i;
		}
	}
	
	REP(i,v.size())
	{
		printf("%04d-%04d\n",v[i].FI,v[i].SE);
	}
	
	return 0;
}

Submission Info

Compile Error

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

Judge Result