# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236754 | meatrow | Remittance (JOI19_remittance) | C++17 | 446 ms | 52192 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.
#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
ll div(vector<ll>& num, int n) {
ll res = 0;
for (int i = 35; i >= 0; i--) {
vector<ll> den(num.size());
fill(den.begin() + i, den.begin() + n + i, 1);
bool ok = true;
for (int j = num.size() - 1; j >= 0; j--) {
if (num[j] > den[j]) {
break;
}
if (num[j] < den[j]) {
ok = false;
}
}
if (!ok) continue;
res += 1LL << i;
for (int j = 0; j + 1 < num.size(); j++) {
num[j] -= den[j];
if (num[j] < 0) {
num[j] += 2;
num[j + 1]--;
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... |