| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 15336 | skeksk91 | 쿼터너리 컴퓨터 (kriii3_Z) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#include <queue>
#include <limits.h>
#include <algorithm>
#define ll long long
int n, m, v[20], f[20], page[20], inst[20], ret[20], a[20], b[20], u[20];
int plus[4][4] ={{0,1,2,3},{1,2,3,0},{2,3,0,1},{3,0,1,2}};
int xor[4][4] = {{0,1,2,3},{1,0,3,2},{2,3,0,1},{3,2,1,0}};
void func(int here){
if(here==n){
//for(int i = 0 ; i < n; i++){
// printf("%d ", v[i]);
//}
//printf("\n");
for(int i = 0; i < n; i++){
u[i] = v[i];
}
for(int i = 0; i < m; i++){
if(inst[i]==0){
u[ret[i]] = plus[u[a[i]]][u[b[i]]];
}
else if(inst[i]==1){
u[ret[i]] = xor[u[a[i]]][u[b[i]]];
}
else if(inst[i]==2){