# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
556422 | blue | Broken Device (JOI17_broken_device) | C++17 | 280 ms | 2704 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 "Annalib.h"
#include <vector>
#include <iostream>
using namespace std;
namespace
{
using vi = vector<int>;
using ll = long long;
}
void Anna( int N, long long X, int K, int P[] ){
vi bit(60);
for(int i = 0; i < 60; i++)
{
bit.push_back(X%2);
X /= 2;
}
vi bad(N, 0);
for(int i = 0; i < K; i++)
bad[P[i]] = 1;
int cb = 0;
vi encoded(N, 0);
for(int i = 0; i < N; i++)
cerr << bad[i];
cerr << "\n";
for(int i = 0; i+1 < N && cb < 60; i++)
{
if(!bad[i] && !bad[i+1])
{
encoded[i] = 1;
encoded[i+1] = bit[cb];
cb++;
}
}
for(int i = 0; i < N; i++)
Set(i, encoded[i]);
}
#include "Brunolib.h"
#include <vector>
using namespace std;
namespace
{
using ll = long long;
using vi = vector<int>;
}
long long Bruno( int N, int A[] )
{
ll wt = 1;
ll ans = 0;
for(int i = 0; i+1 < N; i++)
{
if(A[i] == 1)
{
ans += wt*A[i+1];
wt = wt+wt;
i++;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |