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 "Anna.h"
#include <vector>
using namespace std;
const int L = 2000;
typedef vector<int> vi;
namespace {
}
int Declare() {
return L;
}
pair<vi, vi> Anna(long long x) {
x--;
int l = 1;
while (x >= l * 2 + 1)
x -= l * 2 + 1, l++;
vi aa(l, 0);
vi bb(l, 0);
if (x <= l)
for (int i = 0; i < x; i++)
aa[i] = 1;
else {
for (int i = 0; i < l; i++)
aa[i] = 1;
for (int i = 0; i < x - l; i++)
bb[i] = 1;
}
return make_pair(aa, bb);
}
#include "Bruno.h"
#include <vector>
using namespace std;
typedef vector<int> vi;
namespace {
}
long long Bruno(vi cc) {
int l = cc.size() / 2, x = 1;
for (int k = 1; k < l; k++)
x += k * 2 + 1;
for (int i = 0; i < l * 2; i++)
if (cc[i] == 1)
x++;
return x;
}
# | 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... |