# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
256102 | karma | Red-blue table (IZhO19_stones) | C++14 | 44 ms | 2296 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>
#define pb emplace_back
#define ll long long
#define fi first
#define se second
#define mp make_pair
//#define int int64_t
using namespace std;
const int N = int(1e3) + 7;
const int inf = 1e9 + 1;
typedef pair<ll, ll> pii;
int n, m, nr, nc, r, c, res;
void solve() {
cin >> n >> m;
res = m, r = 0, c = m;
nr = m / 2 + 1, nc = n / 2 + 1;
for(int l, h, mid, i = 1; i <= n; ++i) {
l = 0, h = m;
while(l <= h) {
mid = l + h >> 1;
int x = min(mid, m - nr);
int tmp = x * (n - nc);
if(nr - m + mid <= 0) l = mid + 1;
else if(tmp / (nr - m + mid) + (n - nc) >= i) l = mid + 1;
else h = mid - 1;
}
if(i + h > res) res = i + h, r = i, c = h;
Compilation message (stderr)
# | 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... |