# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902657 | nguyentunglam | Broken Device (JOI17_broken_device) | C++17 | 44 ms | 2924 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;
namespace {
mt19937 rng(1);
}
void Anna( int n, long long x, int k, int p[] ){
vector<bool> broken(n);
vector<int> order(n);
for(int i = 0; i < n; i++) order[i] = i;
shuffle(order.begin(), order.end(), rng);
// for(int i = 0; i < n; i++) cout << order[i] << " "; cout << endl;
for(int i = 0; i < n; i++) broken[i] = 0;
for(int i = 0; i < k; i++) broken[p[i]] = 1;
for(int i = 0, pre = -1, j = 59; i < n; i++) {
if (broken[order[i]] || j < 0) {
Set(order[i], 0);
continue;
}
bool a = x >> j & 1;
bool b = i - pre & 1;
if (a == b) {
pre = i;
j--;
Set(order[i], 1);
}
else Set(order[i], 0);
}
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
namespace {
mt19937 rng(1);
}
long long Bruno( int n, int a[] ){
long long x = 0;
vector<int> order(n);
for(int i = 0; i < n; i++) order[i] = i;
shuffle(order.begin(), order.end(), rng);
// for(int i = 0; i < n; i++) cout << order[i] << " "; cout << endl;
for(int i = 0, pre = -1, j = 59; i < n && j >= 0; i++) if (a[order[i]]) {
bool bit = i - pre & 1;
if (bit) x |= (1LL << j);
j--;
pre = i;
}
cout << "answer :" << x << endl;
return x;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |