oj.uz

답안 #1051345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051345 2024-08-10T04:56:50 Z Edu175 레지스터 (IOI21_registers) C++17
10 / 100
 1 ms 764 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fst first
#define snd second
#define fore(i,a,b) for(ll i=a,ioi=b; i<ioi; i++)
#define SZ(x) ((int)x.size())
#define ALL(x) x.begin(),x.end()
#define mset(a,v) memset((a),(v),sizeof(a))
#define imp(v) {for(auto kdfhg:v)cout<<kdfhg<<" ";cout<<"\n";}
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
void append_move(int t, int x);
void append_store(int t, vector<bool> v);
void append_and(int t, int x, int y);
void append_or(int t, int x, int y);
void append_xor(int t, int x, int y);
void append_not(int t, int x);
void append_left(int t, int x, int s);
void append_right(int t, int x, int s);
void append_add(int t, int x, int y);
void append_print(int t);
const ll CACHE_SIZE=5;
const ll C=CACHE_SIZE;

ll k,c[C];
ll log2techo(ll n){
	ll ret=63-__builtin_clzll(n);
	if(__builtin_popcountll(n)>1)ret++;
	return ret;
}
void expand(ll x){
	fore(i,0,log2techo(k)){
		append_left(c[0],x,1ll<<i);
		append_or(x,x,c[0]);
	}
}

void my_xor_equal(ll x, ll y, ll f){ // x^=y if f
	append_and(c[0],y,f);
	append_xor(x,x,c[0]);
}
void my_swap(ll x, ll y, ll f){
	// //append_print(50);
	
	// //append_print(x);
	// //append_print(y);
	// //append_print(f);
	expand(f);
	my_xor_equal(x,y,f);
	my_xor_equal(y,x,f);
	my_xor_equal(x,y,f);
	// //append_print(x);
	// //append_print(y);
	// //append_print(f);
	// //append_print(50);
}
ll uno,u; // u= universe (size-k)
void ifmaysw(ll a, ll b){
	append_not(c[0],a);
	append_and(c[0],c[0],b);
	append_xor(c[1],a,b);
	//append_print(c[0]);
	//append_print(c[1]);
	ll f0=c[3],f1=c[4];
	append_move(f0,uno);
	append_move(f1,uno);
	// //append_print(f0);
	// //append_print(f1);
	for(ll i=k-1;i>=0;i--){
		append_right(c[2],c[0],i);
		append_and(c[2],f0,c[2]);
		append_not(c[2],c[2]);
		append_and(f1,f1,c[2]);
		
		//append_print(f0);
		//append_print(f1);
		append_right(c[2],c[1],i);
		append_and(c[2],f1,c[2]);
		append_not(c[2],c[2]);
		append_and(f0,f0,c[2]);
		
		//append_print(f0);
		//append_print(f1);
		
	}
	// //append_print(f0);
	// //append_print(f1);
	my_swap(a,b,f1);
}
void construct_instructions(int s, int n, int K, int q){
	k=K;
	fore(i,0,C)c[i]=i+100-C;
	uno=100-C-1;
	ll b=2000;
	vector<bool>v(b); v[0]=1;
	append_store(uno,v);
	fore(i,0,k)v[i]=1;
	u=uno-1;
	append_store(u,v);
	append_and(1,0,u);
	//append_print(0);
	fore(i,1,n){
		// cout<<"paso "<<i<<"\n";
		
		append_right(2,0,i*k);
		// append_and(2,2,u);
		
		//append_print(1);
		//append_print(2);
		
		ifmaysw(1,2);
		
		//append_print(1);
		//append_print(2);
	}
	append_move(0,1);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #2
0.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB Wrong answer detected in grader
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 764 KB Wrong answer detected in grader
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect sorting
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Incorrect sorting
2 Halted 0 ms 0 KB -