# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13473 | drcotr0623 | 공주님의 정원 (KOI11_flower) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
#include<vector>
using namespace std;
typedef struct day{
int fd;
int ld;
}day;
day data[100000];
int n, i, j, fd=60, ld=335, count, t1, t2, t3, t4;
int change(int x, int y){
if(x==1) return y;
else if(x==2) return 31+y;
else if(x==3) return 59+y;
else if(x==4) return 90+y;
else if(x==5) return 120+y;
else if(x==6) return 151+y;
else if(x==7) return 181+y;
else if(x==8) return 212+y;
else if(x==9) return 243+y;
else if(x==10) return 273+y;
else if(x==11) return 304+y;
else return 334+y;
}
void mSort(int x, int y){
if(x>=y) return;