# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1235400 | guanex | Broken Device (JOI17_broken_device) | C++20 | 22 ms | 1572 KiB |
#include "Annalib.h"
#include<bits/stdc++.h>
using namespace std;
void Anna( int N, long long X, int K, int P[] ){
vector<int> vec;
for(int i = 0; i < 61; ++i){
if(X & (1LL << i)){
vec.push_back(1);
}else{
vec.push_back(0);
}
}
while((int)vec.size() >= 1 && vec[(int)vec.size()-1] == 0){
vec.pop_back();
}
vector<int> message(N, 1);
for(int i = 0; i < K; ++i){
message[P[i]] = 0;
}
int j = 0;
for(int i = 0; i < N; ++i){
if(vec[j] == 0){
if(i == N-1){
Set(i, 0);
continue;
}
if(message[i] == 1 && message[i+1] == 1){
Set(i, 1);
Set(i+1, 1);
i++;
j++;
continue;
}else{
Set(i, 0);
continue;
}
}else{
if(message[i] == 1){
Set(i, 1);
if(i < N-1)
Set(i+1, 0);
j++;
i++;
continue;
}else{
Set(i, 0);
continue;
}
}
}
}
#include "Brunolib.h"
#include<bits/stdc++.h>
using namespace std;
long long Bruno( int N, int A[] ){
long long ans = 0;
long long pot = 1;
for(int i = 0; i < N; ++i){
if(A[i] == 1){
if(A[i+1] == 1){
i++;
}else{
ans += pot;
}
pot *= 2;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |