Submission #1838235
Source Code Expand
#include<iostream> #include<string> #include<vector> #include<utility> #include<queue> #include<algorithm> #include<cmath> #include<cstdio> #include<cstring> #include<cstdlib> #include<complex> #define INF 2147483647 #define llINF 9223372036854775807 #define pb push_back #define mp make_pair #define F first #define S second #define ll long long using namespace std; int main(){ int n,m; cin>>n>>m; int a,b; a=min(n,m); b=max(n,m); ll ma=0,mi=0,mid=0; ll ma2,mi2,mid2; ll mama; bool flag=false; int i=1; if(a==1){ ma=1;mi=0; }else if(a%3==0||b%3==0){ ma=0;mi=0; }else if(a%2==0){ int c=a/2; while(1){ if((ll)c*i>=(ll)(b-i)*a){ ma2=(c)*i;mi2=(b-i)*a; break; } ma=(ll)(b-i)*a; mi=(ll)c*i; i++; } }else if(b%2==0){ int c=b/2; while(1){ if((ll)c*i>=(ll)(a-i)*b){ ma2=c*i;mi2=(a-i)*b; break; } ma=(ll)(a-i)*b; mi=(ll)c*i; i++; } }else{ int c=a/2; while(1){ if((ll)c*i>=(ll)(b-i)*a){ break; } ma=(ll)(b-i)*a; mid=(ll)(c+1)*i; mi=(ll)c*i; if(mid>ma){ flag=true; break; } i++; } } if(flag){ cout<<i<<endl; } else{ ll ans=0; if(ma2-mi2<ma-mi)ans=ma2-mi2; else ans=ma-mi; //cout<<ma<<" "<<mi<<endl; cout<<(ll)ans<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Chocolate Bar |
User | shi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1437 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||
Status |
|
|
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 | WA | 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 | WA | 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 | WA | 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 |