# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100104 | cheeheng | Broken Device (JOI17_broken_device) | C++14 | 69 ms | 3072 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 Set( int pos, int bit );
void Anna( int N, long long X, int K, int P[] ){
for(int i = 0; i < 60; i ++){
if(binary_search(P, P+K, i)){
Set(i+75, (X&(1LL << i)) != 0);
Set(i, 0);
}else{
Set(i, (X&(1LL << i)) != 0);
Set(i+75, 0);
}
}
for(int i = 60; i < 75; i ++){
Set(i, 0);
}
for(int i = 135; i < 150; i ++){
Set(i, 0);
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
long long X = 0;
for(int i = 0; i < 60; i ++){
if(A[i] || A[i+75]){
X |= (1LL<<i);
}
}
//printf("%lld\n", X);
return X;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |