样例能过，可交上去就是过不了

代码如下：

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#include<cmath>
using namespace std;
int n,maxn[7]={-0x3f3f3f3f,-0x3f3f3f3f,-0x3f3f3f3f,-0x3f3f3f3f,-0x3f3f3f3f,-0x3f3f3f3f,-0x3f3f3f3f},minn[7]={0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f,0x3f3f3f3f},ans=0;
bool z[7][100002];

int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int p,ti;
		scanf("%d%d",&p ,&ti);
		z[p][ti]=1;
		if(maxn[p]<ti) maxn[p]=ti;
		if(minn[p]>ti) minn[p]=ti;
	}
	for(int j=1;j<=6;j++)
		for(int i=minn[j];i<=maxn[j];i+=60){
			bool mark=0;
			for(int k=i+59;k>=i;k--)
				if(z[j][k]) mark=1;
			if(mark) ans++;
		}
	printf("%d",ans);
	return 0;
}