| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 231254 | bensonlzl | Broken Device (JOI17_broken_device) | C++14 | 0 ms | 0 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"
using namespace std;
int usable[155], ans[155];
void Anna(int N, long long X, int K, int P[]){
mt19937 rng(8537295);
vector<int> v;
for (int i = 0; i < N; ++i){
usable[i] = 1;
ans[i] = 0;
v.push_back(i);
}
shuffle(v.begin(),v.end(),rng);
for (int i = 0; i < K; ++i){
usable[P[i]] = 0;
}
for (int i = 0; i < N; i += 2){
if (usable[v[i]] && usable[v[i+1]]){
if (X%3 == 0){
ans[v[i]] = 0;
ans[v[i+1]] = 1;
}
else if (X%3 == 0){
ans[v[i]] = 1;
ans[v[i+1]] = 0;
}
else{
ans[v[i]] = 1;
ans[v[i+1]] = 1;
}
}
else{
ans[v[i]] = ans[v[i+1]] = 0;
}
}
for (int i = 0; i < N; ++i){
Set(i,ans[i]);
}
}
#include <bits/stdc++.h>
#include "Annalib.h"
using namespace std;
long long Bruno(int N, int A[]){
mt19937 rng(8537295);
ll ans = 0;
vector<int> v;
for (int i = 0; i < N; ++i){
v.push_back(i);
}
shuffle(v.begin(),v.end(),rng);
ll coeff = 1;
for (int i = 0; i < N; i += 2){
if (A[v[i]] || A[v[i+1]]){
if (A[v[i]] && !A[v[i+1]]){
ans += 1*coeff;
}
else if (A[v[i]] && A[v[i+1]]){
ans += 2*coeff;
}
coeff *= 3;
if (coeff > 1e18) break;
}
}
return ans;
}