QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#73889 | #5439. Meet in the Middle | qiuzx | Compile Error | / | / | C++11 | 7.6kb | 2023-01-29 10:12:45 | 2023-01-29 10:12:45 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
answer.code:5:30: warning: ‘-fwhole-program’ is not an option that controls warnings [-Wpragmas] 5 | #pragma GCC diagnostic error "-fwhole-program" | ^~~~~~~~~~~~~~~~~ answer.code:6:30: warning: ‘-fcse-skip-blocks’ is not an option that controls warnings [-Wpragmas] 6 | #pragma GCC diagnostic error "-fcse-skip-blocks" | ^~~~~~~~~~~~~~~~~~~ answer.code:7:30: warning: ‘-funsafe-loop-optimizations’ is not an option that controls warnings [-Wpragmas] 7 | #pragma GCC diagnostic error "-funsafe-loop-optimizations" | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code: In member function ‘void Tree::upd(long long int, long long int)’: answer.code:156:48: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 156 | mxv[x][0]=(it==mxch[x].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:156:48: note: and each type can be converted to the other answer.code:157:48: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 157 | mxv[x][1]=(it==mxch[x].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:157:48: note: and each type can be converted to the other answer.code:167:64: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 167 | mxv[fa[i]][0]=(it==mxch[fa[i]].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:167:64: note: and each type can be converted to the other answer.code:168:64: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 168 | mxv[fa[i]][1]=(it==mxch[fa[i]].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:168:64: note: and each type can be converted to the other answer.code: In member function ‘void Tree::erz(long long int, long long int)’: answer.code:178:48: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 178 | mxv[x][0]=(it==mxch[x].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:178:48: note: and each type can be converted to the other answer.code:179:48: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 179 | mxv[x][1]=(it==mxch[x].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:179:48: note: and each type can be converted to the other answer.code:189:64: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 189 | mxv[fa[i]][0]=(it==mxch[fa[i]].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:189:64: note: and each type can be converted to the other answer.code:190:64: error: operands to ‘?:’ have different types ‘std::pair<long int, long int>’ and ‘const std::pair<long long int, long long int>’ 190 | mxv[fa[i]][1]=(it==mxch[fa[i]].begin())?make_pair(-LINF,-LINF):*(--it); | ~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ answer.code:190:64: note: and each type can be converted to the other