CSES - Aalto Competitive Programming 2024 - wk10 - Mon - Results
Submission details
Task:Modern art
Sender:bielaltes
Submission time:2024-11-11 17:33:43 +0200
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#10.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#50.00 sdetails
#6ACCEPTED0.00 sdetails
#70.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#200.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#230.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#29ACCEPTED0.00 sdetails
#300.00 sdetails
#310.00 sdetails
#32ACCEPTED0.00 sdetails
#330.00 sdetails
#34ACCEPTED0.00 sdetails
#35ACCEPTED0.00 sdetails
#360.00 sdetails
#37ACCEPTED0.00 sdetails
#380.00 sdetails
#39ACCEPTED0.00 sdetails
#400.00 sdetails
#41ACCEPTED0.00 sdetails
#420.01 sdetails
#430.00 sdetails
#440.00 sdetails
#45ACCEPTED0.00 sdetails
#460.00 sdetails
#47ACCEPTED0.00 sdetails
#480.00 sdetails
#49ACCEPTED0.00 sdetails
#500.00 sdetails

Code

#include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main() {
    int A, P;
    cin >> A >> P;
    if (P % 2 != 0 || P < 4) {
        cout << "IMPOSSIBLE" << endl;
        return 0;
    }
    bool possible = false;
    int w_opt = 0, h_opt = 0;
    for (int w = 1; w <= A; ++w) {
        int h = (P / 2) - w;
        if (h >= 1 && w * h >= A) {
            possible = true;
            w_opt = w;
            h_opt = h;
            break;
        }
    }
    if (!possible) {
        cout << "IMPOSSIBLE" << endl;
        return 0;
    }
    cout << "POSSIBLE" << endl;
    vector<string> grid(h_opt+2, string(w_opt+2, '0'));
    int count = A;
    for (int i = 1; i <= h_opt && count > 0; ++i) {
        for (int j = 1; j <= w_opt && count > 0; ++j) {
            grid[i][j] = '1';
            --count;
        }
    }
    for (const string& row : grid) {
        cout << row << endl;
    }
    return 0;
}

Test details

Test 1

Verdict:

input
5 14

correct output
IMPOSSIBLE

user output
POSSIBLE
000
010
010
010
...

Test 2

Verdict: ACCEPTED

input
6 14

correct output
POSSIBLE
000
010
010
010
...

user output
POSSIBLE
000
010
010
010
...

Test 3

Verdict: ACCEPTED

input
7 10

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 4

Verdict: ACCEPTED

input
5 5

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 5

Verdict:

input
6 22

correct output
IMPOSSIBLE

user output
POSSIBLE
000
010
010
010
...

Test 6

Verdict: ACCEPTED

input
7 10

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 7

Verdict:

input
5 20

correct output
IMPOSSIBLE

user output
POSSIBLE
000
010
010
010
...

Test 8

Verdict: ACCEPTED

input
6 8

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 9

Verdict: ACCEPTED

input
7 4

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 10

Verdict: ACCEPTED

input
5 10

correct output
POSSIBLE
0000
0110
0110
0100
...

user output
POSSIBLE
0000
0110
0110
0100
...

Test 11

Verdict: ACCEPTED

input
10 25

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 12

Verdict: ACCEPTED

input
10 22

correct output
POSSIBLE
000
010
010
010
...

user output
POSSIBLE
000
010
010
010
...

Test 13

Verdict: ACCEPTED

input
10 14

correct output
POSSIBLE
0000
0110
0110
0110
...

user output
POSSIBLE
0000
0110
0110
0110
...

Test 14

Verdict: ACCEPTED

input
10 6

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 15

Verdict: ACCEPTED

input
10 37

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 16

Verdict: ACCEPTED

input
10 12

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 17

Verdict: ACCEPTED

input
10 39

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 18

Verdict: ACCEPTED

input
10 14

correct output
POSSIBLE
0000
0110
0110
0110
...

user output
POSSIBLE
0000
0110
0110
0110
...

Test 19

Verdict: ACCEPTED

input
10 4

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 20

Verdict:

input
10 16

correct output
POSSIBLE
00000000
01111110
01111000
00000000

user output
POSSIBLE
0000
0110
0110
0110
...

Test 21

Verdict: ACCEPTED

input
100 239

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 22

Verdict: ACCEPTED

input
100 202

correct output
POSSIBLE
000
010
010
010
...

user output
POSSIBLE
000
010
010
010
...
Truncated

Test 23

Verdict:

input
100 70

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000
011110
011110
011110
...
Truncated

Test 24

Verdict: ACCEPTED

input
100 32

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 25

Verdict: ACCEPTED

input
100 361

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 26

Verdict:

input
100 48

correct output
POSSIBLE
00000000000000000000
01111111111111111110
01111111111111111110
01111111111111111110
...

user output
POSSIBLE
00000000
01111110
01111110
01111110
...
Truncated

Test 27

Verdict:

input
100 380

correct output
IMPOSSIBLE

user output
POSSIBLE
000
010
010
010
...
Truncated

Test 28

Verdict:

input
100 76

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
00000
01110
01110
01110
...
Truncated

Test 29

Verdict: ACCEPTED

input
100 8

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 30

Verdict:

input
100 98

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
00000
01110
01110
01110
...
Truncated

Test 31

Verdict:

input
200 476

correct output
IMPOSSIBLE

user output
POSSIBLE
000
010
010
010
...
Truncated

Test 32

Verdict: ACCEPTED

input
200 402

correct output
POSSIBLE
000
010
010
010
...

user output
POSSIBLE
000
010
010
010
...
Truncated

Test 33

Verdict:

input
200 120

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000
011110
011110
011110
...
Truncated

Test 34

Verdict: ACCEPTED

input
200 60

correct output
POSSIBLE
000000000000
011111111110
011111111110
011111111110
...

user output
POSSIBLE
000000000000
011111111110
011111111110
011111111110
...
Truncated

Test 35

Verdict: ACCEPTED

input
200 721

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 36

Verdict:

input
200 74

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000000
011111110
011111110
011111110
...
Truncated

Test 37

Verdict: ACCEPTED

input
200 759

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 38

Verdict:

input
200 134

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000
011110
011110
011110
...
Truncated

Test 39

Verdict: ACCEPTED

input
200 12

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 40

Verdict:

input
200 182

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
00000
01110
01110
01110
...
Truncated

Test 41

Verdict: ACCEPTED

input
1000 2373

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 42

Verdict:

input
1000 1998

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
0000
0110
0110
0110
...
Truncated

Test 43

Verdict:

input
1000 472

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
0000000
0111110
0111110
0111110
...
Truncated

Test 44

Verdict:

input
1000 286

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
0000000000
0111111110
0111111110
0111111110
...
Truncated

Test 45

Verdict: ACCEPTED

input
1000 3603

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 46

Verdict:

input
1000 228

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000000000
011111111110
011111111110
011111111110
...
Truncated

Test 47

Verdict: ACCEPTED

input
1000 3791

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 48

Verdict:

input
1000 552

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
000000
011110
011110
011110
...
Truncated

Test 49

Verdict: ACCEPTED

input
1000 48

correct output
IMPOSSIBLE

user output
IMPOSSIBLE

Test 50

Verdict:

input
1000 810

correct output
POSSIBLE
000000000000000000000000000000...

user output
POSSIBLE
00000
01110
01110
01110
...
Truncated