Submission #438359

#TimeUsernameProblemLanguageResultExecution timeMemory
438359OzyBit Shift Registers (IOI21_registers)C++17
10 / 100
1 ms204 KiB
#include "registers.h" #include <bits/stdc++.h> using namespace std; #define rep(i,a,b) for (int i = (a); i <= (b); i++) #define repa(i,a,b) for (int i = (a); i >= (b); i--) #define lli long long int #define debug(a) cout << #a << " = " << a << endl #define debugsl(a) cout << #a << " = " << a << ", " vector<bool> borra; void construct_instructions(int s, int n, int k, int q) { borra.resize(2000,false); rep(i,0,k-1) borra[i] = true; append_right(2,0,k); append_print(2); append_store(17,borra); append_print(17); append_and(1,0,17); append_print(1); append_right(17,17,1); append_print(17); if (k == 2) { append_right(3,1,1); append_print(3); append_right(4,2,1); append_print(4); append_and(0,3,4); append_print(0); append_left(0,0,1); append_print(0); append_and(1,1,17); append_print(1); append_and(2,2,17); append_print(2); append_xor(5,3,4); append_print(5); append_not(6,5); append_print(6); append_not(7,3); append_print(7); append_not(8,4); append_print(8); append_and(9,1,7); append_print(9); append_and(10,2,8); append_print(10); append_or(9,10,9); append_print(9); append_and(11,5,9); append_print(11); append_or(0,0,11); append_and(12,1,2); append_and(12,12,6); append_and(12,12,17); append_print(12); append_or(0,0,12); } else if (k == 1){ append_and(0,2,1); return; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...