제출 #920338

#제출 시각아이디문제언어결과실행 시간메모리
920338vjudge1L-triominoes (CEOI21_ltriominoes)C++17
0 / 100
1 ms600 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cassert> #include <cstring> #warning That's the baby, that's not my baby typedef long long ll; int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(0); int n, m, k; std::cin >> m >> n >> k; std::vector<std::pair<int, int>> v(k); for (auto &[x, y] : v) { std::cin >> y >> x; x = n - x + 1; } if (k == 0) { if ((ll) n * m % 2 == 0) { std::cout << "YES"; } else { std::cout << "NO"; } return 0; } return 0; }

컴파일 시 표준 에러 (stderr) 메시지

ltrominoes.cpp:6:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    6 | #warning That's the baby, that's not my baby
      |  ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...