# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
855846 | 2023-10-02T03:13:37 Z | Trisanu_Das | Chessboard (IZhO18_chessboard) | C++17 | 48 ms | 4440 KB |
#include <iostream> #include <algorithm> #include <climits> #define int long long using namespace std; int f(int s, int a) { a %= s * 2; return min(a, s * 2 - a); } signed main() { int n, k, temp, ans; cin >> n >> k; int x1[n], y1[n], x2[n], y2[n]; for (int i = 0; i < k; i++){ cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; --x1[i]; --y1[i]; } ans = LLONG_MAX; for (int i = 1; i < n; i++) if (n % i == 0) { k = (n / i) * (n / i) / 2 * i * i; for (int j = 0; j < k; j++) temp += (f(i, x2[j]) - f(i, x1[j])) * (f(i, y2[j]) - f(i, y1[j])); ans = min(ans, min(temp, n * n - temp)); } cout << ans << '\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 48 ms | 4440 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 344 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 344 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 48 ms | 4440 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |