| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 15435 | myungwoo | 로봇 심판의 님 게임 (kriii3_F) | C++14 | 2000 ms | 3136 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;
#define pb push_back
typedef long long lld;
int N, M, K;
lld A[21], G[21];
lld lcmP[1<<16], lcmQ[1<<16]; int bitcnt[1<<16];
bool overP[1<<16], overQ[1<<16];
vector <lld> P, Q;
map <lld, lld> container;
lld gcd(lld a, lld b){ return b ? gcd(b, a%b) : a; }
inline lld invalid(lld n)
{
bool exists = container.count(n);
lld &ret = container[n];
if (exists) return ret;
ret = n;
for (int msk1=0;msk1<(1<<N);msk1++){
if (overP[msk1]) continue;
if (msk1) ret += (bitcnt[msk1] & 1 ? 1 : -1) * n / lcmP[msk1];
for (int msk2=0;msk2<(1<<M);msk2++){
if (overQ[msk2]) continue;
lld g = gcd(lcmP[msk1], lcmQ[msk2]);
lld lcm = lcmP[msk1];
if (lcm / g > n / lcmQ[msk2]) continue;
lcm = lcm / g * lcmQ[msk2];
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||