Submission #1317883

#TimeUsernameProblemLanguageResultExecution timeMemory
1317883dostsBroken Device (JOI17_broken_device)C++20
0 / 100
1 ms332 KiB
#include "Annalib.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,popcnt,lzcnt") #define int long long #define vi vector<int> #define pii pair<int,int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; void Anna( signed N, long long X, signed K, signed P[] ){ vi safe(N,1); for (int i=0;i<K;i++) safe[P[i]] = 0; int curbit = 59; for (int i = 0;i<N;i+=2) { if (!safe[i+1]) { Set(i,0); Set(i+1,0); continue;; } if (curbit >= 0) Set(i,X&(1LL<<curbit)); else Set(i,0); Set(i+1,1); curbit--; continue; } }
#include "Brunolib.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,popcnt,lzcnt") #define int long long #define vi vector<int> #define pii pair<int,int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; long long Bruno( signed N, signed A[] ){ int curbit = 59; int X = 0; for (int i = 0;i<N;i+=2) { if (!A[i+1]) continue; if (curbit == -1) continue; X+=(1LL<<curbit)*A[i]; curbit--; } return X; }
#Verdict Execution timeMemoryGrader output
Fetching results...