oj.uz

Submission #566071

# Submission time Handle Problem Language Result Execution time Memory
566071 2022-05-21T18:00:58 Z doowey Bit Shift Registers (IOI21_registers) C++17
58 / 100
 1 ms 304 KB 
#include "registers.h"
#include <bits/stdc++.h>

using namespace std;

int b = 2000;

void construct_instructions(int s, int n, int k, int q) {
    vector<bool> d(b);
    vector<bool> qq(b);
	while(__builtin_popcount(n) > 1){
        for(int j = 0 ; j < k ; j ++ ){
            d[n * k + j] = 1;
        }
        n ++ ;
	}
	for(int i = 0 ; i < b; i ++ ){
        if((i / k) % 2 == 0){
            qq[i] = 1;
        }
        else{
            qq[i] = 0;
        }
	}
	vector<bool> zz(b);
	for(int i = 0 ; i < b; i ++ ){
        if(i > 0 && i % k == 0) zz[i] = 1;
	}
	append_store(8, zz);
	vector<bool> emp(b);
	append_store(1, d);
	append_store(4, qq);
	append_or(0, 0, 1);
	int b = 0;
	while((1 << b) < n) b ++ ;
	for(int j = 0 ; j < b; j ++ ){
        append_right(3, 0, (k << j));
        append_move(2, 0);
        append_not(3, 3);
        append_and(2, 2, 4);
        append_and(3, 3, 4);
        append_add(5, 2, 3);
        append_store(6, emp);
        append_and(5, 5, 8);
        append_right(5, 5, k);
        append_add(5, 5, 4);
        //append_print(5);
        append_not(3, 3);
        append_and(3, 3, 4);
        append_and(2, 2, 5);
        append_not(5, 5);
        append_and(3, 3, 5);
        append_or(0, 2, 3);
	}
}

Subtask #1
10.0 / 10.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 304 KB Output is correct

Subtask #5
0.0 / 13.0

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