oj.uz

Submission #882358

# Submission time Handle Problem Language Result Execution time Memory
882358 2023-12-03T05:16:31 Z pirhosig Cave (IOI13_cave) C++17
100 / 100
 683 ms 860 KB 
#include "cave.h"
#include <bits/stdc++.h>
#define R(a)  for (int i = 0; i < a; ++i)
#define RR(a) for (int j = 0; j < a; ++j)
using namespace std;


bool testDoor(int swit[], int door)
{
    int res = tryCombination(swit);
    if (door < res || res == -1) return true;
    else return false;
}


void exploreCave(int N) {
    int sPoses[N];
    int switchStates[N];
    int doorStates[N];
    R(N)
    {
        sPoses[i] = -1;
        switchStates[i] = -1;
        doorStates[i] = -1;
    }

    R(N)
    {
        bool zero = false;
        if (doorStates[i] == -1)
        {
            int initialTestSwitches[N];
            RR(N)
            {
                if (switchStates[j] == -1) initialTestSwitches[j] = 0;
                else initialTestSwitches[j] = switchStates[j];
            }

            int res = tryCombination(initialTestSwitches);
            if (res == -1)
            {
                zero = true;
                for (int j = i; j < N; ++j)
                {
                    doorStates[j] = 0;
                }
            }
            else if (i < res)
            {
                zero = true;
                for (int j = i; j < res; ++j)
                {
                    doorStates[j] = 0;
                }
            }
        }
        else zero = true;

        if (zero)
        {
            int lower = 0;
            int upper = N - 1;
            int definite = -1;
            while (upper - lower > 1)
            {
                int mid = (lower + upper) / 2;
                int testSwitches[N];
                RR(N)
                {
                    if (switchStates[j] != -1) testSwitches[j] = switchStates[j];
                    else
                    {
                        if (lower <= j && j <= mid) testSwitches[j] = 0;
                        else testSwitches[j] = 1;
                    }
                }

                if (testDoor(testSwitches, i))
                {
                    upper = mid;
                }
                else
                {
                    lower = mid;
                    if (lower + 1 == upper) definite = upper;
                }
            }

            if (definite > -1)
            {
                sPoses[i] = definite;
                switchStates[definite] = 0;
            }
            else
            {
                int testSwitches[N];
                RR(N)
                {
                    if (switchStates[j] != -1) testSwitches[j] = switchStates[j];
                    else
                    {
                        if (j == lower) testSwitches[j] = 0;
                        else testSwitches[j] = 1;
                    }
                }

                if (testDoor(testSwitches, i))
                {
                    sPoses[i] = lower;
                    switchStates[lower] = 0;
                }
                else
                {
                    sPoses[i] = upper;
                    switchStates[upper] = 0;
                }
            }

        }
        else
        {
            int lower = 0;
            int upper = N - 1;
            int definite = -1;
            while (upper - lower > 1)
            {
                int mid = (lower + upper) / 2;
                int testSwitches[N];
                RR(N)
                {
                    if (switchStates[j] != -1) testSwitches[j] = switchStates[j];
                    else
                    {
                        if (lower <= j && j <= mid) testSwitches[j] = 1;
                        else testSwitches[j] = 0;
                    }
                }

                if (testDoor(testSwitches, i))
                {
                    upper = mid;
                }
                else
                {
                    lower = mid;
                    if (lower + 1 == upper) definite = upper;
                }
            }

            if (definite > -1)
            {
                sPoses[i] = definite;
                switchStates[definite] = 1;
            }
            else
            {
                int testSwitches[N];
                RR(N)
                {
                    if (switchStates[j] != -1) testSwitches[j] = switchStates[j];
                    else
                    {
                        if (j == lower) testSwitches[j] = 1;
                        else testSwitches[j] = 0;
                    }
                }

                if (testDoor(testSwitches, i))
                {
                    sPoses[i] = lower;
                    switchStates[lower] = 1;
                }
                else
                {
                    sPoses[i] = upper;
                    switchStates[upper] = 1;
                }
            }
        }

    }

    int switchesForDoors[N];
    R(N)
    {
       switchesForDoors[sPoses[i]] = i;
    }

    /*R(N)
    {
        cout << switchesForDoors[i] << " ";
    }
    cout << endl;
    R(N)
    {
        cout << switchStates[i] << " ";
    }
    cout << endl;*/

    answer(switchStates, switchesForDoors);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 552 KB Output is correct
2 Correct 225 ms 344 KB Output is correct
3 Correct 341 ms 344 KB Output is correct
4 Correct 229 ms 348 KB Output is correct
5 Correct 346 ms 344 KB Output is correct
6 Correct 348 ms 576 KB Output is correct
7 Correct 341 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 346 ms 576 KB Output is correct
13 Correct 365 ms 348 KB Output is correct
14 Correct 336 ms 860 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 345 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 335 ms 580 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 374 ms 700 KB Output is correct
7 Correct 364 ms 580 KB Output is correct
8 Correct 560 ms 572 KB Output is correct
9 Correct 548 ms 576 KB Output is correct
10 Correct 555 ms 704 KB Output is correct
11 Correct 310 ms 576 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 440 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 440 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 50 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 82 ms 492 KB Output is correct
24 Correct 81 ms 344 KB Output is correct
25 Correct 85 ms 488 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 59 ms 500 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 56 ms 484 KB Output is correct
31 Correct 50 ms 348 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 81 ms 348 KB Output is correct
36 Correct 73 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 227 ms 552 KB Output is correct
2 Correct 225 ms 344 KB Output is correct
3 Correct 341 ms 344 KB Output is correct
4 Correct 229 ms 348 KB Output is correct
5 Correct 346 ms 344 KB Output is correct
6 Correct 348 ms 576 KB Output is correct
7 Correct 341 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 346 ms 576 KB Output is correct
13 Correct 365 ms 348 KB Output is correct
14 Correct 336 ms 860 KB Output is correct
15 Correct 345 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 335 ms 580 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 374 ms 700 KB Output is correct
21 Correct 364 ms 580 KB Output is correct
22 Correct 560 ms 572 KB Output is correct
23 Correct 548 ms 576 KB Output is correct
24 Correct 555 ms 704 KB Output is correct
25 Correct 310 ms 576 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 440 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 440 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 50 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 360 KB Output is correct
48 Correct 82 ms 492 KB Output is correct
49 Correct 81 ms 344 KB Output is correct
50 Correct 85 ms 488 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 59 ms 500 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 56 ms 484 KB Output is correct
56 Correct 50 ms 348 KB Output is correct
57 Correct 1 ms 344 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 600 KB Output is correct
60 Correct 81 ms 348 KB Output is correct
61 Correct 73 ms 344 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 231 ms 552 KB Output is correct
64 Correct 271 ms 556 KB Output is correct
65 Correct 366 ms 576 KB Output is correct
66 Correct 261 ms 604 KB Output is correct
67 Correct 328 ms 576 KB Output is correct
68 Correct 377 ms 580 KB Output is correct
69 Correct 330 ms 580 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 371 ms 576 KB Output is correct
73 Correct 338 ms 596 KB Output is correct
74 Correct 361 ms 596 KB Output is correct
75 Correct 340 ms 580 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 368 ms 576 KB Output is correct
79 Correct 370 ms 348 KB Output is correct
80 Correct 548 ms 604 KB Output is correct
81 Correct 568 ms 580 KB Output is correct
82 Correct 546 ms 576 KB Output is correct
83 Correct 289 ms 344 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 56 ms 484 KB Output is correct
86 Correct 342 ms 588 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 81 ms 484 KB Output is correct
90 Correct 81 ms 348 KB Output is correct
91 Correct 81 ms 348 KB Output is correct
92 Correct 665 ms 580 KB Output is correct
93 Correct 683 ms 576 KB Output is correct
94 Correct 679 ms 572 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 368 ms 592 KB Output is correct
98 Correct 56 ms 348 KB Output is correct
99 Correct 387 ms 576 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 56 ms 348 KB Output is correct
102 Correct 46 ms 348 KB Output is correct
103 Correct 318 ms 604 KB Output is correct
104 Correct 1 ms 348 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 436 KB Output is correct
107 Correct 81 ms 488 KB Output is correct
108 Correct 80 ms 492 KB Output is correct
109 Correct 655 ms 348 KB Output is correct
110 Correct 586 ms 572 KB Output is correct
111 Correct 0 ms 344 KB Output is correct