제출 #1007290

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1007290		GrindMachine	레지스터 (IOI21_registers)	C++17	33 / 100	3 ms	604 KiB

registers

#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(...) 42
#endif
 
/*
 
read the solution a long time ago, remember some key ideas from there

*/
 
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) {
	if(n <= 2){
		const int b = 2000;

		int x = 0;
		int y = 51;

		int minus_one = 90;
		vector<bool> all_set(b,1);
		append_store(minus_one,all_set);

		int one = 91;
		vector<bool> one_set(b);
		one_set[0] = 1;
		append_store(one,one_set);

		rep1(i,n-1){
			vector<bool> filter(b);
			for(int j = i*k; j < (i+1)*k; ++j){
				filter[j] = 1;
			}

			append_store(y,filter);
			append_and(y,y,0);
			append_right(y,y,i*k);

			fill(all(filter),0);
			for(int j = 0; j < k; ++j){
				filter[j] = 1;
			}
			int z = 60;
			append_store(z,filter);
			append_and(x,x,z);

			int xnot = 52, ynot = 53;
			append_not(xnot,x);
			append_not(ynot,y);

			int x_minus_y = 54, y_minus_x = 55;
			append_add(x_minus_y,x,ynot);
			append_add(y_minus_x,y,xnot);
			append_add(x_minus_y,x_minus_y,one);

			append_right(x_minus_y,x_minus_y,b-1);
			append_right(y_minus_x,y_minus_x,b-1);

			append_add(x_minus_y,x_minus_y,minus_one);
			append_add(y_minus_x,y_minus_x,minus_one);

			int x_contrib = 56, y_contrib = 57;
			append_and(x_contrib,x,y_minus_x);
			append_and(y_contrib,y,x_minus_y);
			append_or(x,x_contrib,y_contrib);
		}

		return;
	}

	const int b = 2000;
 
	int x = 50;
	int y = 51;
 
	int minus_one = 90;
	vector<bool> all_set(b,1);
	append_store(minus_one,all_set);
 
	int one = 91;
	vector<bool> one_set(b);
	one_set[0] = 1;
	append_store(one,one_set);
 
	rep(i,n){
		vector<bool> filter(b);
		for(int j = i*k; j < (i+1)*k; ++j){
			filter[j] = 1;
		}
 
		append_store(y,filter);
		append_and(y,y,0);
		append_right(y,y,i*k);
 
		if(i == 0){
			append_move(x,y);
			append_print(x);
			conts;
		}
 
		int xnot = 52, ynot = 53;
		append_not(xnot,x);
		append_not(ynot,y);
 
		int x_minus_y = 54, y_minus_x = 55;
		append_add(x_minus_y,x,ynot);
		append_add(y_minus_x,y,xnot);
		append_add(x_minus_y,x_minus_y,one);
 
		append_right(x_minus_y,x_minus_y,b-1);
		append_right(y_minus_x,y_minus_x,b-1);
 
		append_add(x_minus_y,x_minus_y,minus_one);
		append_add(y_minus_x,y_minus_x,minus_one);
 
		int x_contrib = 57, y_contrib = 58;
		append_and(x_contrib,x,y_minus_x);
		append_and(y_contrib,y,x_minus_y);
 
		append_or(x,x_contrib,y_contrib);
	}
 
	append_move(0,x);
}

• Subtask 1: 10 / 10
• Subtask 2: 11 / 11
• Subtask 3: 12 / 12
• Subtask 4: 0 / 25
• Subtask 5: 0 / 13
• Subtask 6: 0 / 29