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 <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
namespace {
int variable_example = 0;
}
int Declare() {
variable_example++;
return 180;
}
std::pair<std::vector<int>, std::vector<int> > Anna(long long A) {
vector<int> X, Y;
for(int i = 0; i < 60; i++){
for(int j = 0; j < 3; j++) X.push_back((A >> i) & 1);
}
for(int i = 0; i < 180; i++){
Y.push_back((i + 1) % 2);
}
return make_pair(X, Y);
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<lint, lint>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
namespace {
int variable_example = 0;
}
long long Bruno(std::vector<int> u) {
int ptr = 0;
int sum = 0;
vector<int> ans;
while(ptr < sz(u)){
int k = sum - (sum % 3 + 3) % 3;
while(ptr < sz(u)){
sum += u[ptr++] * 2 - 1;
if(sum >= k + 3) break;
if(sum <= k - 2) break;
}
if(sum >= k + 3) ans.push_back(1);
else if(sum <= k - 2) ans.push_back(0);
}
assert(sz(ans) == 60);
lint dap = 0;
for(int i = 0; i < 60; i++) if(ans[i]) dap |= (1ll << i);
return dap;
}
Compilation message (stderr)
Bruno.cpp:11:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
11 | int variable_example = 0;
| ^~~~~~~~~~~~~~~~
# | 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... |