CSES - Leirikisa 2

Submission details
Task:	Flash memory
Sender:	vgtcross
Submission time:	2023-04-18 13:42:24 +0300
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	ACCEPTED	0

Test results
test	verdict	time
#1	ACCEPTED	0.28 s	details
#2	ACCEPTED	0.15 s	details
#3	ACCEPTED	0.16 s	details
#4	ACCEPTED	0.09 s	details
#5	ACCEPTED	0.10 s	details
#6	ACCEPTED	0.10 s	details
#7	ACCEPTED	0.06 s	details
#8	ACCEPTED	0.06 s	details
#9	ACCEPTED	0.06 s	details
#10	ACCEPTED	0.06 s	details
#11	ACCEPTED	0.04 s	details
#12	ACCEPTED	0.04 s	details
#13	ACCEPTED	0.04 s	details
#14	ACCEPTED	0.04 s	details
#15	ACCEPTED	0.04 s	details
#16	ACCEPTED	0.03 s	details
#17	ACCEPTED	0.03 s	details
#18	ACCEPTED	0.03 s	details
#19	ACCEPTED	0.03 s	details
#20	ACCEPTED	0.03 s	details

Code

#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
 
void solve() {
    int t, b, m;
    cin >> t >> b >> m;
    
    bitset<512> B, B2, M, M2, O;
    
    if (t == 0) {
        while (true) {
            int c;
            cin >> c;
 
            if (c == 0)
                return;
            
            cin >> B2 >> M2;
            for (int i = 0; i < b; ++i)
                B[b-1-i] = B2[i];
            for (int i = 0; i < m; ++i)
                M[m-1-i] = M2[i];
            
            if (M == 0 && B != 0) {
                cout << 0 << endl;
                continue;
            }
            
            int ui = -1;
            for (int step = 0; step*m < b; ++step) {
                bool used = 0;
                for (int i = 0; i < m; ++i) if (B[m*step + i]) {
                    used = 1;
                    break;
                }
                if (!used) {
                    ui = step;
                    break;
                }
            }
            
            if (ui == -1)
                ui = b/m;
            
            bool bad = 1;
            if (ui > 0) {
                O = B | (M << ((ui-1)*m));
                bool works = 1;
                for (int i = 0; i < m; ++i) if (O[ui*m + i])
                    works = 0;
                
                if (works) {
                    cout << "1\n";
                    O = B | (M << ((ui-1)*m));
                    for (int i = 0; i < b; ++i) {
                        cout << O[i];
                    }
                    cout << endl;
                    bad = 0;
                }
            }
            
            if (bad && ui < b/m) {
                cout << "1\n";
                O = B | (M << (ui*m));
                for (int i = 0; i < b; ++i) {
                    cout << O[i];
                }
                cout << endl;
                bad = 0;
            }
            
            if (bad) {
                cout << 0 << endl;
            }
        }
    } else {
        while (true) {
            int c;
            cin >> c;
 
            if (c == 0)
                return;
 
            cin >> B2;
            for (int i = 0; i < b; ++i)
                B[b-1-i] = B2[i];
            
            bool used = 0;
            for (int step = b/m - 1; step >= 0; --step) {
                for (int i = 0; i < m; ++i) if (B[m*step + i]) {
                    used = 1;
                    break;
                }
                
                if (used) {
                    for (int i = 0; i < m; ++i) {
                        cout << B[m*step + i];
                    }
                    cout << endl;
                    break;
                }
            }
            
            if (!used) {
                for (int i = 0; i < m; ++i) {
                    cout << 0;
                }
                cout << endl;
            }
        }
    }
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    solve();
    
    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
`16 8 4.062445024495069624056` view save

correct output
(empty)

user output
`Activating encoder mode 0 16 8 1 0000000000000000 11100000 ...` Truncated

Error:

1 1 0 0

Test 2

Verdict: ACCEPTED

input
`32 8 12.264904841300964834177` view save

correct output
(empty)

user output
`Activating encoder mode 0 32 8 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 3

Verdict: ACCEPTED

input
`32 16 4.129591513707784802006` view save

correct output
(empty)

user output
`Activating encoder mode 0 32 16 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 4

Verdict: ACCEPTED

input
`64 8 30.039277894268828900030` view save

correct output
(empty)

user output
`Activating encoder mode 0 64 8 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 5

Verdict: ACCEPTED

input
`64 16 12.953148094217360432715` view save

correct output
(empty)

user output
`Activating encoder mode 0 64 16 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 6

Verdict: ACCEPTED

input
`64 32 4.073559788233661501537` view save

correct output
(empty)

user output
`Activating encoder mode 0 64 32 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 7

Verdict: ACCEPTED

input
`128 8 69.777892228928747548775` view save

correct output
(empty)

user output
`Activating encoder mode 0 128 8 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 8

Verdict: ACCEPTED

input
`128 16 34.73179127514363524097...` view save

correct output
(empty)

user output
`Activating encoder mode 0 128 16 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 9

Verdict: ACCEPTED

input
`128 32 13.95078898770563890866...` view save

correct output
(empty)

user output
`Activating encoder mode 0 128 32 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 10

Verdict: ACCEPTED

input
`128 64 4.039918210604800133907` view save

correct output
(empty)

user output
`Activating encoder mode 0 128 64 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 11

Verdict: ACCEPTED

input
`256 8 174.46804708607103851145...` view save

correct output
(empty)

user output
`Activating encoder mode 0 256 8 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 12

Verdict: ACCEPTED

input
`256 16 82.22261415140417733455...` view save

correct output
(empty)

user output
`Activating encoder mode 0 256 16 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 13

Verdict: ACCEPTED

input
`256 32 37.62938226976920648891...` view save

correct output
(empty)

user output
`Activating encoder mode 0 256 32 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 14

Verdict: ACCEPTED

input
`256 64 14.26346228205414057768...` view save

correct output
(empty)

user output
`Activating encoder mode 0 256 64 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 15

Verdict: ACCEPTED

input
`256 128 4.01556909389394343085...` view save

correct output
(empty)

user output
`Activating encoder mode 0 256 128 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 16

Verdict: ACCEPTED

input
`512 16 204.7462421274103461702...` view save

correct output
(empty)

user output
`Activating encoder mode 0 512 16 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 17

Verdict: ACCEPTED

input
`512 32 91.77859514807311153984...` view save

correct output
(empty)

user output
`Activating encoder mode 0 512 32 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 18

Verdict: ACCEPTED

input
`512 64 39.23027924214593871262...` view save

correct output
(empty)

user output
`Activating encoder mode 0 512 64 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 19

Verdict: ACCEPTED

input
`512 128 15.0000000021676722686...` view save

correct output
(empty)

user output
`Activating encoder mode 0 512 128 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Test 20

Verdict: ACCEPTED

input
`512 256 4.00542327711105546887...` view save

correct output
(empty)

user output
`Activating encoder mode 0 512 256 1 000000000000000000000000000000...` Truncated

Error:

1 1 0 0

Leirikisa 2

Flash memory

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (vgtcross)