# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
546210 | 2022-04-06T16:19:07 Z | blue | Broken Device 2 (JOI22_device2) | C++17 | 70 ms | 904 KB |
#include "Anna.h" #include <utility> #include <vector> #include <iostream> using namespace std; namespace { int variable_example = 0; using ll = long long; const int bits = 6; const int bs = 3; } int Declare() { return bs * bits; } std::pair<std::vector<int>, std::vector<int> > Anna(long long A) { vector<int> S, T; for(int i = 0; i < bits*bs/2; i++) { S.push_back(0); S.push_back(1); } ll pow2[bits]; pow2[0] = 1; for(int e = 1; e < bits; e++) pow2[e] = 2LL * pow2[e-1]; for(int i = 0; i < bits; i++) { for(int j = 0; j < bs; j++) { T.push_back(bool(A & pow2[i])); } } for(int i = 0; i < bits*bs; i++) cerr << S[i]; cerr << '\n'; for(int i = 0; i < bits*bs; i++) cerr << T[i]; cerr << '\n'; return make_pair(S, T); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 516 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 70 ms | 904 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |