0_0_23257954_3702.cpp: In member function 'bool OneTimeTask::operator<(const OneTimeTask&) const':
0_0_23257954_3702.cpp:17:23: error: 'const struct OneTimeTask' has no member named 'end'
return end1 < other.end;
^
0_0_23257954_3702.cpp: In function 'bool input()':
0_0_23257954_3702.cpp:37:48: error: 'struct OneTimeTask' has no member named 'end'
scanf("%d%d", &onetask[i].start, &onetask[i].end);
^
0_0_23257954_3702.cpp:41:56: error: 'struct RepeatTask' has no member named 'end'
scanf("%d%d%d", &repeattask[i].start, &repeattask[i].end, &repeattask[i].interval);
^
0_0_23257954_3702.cpp: In function 'void solve()':
0_0_23257954_3702.cpp:53:85: error: 'struct OneTimeTask' has no member named 'end'
if (onetask[i].start >= onetask[i - 1].start && onetask[i].start < onetask[i - 1].end) {
^
0_0_23257954_3702.cpp:60:22: error: 'struct RepeatTask' has no member named 'end'
if (repeattask[i].end - repeattask[i].start > repeattask[i].interval) {
^
0_0_23257954_3702.cpp:71:29: error: 'struct RepeatTask' has no member named 'end'
int end1 = repeattask[i].end;
^
0_0_23257954_3702.cpp:75:51: error: 'struct OneTimeTask' has no member named 'end'
if (start > 1000000 || start > onetask[n - 1].end) break;
^
0_0_23257954_3702.cpp:77:59: error: 'struct OneTimeTask' has no member named 'end'
if ((start >= onetask[j].start && start < onetask[j].end) || (end1 > onetask[j].start && end1 <= onetask[j].end)) flag = false;
^
0_0_23257954_3702.cpp:77:114: error: 'struct OneTimeTask' has no member named 'end'
if ((start >= onetask[j].start && start < onetask[j].end) || (end1 > onetask[j].start && end1 <= onetask[j].end)) flag = false;
^
0_0_23257954_3702.cpp:91:29: error: 'struct RepeatTask' has no member named 'end'
int end1 = repeattask[i].end;
^
0_0_23257954_3702.cpp:96:28: error: 'struct OneTimeTask' has no member named 'end'
tmp.start = start, tmp.end = end1;
^
0_0_23257954_3702.cpp:109:78: error: '__gnu_cxx::__alloc_traits<std::allocator<OneTimeTask> >::value_type' has no member named 'end'
if (tasks[i].start >= tasks[i - 1].start && tasks[i].start < tasks[i - 1].end) {
^
|
