# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
561520 | amunduzbaev | Broken Device (JOI17_broken_device) | C++17 | 1 ms | 520 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 "bits/stdc++.h"
using namespace std;
void Anna(int n, long long x, int k, int p[]){
vector<int> used(n);
for(int i=0;i<k;i++) used[p[i]] = 1;
int bit = -1;
for(int i=1;i<n;i++){
if(!used[i] && !used[i-1]){
used[i] = used[i-1] = 1;
bit = i; break;
}
}
vector<int> pos;
for(int i=1;i<k;i++){
pos.push_back(p[i] - p[i-1] - 1);
}
pos.push_back(p[0]);
pos.push_back(n - p[k - 1] - 1);
int b = -1;
for(int i=1;i<=2;i++){
int cnt = 0;
for(auto x : pos){
cnt += (x / (i + 1));
}
if(cnt >= 60 / i){
b = i;
}
}
if(!(~b)){
for(int i=0;i<n;i++) Set(i, 0);
assert(false);
}
for(int i=0;i<k;i++) Set(p[i], 0);
if(b > 1) Set(bit - 1, 1), Set(bit, 1);
else Set(bit - 1, 1), Set(bit, 0);
int l = 0;
for(int i=0;i<60;i+=b){
while(l<n){
int ok = 1;
for(int k=0;k<=b;k++){
if(l < k) ok = 0;
else if(used[l - k]) ok = 0;
}
if(ok) break;
l++;
}
//~ assert(l<n);
for(int j=b - 1;~j;j--){
Set(l - j, x & 1);
used[l - j] = 1;
x >>= 1;
}
used[l - b] = 1;
Set(l - b, 1);
}
for(int i=0;i<n;i++){
if(!used[i]){
Set(i, 0);
}
}
}
/*
2
150 14 1
2
150 9 2
0 1
*/
#include "Brunolib.h"
#include "bits/stdc++.h"
using namespace std;
long long Bruno( int n, int a[] ){
int b = 1, l = -1;
for(int i=0;i<n;i++){
if(!a[i]) continue;
if(a[i]){
b += a[i + 1];
l = i + 2;
break;
}
}
//~ assert(~l);
int bit = 0;
long long x = 0;
for(int i=l;i<n;i++){
if(a[i]){
for(int j=i+1;j<=i+b && bit < 60;j++){
x |= ((a[j] * 1ll) << bit);
bit++;
}
i += b;
}
}
//~ cout<<x<<endl;
return x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |