# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124635 | johutha | CATS (NOI14_cats) | C++14 | 1547 ms | 8260 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 <vector>
#include <iostream>
#define int int64_t
using namespace std;
struct solver
{
int x, l, n;
vector<int> s1;
vector<int> s2;
void calc()
{
s1.resize(2, 0);
s2.resize(2, 0);
int ctr = 0;
while (x > 0)
{
if (s1.size() == 0) s1.push_back(ctr);
s2.push_back(s1.back());
s1.pop_back();
ctr += 1; ctr %= 2;
for (int &i : s1)
{
i = i ^ 1;
}
if (s2.back() > l)
{
# | 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... |