oj.uz

Submission #724240

# Submission time Handle Problem Language Result Execution time Memory
724240 2023-04-14T23:28:05 Z Bobonbush Cave (IOI13_cave) C++17
100 / 100
 868 ms 588 KB 
#include<cave.h>
#include <bits/stdc++.h>
#define foreach for
#define in :
using namespace std;
typedef long long ll;
const int MODULO = 1e9+7;
const ll INF = 1e18+1;
template<class X ,class Y>
    bool Minimize(X &x , Y y)
    {
        if(x > y)
        {
            x = y ;
            return true;
        }
        return false;
    }
template<class X ,class Y>
    bool Maximize(X &x , Y y )
    {
        if(x < y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X ,class Y>
    void Add(X &x , Y y)
    {
        x += y;
        if( x >= MODULO) x -= MODULO;
    }
template<class X ,class Y>
    void Sub(X &x , Y y )
    {
        x -= y ;
        if( x < 0 ) x += MODULO;
    }
void exploreCave(int n)
{
    int status[n] ;
    int related[n];
    for(int i = 0 ; i < n ; i++)
    {
        related[i] = 0;
        status[i] = 0;
    }
    vector<int>List;
    for(int i = 0 ; i < n ; i++)List.push_back(i);
    for(int i = 0 ; i < n ; i++)
    {
        foreach(int v in List)status[v] = 0;
        if(tryCombination(status) != i)foreach(int v in List)status[v] = 1;
        int l = 0 ;
        int r = (int)List.size()-1;
        while(l <= r)
        {
            int mid = (l+r) >> 1;
            for(int i = 0 ; i <= mid ; i++)
            {
                status[List[i]] ^= 1;
            }
            int x = tryCombination(status);
            for(int i = 0 ; i <= mid ;i++)
            {
                status[List[i]] ^= 1;
            }
            if(x == i)l = mid+1;
            else r = mid-1;
        }
        int pos = List[l];
        swap(List[l] , List.back());
        List.pop_back();
        status[pos] ^=1;
        related[pos] = i;
    }
    answer(status , related);
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 340 KB Output is correct
2 Correct 317 ms 440 KB Output is correct
3 Correct 469 ms 468 KB Output is correct
4 Correct 324 ms 460 KB Output is correct
5 Correct 512 ms 468 KB Output is correct
6 Correct 474 ms 468 KB Output is correct
7 Correct 519 ms 460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 490 ms 468 KB Output is correct
13 Correct 475 ms 588 KB Output is correct
14 Correct 467 ms 472 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 505 ms 424 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 493 ms 428 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 510 ms 428 KB Output is correct
7 Correct 834 ms 428 KB Output is correct
8 Correct 543 ms 340 KB Output is correct
9 Correct 551 ms 424 KB Output is correct
10 Correct 524 ms 340 KB Output is correct
11 Correct 864 ms 436 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 300 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 122 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 71 ms 356 KB Output is correct
24 Correct 74 ms 356 KB Output is correct
25 Correct 76 ms 360 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 73 ms 356 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 106 ms 460 KB Output is correct
31 Correct 116 ms 340 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 304 KB Output is correct
35 Correct 74 ms 340 KB Output is correct
36 Correct 77 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 340 KB Output is correct
2 Correct 317 ms 440 KB Output is correct
3 Correct 469 ms 468 KB Output is correct
4 Correct 324 ms 460 KB Output is correct
5 Correct 512 ms 468 KB Output is correct
6 Correct 474 ms 468 KB Output is correct
7 Correct 519 ms 460 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 490 ms 468 KB Output is correct
13 Correct 475 ms 588 KB Output is correct
14 Correct 467 ms 472 KB Output is correct
15 Correct 505 ms 424 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 493 ms 428 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 510 ms 428 KB Output is correct
21 Correct 834 ms 428 KB Output is correct
22 Correct 543 ms 340 KB Output is correct
23 Correct 551 ms 424 KB Output is correct
24 Correct 524 ms 340 KB Output is correct
25 Correct 864 ms 436 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 304 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 300 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 122 ms 340 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 71 ms 356 KB Output is correct
49 Correct 74 ms 356 KB Output is correct
50 Correct 76 ms 360 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 73 ms 356 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 106 ms 460 KB Output is correct
56 Correct 116 ms 340 KB Output is correct
57 Correct 1 ms 300 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 304 KB Output is correct
60 Correct 74 ms 340 KB Output is correct
61 Correct 77 ms 340 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 335 ms 424 KB Output is correct
64 Correct 318 ms 340 KB Output is correct
65 Correct 464 ms 468 KB Output is correct
66 Correct 331 ms 448 KB Output is correct
67 Correct 530 ms 468 KB Output is correct
68 Correct 493 ms 468 KB Output is correct
69 Correct 510 ms 468 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 304 KB Output is correct
72 Correct 475 ms 468 KB Output is correct
73 Correct 467 ms 588 KB Output is correct
74 Correct 486 ms 472 KB Output is correct
75 Correct 503 ms 464 KB Output is correct
76 Correct 1 ms 212 KB Output is correct
77 Correct 1 ms 212 KB Output is correct
78 Correct 516 ms 460 KB Output is correct
79 Correct 827 ms 468 KB Output is correct
80 Correct 522 ms 476 KB Output is correct
81 Correct 518 ms 460 KB Output is correct
82 Correct 526 ms 468 KB Output is correct
83 Correct 868 ms 588 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 121 ms 352 KB Output is correct
86 Correct 735 ms 468 KB Output is correct
87 Correct 1 ms 212 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 75 ms 356 KB Output is correct
90 Correct 77 ms 352 KB Output is correct
91 Correct 74 ms 340 KB Output is correct
92 Correct 498 ms 468 KB Output is correct
93 Correct 509 ms 468 KB Output is correct
94 Correct 510 ms 468 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 644 ms 468 KB Output is correct
98 Correct 67 ms 360 KB Output is correct
99 Correct 473 ms 464 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 111 ms 352 KB Output is correct
102 Correct 66 ms 340 KB Output is correct
103 Correct 798 ms 588 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 300 KB Output is correct
106 Correct 1 ms 300 KB Output is correct
107 Correct 72 ms 320 KB Output is correct
108 Correct 77 ms 352 KB Output is correct
109 Correct 507 ms 460 KB Output is correct
110 Correct 493 ms 468 KB Output is correct
111 Correct 0 ms 212 KB Output is correct