Submission #896240

# Submission time Handle Problem Language Result Execution time Memory
896240 2024-01-01T05:05:17 Z Faisal_Saqib Bit Shift Registers (IOI21_registers) C++17
0 / 100
1 ms 348 KB
#include <vector>
using namespace std;
void append_move(int t, int x);
void append_store(int t, std::vector<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 s);
void append_right(int t, int x, int s);
void append_add(int t, int x, int y);
void append_print(int t);
void construct_instructions(int s, int n, int k, int q)
{
	// b=2000
	// assume s==0 and n==2
	append_left(1,0,2000-k);
	append_right(1,1,2000-k);
	append_right(2,0,k);
	// if(k==1)
	// {
		append_and(0,1,2);
	// }
	// else
	// {
		
	// }
	// append_print(1);
	// append_print(2);
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Incorrect min value
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect sorting
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Incorrect sorting
2 Halted 0 ms 0 KB -