#include <bits/stdc++.h>
#include "registers.h"
using namespace std;
void construct_instructions(int s, int n, int k, int q)
{
if(k == 1)
{
append_right(1, 0, 1);
append_and(0, 0, 1);
return ;
}
else
{
while(1)
{
}
append_right(2, 1, 2); /// 2: B0, B1
append_left(1, 0, 1998);
append_right(1, 1, 1998); /// 1: A0, A1
append_and(3, 1, 2); /// 3: (A0 & B0), (A1 & B1)
append_right(4, 3, 1); /// 4: (A1 & B1)
append_xor(5, 1, 2);
append_not(5, 5);
append_right(5, 5, 1);
append_and(5, 5, 3); /// 5: (!(A1 ^ B1) & (A0 & B0))
append_xor(6, 3, 1);
append_xor(7, 3, 2);
append_right(6, 6, 1); /// ((A1 & B1) ^ A1)
append_right(7, 7, 1); /// ((A1 & B1) ^ B1)
append_and(6, 6, 1); /// ((A1 & B1) ^ A1) & A0
append_and(7, 7, 2); /// ((A1 & B1) ^ B1) & B0
append_or(8, 6, 7);
append_or(8, 8, 5);
append_or(0, 3, 8);
return ;
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1076 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1075 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1074 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1085 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1070 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1070 ms |
212 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |