| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1083088 | 8pete8 | 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 "Brunolib.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
long long Bruno( int N, int A[] ){
long long ans=0,cur=0;
for(int i=0;i<N;i++){
if(A[i]==1){
if(i+1<N&&A[i+1])ans+=(1LL<<cur),cur++,i++;
else cur++;
}
}
return ans;
}
/*
1
150 588064823 30
133 50 67 111 138 20 28 107 137 70 96 51 80 38 131 61 114 82 66 21 29 60 144 47 139 45 126 76 19 10
*/
#include "Annalib.h"
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<cassert>
#include<unordered_map>
#include <queue>
#include <cstdint>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric>
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-lopps")
void Anna( int N, long long X, int K, int P[] ){
vector<int>can(N,1);
for(int i=0;i<K;i++)can[P[i]]=0;
int cur=0,pos=1;
vector<int>need;
Set(0,0);
for(int i=0;i<60;i++){
long long x=(X&(1LL<<i));
need.pb(!!x);
}
int cnt=0;
for(auto i:need){
if(i==0){
while(pos<N&&can[pos]==0)Set(pos++,0);
if(pos>=N)break;
Set(pos++,1);
if(pos>=N)break;
Set(pos++,0);
}
else{
while(pos+1<N&&(!(can[pos+1]&&can[pos])))Set(pos++,0);
if(pos>=N)break;
Set(pos++,1);
if(pos>=N)break;
Set(pos++,1);
}
}
while(pos<N)Set(pos++,0);
}
/*
1
150 1152921504606846975 37
87 127 68 90 80 147 105 1 71 83 31 65 142 33 112 135 107 139 22 43 132 15 8 93 52 18 95 75 134 9 55 10 48 54 6 121 76
*/