# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1083133 | 8pete8 | Broken Device (JOI17_broken_device) | C++17 | 36 ms | 2868 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<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=0;
vector<int>need;
for(int i=0;i<60;i++){
long long x=(X&(1LL<<i));
need.pb(!!x);
}
int cnt=0,last=-1;
for(int j=0;j<N;j++){
if(can[j]==0||cur>=need.size())Set(j,0);
else if(can[j]){
if(need[cur]){
if(j%2==1)Set(j,1),cur++;
else Set(j,0);
}
else{
if(j%2==0)Set(j,1),cur++;
else Set(j,0);
}
}
}
}
/*
1
150 576460752303423487 35
107 9 73 83 134 28 69 60 8 36 55 79 58 18 0 33 149 130 104 63 30 80 96 48 144 133 19 74 125 11 52 142 120 112 56
*/
#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,last=-1;
for(int i=0;i<N;i++){
if(A[i]==1){
if(i%2==1){
ans+=(1LL<<cur);
}
cur++;
last=i;
}
}
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
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |