Submission #3603196


Source Code Expand

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

int main()
{
	long long H, W;

	cin >> H >> W;

	long long ans = 0;
	if( H % 3 == 0 || W % 3 == 0 ) {
	}
	else {
		long long h = H * W / 3 / W;
		long long ans1 = abs( h * W - (H - h) * (W / 2) );
		long long rest = H * W - h * W - (H - h) * (W / 2);
		ans1 = max( ans1, max( abs( h * W - rest ), abs( abs( (H - h) * (W / 2) - rest ) ) ) );
		while( 1 ) {
			h++;
			long long nextans = abs( h * W - (H - h) * (W / 2) );
			rest = H * W - h * W - (H - h) * (W / 2);
			nextans = max( nextans, max( abs( h * W - rest ), abs( abs( (H - h) * (W / 2) - rest ) ) ) );
			if( nextans > ans1 ) {
				break;
			}
			ans1 = min( ans1, nextans );
		}
		long long w = H * W / 3 / H;
		long long ans2 = abs( w * H - (W - w) * (H / 2) );
		rest = H * W - w * H - (W - w) * (H / 2);
		ans2 = max( ans2, max( abs( w * H - rest ), abs( abs( (W - w) * (H / 2) - rest ) ) ) );
		while( 1 ) {
			w++;
			long long nextans = abs( w * H - (W - w) * (H / 2) );
			rest = H * W - w * H - (W - w) * (H / 2);
			nextans = max( nextans, max( abs( w * H - rest ), abs( abs( (W - w) * (H / 2) - rest ) ) ) );
			if( nextans > ans2 ) {
				break;
			}
			ans2 = min( ans2, nextans );
		}
		h = H / 3;
		long long ans3 = abs( h * W - (h + 1) * W );
		w = W / 3;
		long long ans4 = abs( w * H - (w + 1) * H );
		ans = min( ans1, min( ans2, min( ans3, ans4 ) ) );
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Submission Time
Task C - Chocolate Bar
User forest3
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1471 Byte
Status AC
Exec Time 1 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 1 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 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB
1_10.txt AC 1 ms 256 KB
1_11.txt AC 1 ms 256 KB
1_12.txt AC 1 ms 256 KB
1_13.txt AC 1 ms 256 KB
1_14.txt AC 1 ms 256 KB