# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
340676 | wwdd | Red-blue table (IZhO19_stones) | C++14 | 55 ms | 9196 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pl;
int main() {
ll N;
cin >> N;
while(N--) {
ll n,m;
cin >> n >> m;
pl ha = {0,0},va = {0,0};
for(int i=0;i<(m/2+1);i++) {
ll tot = (m-(m/2+1))*(n-i);
ll ro = (n/2+1)-i;
ll su = 0;
if(ro <= 0) {
su = m;
} else {
su = min(tot/ro,m);
}
if(su+n-i > ha.second) {
ha = {i,su+n-i};
}
}
for(int i=0;i<(n/2+1);i++) {
ll tot = (n-(n/2+1))*(m-i);
ll ro = (m/2+1)-i;
ll su = 0;
if(ro <= 0) {
su = n;
# | 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... |