제출 #818195

#제출 시각아이디문제언어결과실행 시간메모리
818195alvingogo레지스터 (IOI21_registers)C++17
21 / 100
1 ms300 KiB
#include "registers.h" #include <bits/stdc++.h> #define fs first #define sc second #define p_q priority_queue using namespace std; const int m=100,b=2000; void construct_instructions(int s, int n, int k, int q) { if(k==1){ append_move(1, 0); append_right(1, 1, 1); append_and(0, 0, 1); } else{ vector<bool> v(b),v2(b); v[0]=v[1]=1; v2[0]=1; append_store(7,v); append_store(8,v2); append_move(1,0); append_and(0,0,7); append_right(1,1,2); append_xor(2,0,1); append_right(3,2,1); append_xor(4,3,8); append_and(4,4,2); append_and(5,0,4); append_right(6,0,1); append_and(6,6,3); append_or(5,5,6); //f get append_add(5,5,7); append_xor(5,5,7); append_and(5,5,2); append_xor(0,0,5); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...