Submission #1075672

#TimeUsernameProblemLanguageResultExecution timeMemory
1075672mickey080929Bit Shift Registers (IOI21_registers)C++17
34 / 100
2 ms768 KiB
#include "registers.h" #include <bits/stdc++.h> using namespace std; void append_move(int t, int y); void append_store(int t, vector<bool> b); 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 p); void append_right(int t, int x, int p); void append_add(int t, int x, int y); void append_print(int t); static const int m = 100; static const int b = 2000; void cmp_and_swap(vector<int> u, vector<int> v, int k) { append_right(1, 0, u[0]*k); append_right(2, 0, v[0]*k); vector<bool> arr(b, 0); for (auto &x : u) { for (int i=(x-u[0])*k; i<(x-u[0]+1)*k; i++) { arr[i] = 1; } } append_store(3, arr); append_and(1, 1, 3); append_and(2, 2, 3); append_xor(4, 2, 3); append_add(5, 1, 4); append_right(5, 5, k); append_and(5, 3, 5); append_xor(5, 3, 5); fill(arr.begin(), arr.end(), 0); for (auto &x : u) { arr[(x-u[0]) * k] = 1; } append_store(6, arr); append_add(5, 5, 6); append_and(5, 3, 5); append_xor(6, 1, 2); append_and(6, 6, 5); append_left(7, 6, u[0] * k); append_xor(0, 0, 7); append_left(7, 6, v[0] * k); append_xor(0, 0, 7); } void construct_instructions(int s, int n, int k, int q) { if (s == 0) { for (int i=0; (1<<(i+1))<=n; i++) { vector<int> u, v; for (int j=1; j*(1<<(i+1))<=n; j++) { u.push_back((2*j-2)*(1<<i)); v.push_back((2*j-1)*(1<<i)); } cmp_and_swap(u, v, k); } } else { for (int i=0; i<=n-1; i++) { for (int j=n-2; j>=i; j--) { cmp_and_swap({j}, {j+1}, k); } } } }
#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...