Submission #1174348

#TimeUsernameProblemLanguageResultExecution timeMemory
1174348PagodePaivaBit Shift Registers (IOI21_registers)C++20
21 / 100
0 ms328 KiB
#include "registers.h" #include <bits/stdc++.h> using namespace std; /* void append_move(int t, int y) void append_store(int t, bool[] v) void append_and(int t, int x, int y) void append_or(int t, int x, int y) void append_xor(int t, int x, int y) void append_not(int t, int x) void append_left(int t, int x, int p) void append_right(int t, int x, int p) void append_add(int t, int x, int y)*/ const int b = 2000; vector <bool> v; void construct_instructions(int s, int n, int k, int q) { for(int i = 0;i < b;i++){ v.push_back(false); } v[0] = true; append_move(1, 0); append_right(1, 1, k); if(k == 1){ append_and(0, 0, 1); } else{ append_and(2, 0, 1); append_xor(3, 0, 2); append_xor(4, 1, 2); append_right(3, 3, 1); append_right(4, 4, 1); append_xor(6, 3, 4); append_not(5, 6); append_and(7, 2, 5); // if append_and(8, 4, 0); append_and(9, 3, 1); append_or(10, 8, 9); append_and(11, 10, 6); append_or(12, 11, 7); append_store(13, v); append_and(14, 13, 12); v[0] = false; v[1] = true; append_store(15, v); append_and(2, 2, 15); append_or(0, 2, 14); } }
#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...