Submission #16326

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
16326	2015-08-21 10:36:33	comet	공주님의 정원 (KOI11_flower)	C++98	18 / 18	57 ms	3392 KiB

flower

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int> pp;
int n;
int D[13]={0,31,28,31,30,31,30,31,31,30,31,30,31},sum[13];
pp a[100000];
int t(int x,int y){
  return sum[x-1]+y;
}
int main(){
  ios::sync_with_stdio(0);
  for(int i=1;i<13;i++)sum[i]=sum[i-1]+D[i];
  cin>>n;
  int x,y;
  for(int i=0;i<n;i++){
    cin>>x>>y;
    a[i].first=t(x,y);
    cin>>x>>y;
    a[i].second=t(x,y);
  }
  sort(a,a+n);
  priority_queue<int> Q;
  int p=t(3,1),ans=0;
  for(int i=0;i<n;){
    while(i<n&&a[i].first<=p)Q.push(a[i++].second);
    p=Q.top();
    Q.pop();
    ans++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 2 / 2
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9