# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70155 | Just_Solve_The_Problem | Broken Device (JOI17_broken_device) | C++11 | 76 ms | 12992 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>
#include "Annalib.h"
//#include "grader.cpp"
#define pb push_back
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
vector < int > used(N, 0);
vector < int > u(N, 0);
for (int i = 0; i < K; i++) {
used[P[i]] = 1;
}
vector < int > p;
for (int i = 0; i < 61; i++) {
p.pb((X >> i) & 1);
}
vector < int > vec;
int res = 1;
for (int i = 1; i < 61; i++) {
if (p[i] != p[i - 1]) {
vec.pb(res);
res = 0;
}
res++;
}
vec.pb(res);
int cur = 0;
for (int i = 1; i < K && cur < vec.size(); i++) {
if (P[i] - 1 - P[i - 1] >= vec[cur]) {
for (int j = P[i - 1] + 1; j < P[i - 1] + 1 + vec[cur]; j++) {
u[j] = 1;
}
cur++;
P[i - 1] += 1 + vec[cur];
i--;
}
}
for (int i = 0; i < N; i++) {
Set(i, u[i]);
}
}
#include <bits/stdc++.h>
#include "Brunolib.h"
//#include "grader.cpp"
#define ll long long
#define pb push_back
using namespace std;
long long Bruno( int N, int A[] ){
ll ret = 0;
int cur = 60;
vector < int > vec;
int res = 0;
for (int i = 0; i < N; i++) {
if (A[i] == 1) {
res++;
} else {
if (res) {
vec.pb(res);
}
res = 0;
}
}
if (res)
vec.pb(res);
reverse(vec.begin(), vec.end());
for (int i = 0; i < vec.size(); i++) {
if (i & 1) {
for (int j = 0; j < vec.size(); j++) {
ret |= (1LL << cur);
cur--;
}
} else {
cur -= vec.size();
}
}
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |