# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1144633 | ibsha | Broken Device (JOI17_broken_device) | C++20 | 23 ms | 1444 KiB |
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
void Anna(int N, long long X, int K, int P[] ){
set<ll> se;
for (int i = 0; i < K; i++) se.insert(P[i]);
for (int i = 0; i < N; i+=2){
if (se.count(i) or (se.count(i+1)) or !X){
Set(i,0);
Set(i+1,0);
continue;
}
if(X%3 == 0){
Set(i,0);
Set(i+1,1);
}
else if (X%3 == 1){
Set(i,1);
Set(i+1,0);
}
else if (X%3 == 2){
Set(i,1);
Set(i+1,1);
}
X /= 3;
}
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
long long Bruno( int N, int A[] ){
ll ret=0;
ll pw = 1;
for (int i=0;i<N; i+=2){
if (A[i] == A[i+1] and A[i] == 0) continue;
if (A[i] == 0 and A[i+1] == 1);
else if (A[i] == 1 and A[i+1] == 0) ret += pw;
else ret += 2 * pw;
pw *= 3;
}
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |