oj.uz

Submission #832484

# Submission time Handle Problem Language Result Execution time Memory
832484 2023-08-21T10:49:41 Z GrindMachine Bit Shift Registers (IOI21_registers) C++17
10 / 100
 1 ms 596 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "registers.h"

void construct_instructions(int s, int n, int k, int q) {
	const int b = 2000;

	int ans = 0;
	int x = 1, y = 2;
	int xnot = 3, ynot = 4;
	int fx = 5, fy = 6;

	int buff = 99;
	append_move(buff,ans);

	rep1(num,n-1){
		append_move(x,ans);
		append_right(y,buff,num*k);
		
		vector<bool> v(b);
		append_store(ans,v);

		append_not(xnot,x);
		append_not(ynot,y);

		v[k] = 1;
		append_store(fx,v);
		append_store(fy,v);
		v[k] = 0;

		int flipx = 7, flipy = 8;
		int putx = 9, puty = 10;

		rev(bit,k-1,0){
			append_right(fx,fx,1);
			append_right(fy,fy,1);

			append_and(flipx,fx,fy);
			append_and(flipx,flipx,x);
			append_and(flipx,flipx,ynot);

			append_and(flipy,fx,fy);
			append_and(flipy,flipy,xnot);
			append_and(flipy,flipy,y);

			append_xor(fx,fx,flipx);
			append_xor(fy,fy,flipy);

			append_and(putx,fx,x);
			append_and(puty,fy,y);

			append_or(ans,ans,putx);
			append_or(ans,ans,puty);
		}
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0.0 / 11.0

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

Subtask #3
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 1 ms 596 KB Wrong answer detected in grader
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 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 468 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 468 KB Incorrect sorting
2 Halted 0 ms 0 KB -