oj.uz

Submission #1059551

# Submission time Handle Problem Language Result Execution time Memory
1059551 2024-08-15T05:10:03 Z LittleOrange Bit Shift Registers (IOI21_registers) C++17
33 / 100
 1 ms 604 KB 
#include "registers.h"
#include<bits/stdc++.h>
using namespace std;
using ll = int;
const ll m = 100, b = 2000;

void construct_instructions(int s, int n, int k, int q) {
	auto get_num = [&](ll t, ll x, ll i){
		append_left(t,x,b-(i+1)*k);
		append_right(t,t,b-k);
		//append_print(t);
	};
	vector<bool> one(b,0);
	one[0] = true;
	if (s==0){
		get_num(1,0,0);
		append_store(m-1,one);
		auto neg = [&](ll t, ll x){
			append_not(t,x);
			append_add(t,t,m-1);
		};
		auto abs = [&](ll t, ll x, ll tmp){
			neg(t,x);
			append_right(tmp,x,b-k);
			append_and(tmp,t,tmp);
			append_not(t,x);
			append_right(t,t,b-k);
			append_and(t,t,x);
			append_add(t,t,tmp);
		};
		auto uabs = [&](ll t, ll x, ll tmp){
			neg(t,x);
			append_not(tmp,x);
			append_right(tmp,tmp,b-k*2);
			append_and(tmp,t,tmp);
			append_right(t,x,b-k*2);
			append_and(t,t,x);
			append_add(t,t,tmp);
		};
		for(ll i = 1;i<n;i++){
			get_num(2,0,i);
			neg(3,2);
			append_add(3,1,3);
			uabs(4,3,5);
			//append_print(4);
			//append_print(4);
			append_add(3,1,2);
			//append_print(3);
			append_add(3,3,4);
			//append_print(3);
			append_left(1,3,b-k-1);
			append_right(i+1<n,1,b-k);
		}
	}else{
		append_store(m-1,one);
		auto neg = [&](ll t, ll x){
			append_not(t,x);
			append_add(t,t,m-1);
		};
		auto abs = [&](ll t, ll x, ll tmp){
			neg(t,x);
			append_right(tmp,x,b-k);
			append_and(tmp,t,tmp);
			append_not(t,x);
			append_right(t,t,b-k);
			append_and(t,t,x);
			append_add(t,t,tmp);
		};
		auto uabs = [&](ll t, ll x, ll tmp){
			neg(t,x);
			append_not(tmp,x);
			append_right(tmp,tmp,b-k*2);
			append_and(tmp,t,tmp);
			append_right(t,x,b-k*2);
			append_and(t,t,x);
			append_add(t,t,tmp);
		};
		auto ord = [&](ll l, ll r, ll tmp1, ll tmp2){
			neg(tmp1,r);
			append_add(tmp1,tmp1,l);
			append_add(l,l,r);
			abs(tmp2,tmp1,r);
			neg(tmp1,tmp2);
			append_add(r,l,tmp2);
			append_add(l,l,tmp1);
			append_right(l,l,1);
			append_right(r,r,1);
		};
		for(ll i = 0;i<n;i++){
			get_num(i+1,0,i);
			//append_print(i+1);
		}
		for(ll j = n-1;j>0;j--){
			for(ll i = 0;i<j;i++){
				ord(i+1,i+2,m-2,m-3);
				//append_print(i+1);
				//append_print(i+2);
			}
		}
		for(ll i = 0;i<n;i++){
			append_move(i,i+1);
		}
	}
}

Compilation message

registers.cpp: In function 'void construct_instructions(int, int, int, int)':
registers.cpp:22:8: warning: variable 'abs' set but not used [-Wunused-but-set-variable]
   22 |   auto abs = [&](ll t, ll x, ll tmp){
      |        ^~~
registers.cpp:69:8: warning: variable 'uabs' set but not used [-Wunused-but-set-variable]
   69 |   auto uabs = [&](ll t, ll x, ll tmp){
      |        ^~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

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 492 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 348 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 1 ms 436 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

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