| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1344273 | ramzialoulou | Tiles (BOI24_tiles) | C++20 | 27 ms | 1860 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1009;
int a[N][N];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m;
cin >> n >> m;
vector<int> X(n), Y(n);
for (int i = 0; i < n; i++) {
cin >> X[i] >> Y[i];
}
bool ok = true;
for (int i = 0; i < n; i++) {
int j = (i - 1 + n) % n;
int side = abs(X[i] - X[j]) + abs(Y[i] - Y[j]);
ok &= (side % 2 == 0);
}
cout << (ok ? m : 0) << '\n';
return 0;
}
| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
