제출 #1895

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1895	2013-07-19 08:39:18	alephnull	공주님의 정원 (KOI11_flower)	C++98	18 / 18	105 ms	2380 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 <cstdio>
#include <utility>
using namespace std;
int main() {
  int m[13] = { 0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
  int n;
  scanf("%d", &n);
  pair<int, int> p[13][32];
  for(int i=1;i<=12;i++)
    for(int j=1;j<=31;j++)
      p[i][j]=make_pair(1,1);
  int a[n], b[n], c[n], d[n];
  for (int i = 0; i < n; i++)
    scanf("%d %d %d %d", a + i, b + i, c + i, d + i);
  for(int i=0;i<n;i++){
    for(int j=1;j<=12;j++){
      for(int k=1;k<=m[j];k++){
        if(j<a[i])break;
        if(j==a[i]&&k<b[i])continue;
        pair<int, int> tmp=make_pair(c[i],d[i]);
        if(p[j][k]<tmp)p[j][k]=tmp;
      }
    }
  }
  int ans=0;
  int x=3,y=1;
  //printf("%d %d\n",x,y);
  while(make_pair(x,y)<make_pair(11,31)){
    if(ans>365){ans=0;break;}
    ans++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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