# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
126557 | baluteshih | Broken Device (JOI17_broken_device) | C++14 | 43 ms | 3568 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>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
void Anna( int N, long long X, int K, int P[] )
{
const ll XOR=165438486768787;
X^=XOR;
bitset<150> bye,use;
for(int i=0;i<K;++i)
bye[P[i]]=1;
for(ll i=0,nw=1;i<N&&nw<=X;++i)
if(nw&X)
{
if(i+1<N&&!bye[i]&&!bye[i+1])
use[i]=use[i+1]=1,++i,nw<<=1;
}
else
if(!bye[i])
use[i]=1,++i,nw<<=1;
for(int i=0;i<N;++i)
Set(i,use[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
long long Bruno(int N,int A[])
{
const ll XOR=165438486768787;
ll ans=0;
for(ll i=0,nw=1;i<N;++i)
if(A[i])
{
if(A[i+1]) ans|=nw;
nw<<=1,++i;
}
return ans^XOR;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |