Submission #829532

#TimeUsernameProblemLanguageResultExecution timeMemory
829532fatemetmhrBit Shift Registers (IOI21_registers)C++17
0 / 100
1 ms212 KiB
// Be Name Khoda // #include "registers.h" #include <bits/stdc++.h> using namespace std; #define MAX(x, y) ((x) > (y) ? (x) : (y)) #define MIN(x, y) ((x) < (y) ? (x) : (y)) #define debug(x) cerr << "(" << (#x) << "): " << (x) << endl; #define all(x) (x).begin(), (x).end() #define fi first #define se second #define pb push_back #define mp make_pair typedef long long ll; const int maxn5 = 5e4 + 10; const int ssq = 3200; const int lg = 25; void construct_instructions(int s, int n, int k, int q) { vector <bool> a; a.resize(2000); fill(all(a), 0); a[0] = a[1] = 1; append_move(1, 0); append_right(2, 0, k); if(k == 1){ append_and(0, 1, 2); return; } append_store(10, a); append_and(1, 1, 10); append_and(3, 1, 2); append_xor(1, 1, 3); append_xor(2, 2, 3); append_not(4, 1); append_and(4, 4, 2); append_right(4, 4, 1); append_left(4, 4, 1); append_right(5, 4, 1); append_or(4, 4, 5); append_not(4, 4); append_and(2, 2, 4); append_not(4, 2); append_and(4, 4, 1); append_right(4, 4, 1); append_left(4, 4, 1); append_right(5, 4, 1); append_or(4, 4, 5); append_not(4, 4); append_and(1, 1, 4); append_add(0, 1, 2); append_add(0, 0, 3); }
#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...