#include "registers.h"
#include <bits/stdc++.h>
#define fs first
#define sc second
#define p_q priority_queue
using namespace std;
const int m=100,b=2000;
void construct_instructions(int s, int n, int k, int q) {
if(s==0){
vector<bool> le(b);
for(;n<128;n++){
for(int j=0;j<k;j++){
le[n*k+j]=1;
}
}
append_store(99,le);
append_or(0,0,99);
int w=2*k;
for(int p=0;p<7;p++){
vector<bool> v(b),zero(b),one(b);
for(int j=0;j<n*k;j+=w){
for(int i=0;i<k;i++){
v[j+i]=1;
}
one[j]=1;
}
append_store(98,v);
append_store(97,one);
append_right(1,0,w/2);
append_and(0,0,98);
append_xor(2,0,1);
append_xor(1,1,98);
int f=4;
append_add(f,0,1);
append_right(f,f,k);
append_and(f,f,97);
append_add(f,f,98);
append_xor(f,f,98);
append_and(f,f,2);
append_xor(0,0,f);
w<<=1;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Wrong answer detected in grader |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
340 KB |
Incorrect min value |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
212 KB |
Incorrect sorting |
2 |
Halted |
0 ms |
0 KB |
- |