oj.uz

Submission #1058710

# Submission time Handle Problem Language Result Execution time Memory
1058710 2024-08-14T12:43:11 Z pcc Bit Shift Registers (IOI21_registers) C++17
22 / 100
 1 ms 604 KB 
#include "registers.h"
#include <bits/stdc++.h>
using namespace std;

#define OP_MOVE 0
#define OP_STORE 1
#define OP_AND 2
#define OP_OR 3
#define OP_XOR 4
#define OP_NOT 5
#define OP_LEFT 6
#define OP_RIGHT 7
#define OP_ADD 8


const int M = 100;
const int B = 2000;

void add_op(int tp,int t,int x,int y = -1){
	if(tp == OP_MOVE)append_move(t,x);
	else if(tp == OP_AND)append_and(t,x,y);
	else if(tp == OP_OR)append_or(t,x,y);
	else if(tp == OP_XOR)append_xor(t,x,y);
	else if(tp == OP_NOT)append_not(t,x);
	else if(tp == OP_LEFT)append_left(t,x,y);
	else if(tp == OP_RIGHT)append_right(t,x,y);
	else if(tp == OP_ADD)append_add(t,x,y);
	return;
}

const int one = 1;
const int mask = 2;

void construct_instructions(int s, int n, int k, int q) {
	vector<bool> v(B,0);
	v[0] = 1;
	append_store(one,v);
	int ans = 3;
	for(int i = 0;i<k;i++)v[i] = 1;
	append_store(ans,v);
	append_store(mask,v);
	for(int i = 0;i<n;i++){
		int a = ans,b = 4;
		add_op(OP_RIGHT,b,0,i*k);
		add_op(OP_AND,b,mask,b);
		int flag = 5;
		add_op(OP_NOT,flag,a);
		add_op(OP_AND,flag,mask,flag);
		add_op(OP_ADD,flag,b,flag);
		add_op(OP_ADD,flag,one,flag);
		add_op(OP_RIGHT,flag,flag,k);
		add_op(OP_AND,flag,one,flag);
		for(int j = 1;j<k;j<<=1){
			int tmp = 6;
			add_op(OP_LEFT,tmp,flag,j);
			add_op(OP_OR,flag,tmp,flag);
		}
		int rflag = 6;
		append_print(a);
		append_print(b);
		add_op(OP_NOT,rflag,flag);
		append_print(flag);
		append_print(rflag);
		add_op(OP_AND,b,rflag,b);
		add_op(OP_AND,a,flag,a);
		append_print(a);
		append_print(b);
		add_op(OP_OR,ans,a,b);
	}
	add_op(OP_MOVE,0,ans);
	return;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #2
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect sorting
2 Halted 0 ms 0 KB -