# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
159558 | geon040702 | 공주님의 정원 (KOI11_flower) | C++14 | 47 ms | 2168 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 <bits/stdc++.h>
using namespace std;
pair<int, int> Data[100010];
int main(void)
{
int N, i, j;
scanf("%d", &N);
for(i=0;i<N;i++) {
int sm, sd, lm, ld;
scanf("%d %d %d %d", &sm, &sd, &lm, &ld);
Data[i].first = sm * 100 + sd;
Data[i].second = lm * 100 + ld;
}
sort(Data, Data+N);
int date = 301, flag, temp, ans;
i=-1;
flag = temp = ans = 0;
while(date <= 1130 && i < N) {
flag = 0;
i++;
for(j=i;j<N;j++) {
if(Data[j].first > date) {
break;
}
if(temp < Data[j].second) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |