# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1125286 | Icelast | L-triominoes (CEOI21_ltriominoes) | C++20 | 168 ms | 145984 KiB |
#include <iostream>
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll maxn = 5*1e5+5, INF = 4e18+9;
void solve(){
ll W, L, k;
cin >> W >> L >> k;
if((W*L - k)%3 != 0){
cout << "NO";
return;
}
if(k == 0){
if(W > 1 && L > 1 && W*L%6 == 0){
cout << "YES";
}else{
cout << "NO";
}
return;
}
struct point{
ll x, y;
};
vector<point> a(k+1);
for(int i = 1; i <= k; i++){
cin >> a[i].x >> a[i].y;
}
if(W > L){
swap(W, L);
for(int i = 1; i <= k; i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |