Submission #231501

#TimeUsernameProblemLanguageResultExecution timeMemory
231501cstuartBroken Device (JOI17_broken_device)C++17
8 / 100
49 ms3328 KiB
#include <bits/stdc++.h> using namespace std; #include "Annalib.h" void Anna (int N, long long X, int K, int P[]) { bool func[N+5]; int b = 0; string rep = "011100110001010001010000100100101101110000101011110011011001100111001000111001100111110001100110011111000011101101110010010001111110110001100010001101"; memset(func, 1, sizeof func); for (int i = 0; i < K; i++) func[P[i]] = 0; for (int i = 0; i < N; i++) { if (b == 60) Set(i, 0); else if (!func[i]) Set(i, 0); else if (((1ll << b) & X) == 0 && rep[i % (int)rep.length()] == '1') Set(i, 0); else if (((1ll << b) & X) > 0 && rep[i % (int)rep.length()] == '0') Set(i, 0); else { Set(i, 1); b++; } } }
#include <bits/stdc++.h> using namespace std; #include "Brunolib.h" long long Bruno (int N, int A[]) { string rep = "011100110001010001010000100100101101110000101011110011011001100111001000111001100111110001100110011111000011101101110010010001111110110001100010001101"; long long V = 0; int b = 0; for (int i = 0; i < N; i++) { if (A[i] == 1) { if (rep[i % (int)rep.length()] == '1') V += (1ll << b); b++; } } return V; }
#Verdict Execution timeMemoryGrader output
Fetching results...