| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1077295 | veehj | Broken Device (JOI17_broken_device) | C++17 | 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 "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define sz(a) (ll) a.size()
#define all(x) (x).begin(), (x).end()
void Anna( int N, long long X, int K, int P[] ){
set<int> s={};
stack<ll> st;
while(X!=0){
st.push(X%3);
X/=3;
}
for(int i=0; i<K; i++) s.insert(P[i]);
for(int i=0; i<N; i+=2){
if(s.count(i) || (i+1<N && s.count(i+1)) || st.size()==0){
Set(i, 0);
Set(i+1, 0);
continue;
}
if(st.top()==0){
Set(i, 0);
Set(i+1, 1);
}
if(st.top()==1){
Set(i, 1);
Set(i+1, 0);
}
if(st.top()==2){
Set(i, 1);
Set(i+1, 1);
}
st.pop();
}
}