Submission #1866736


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int H, W;
long long ans = 1e18;

void solve() {
	int h = H / 2;
	for (int i = 1; i < W; ++i) {
		// H
		long long s1 = 1LL * i * H;
		long long s2 = 1LL * (W - i) * h;
		long long s3 = 1LL * (W - i) * (H - h);
		long long cur = 0;
		cur = max(cur, abs(s1 - s2));
		cur = max(cur, abs(s2 - s3));
		cur = max(cur, abs(s3 - s1));
		ans = min(ans, cur);
	}
	if (W % 3 == 0) ans = 0;
	else ans = min(ans, (long long)H);
}

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> H >> W;
	solve();
	swap(H, W);
	solve();
	cout << ans << endl;
}

Submission Info

Submission Time
Task C - Chocolate Bar
User cheater2k
Language C++14 (GCC 5.4.1)
Score 400
Code Size 627 Byte
Status AC
Exec Time 2 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 5
AC × 20
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
0_04.txt AC 2 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 2 ms 256 KB
1_06.txt AC 2 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 2 ms 256 KB
1_10.txt AC 2 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 2 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB