oj.uz

Submission #383693

# Submission time Handle Problem Language Result Execution time Memory
383693 2021-03-30T14:58:01 Z LittleCube Cave (IOI13_cave) C++14
100 / 100
 885 ms 640 KB 
/*  | |       _    _  | |        _____       | |
//  | |   _  | |  | | | | _____ /  ___|__  __| |___  _____
//  | |  |_|[   ][   ]| |/  _  \| |    | | | |  _  \/  _  \  
//  | L__| | | |_ | |_| || ____|| |___ | |_| | |_| || ____|
//  L____|_| |___||___|_|\_____|\_____|\_____/\____/\_____|
//  Segment Tree is hard.
*/
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
//#pragma pack(0)
//#define int long long
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
//#define S second
#define pb(x) emplace_back(x)
#define MOD 1000000007
#define MOD2 998244353
#define _INFINITY 9223372036854775807
//#define fast ios::sync_with_stdio(0), cin.tie(0)
using namespace std;

#include "cave.h"

int n, comb[5005], match[5005];

int bs(int l, int r, int i, int state)
{
    if (l == r)
        return l;
    int mid = (l + r) / 2;
    int *attempt = new int[n];

    for (int j = 0; j < l; j++)
        if (comb[j] != -1)
            attempt[j] = comb[j];
    for (int j = l; j <= mid; j++)
        if (comb[j] == -1)
            attempt[j] = state;
        else
            attempt[j] = comb[j];
    for (int j = mid + 1; j <= r; j++)
        if (comb[j] == -1)
            attempt[j] = state ^ 1;
        else
            attempt[j] = comb[j];
    for (int j = r + 1; j < n; j++)
        if (comb[j] != -1)
            attempt[j] = comb[j];
    int verdict = tryCombination(attempt);
    //for (int i = 0; i < n;i++)
    //    cerr << attempt[i] << " ";
    //cerr << "  " << verdict << '\n';
    delete[] attempt;
    if (verdict == i)
        return bs(mid + 1, r, i, state);
    else
        return bs(l, mid, i, state);
}

void exploreCave(int N)
{
    n = N;
    for (int i = 0; i < n; i++)
        match[i] = comb[i] = -1;

    for (int i = 0; i < n; i++)
    {
        int *attempt = new int[n];
        for (int j = 0; j < n; j++)
            if (comb[j] == -1)
                attempt[j] = 0;
            else
                attempt[j] = comb[j];
                
        int verdict = tryCombination(attempt), state, pos;
        if (verdict == i)
            state = 1;
        else
            state = 0;
        pos = bs(0, n - 1, i, state);
        //cerr << i << "->" << pos << ":" << state << '\n';
        comb[pos] = state;
        match[pos] = i;
        delete[] attempt;
    }
    int *S = new int[n];
    int *D = new int[n];
    for (int i = 0; i < n; i++)
        S[i] = comb[i], D[i] = match[i];
    answer(S, D);
    delete[] S;
    delete[] D;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 492 KB Output is correct
2 Correct 290 ms 492 KB Output is correct
3 Correct 438 ms 384 KB Output is correct
4 Correct 301 ms 620 KB Output is correct
5 Correct 448 ms 620 KB Output is correct
6 Correct 445 ms 620 KB Output is correct
7 Correct 458 ms 620 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 431 ms 492 KB Output is correct
13 Correct 437 ms 512 KB Output is correct
14 Correct 462 ms 620 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 512 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 514 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 457 ms 620 KB Output is correct
7 Correct 528 ms 620 KB Output is correct
8 Correct 885 ms 512 KB Output is correct
9 Correct 866 ms 620 KB Output is correct
10 Correct 861 ms 620 KB Output is correct
11 Correct 518 ms 492 KB Output is correct

Subtask #3
21.0 / 21.0

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

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 64 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 105 ms 364 KB Output is correct
24 Correct 110 ms 384 KB Output is correct
25 Correct 109 ms 492 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 65 ms 492 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 87 ms 364 KB Output is correct
31 Correct 64 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 2 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 106 ms 364 KB Output is correct
36 Correct 108 ms 512 KB Output is correct
37 Correct 1 ms 364 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 492 KB Output is correct
2 Correct 290 ms 492 KB Output is correct
3 Correct 438 ms 384 KB Output is correct
4 Correct 301 ms 620 KB Output is correct
5 Correct 448 ms 620 KB Output is correct
6 Correct 445 ms 620 KB Output is correct
7 Correct 458 ms 620 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 431 ms 492 KB Output is correct
13 Correct 437 ms 512 KB Output is correct
14 Correct 462 ms 620 KB Output is correct
15 Correct 452 ms 512 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 514 ms 512 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 457 ms 620 KB Output is correct
21 Correct 528 ms 620 KB Output is correct
22 Correct 885 ms 512 KB Output is correct
23 Correct 866 ms 620 KB Output is correct
24 Correct 861 ms 620 KB Output is correct
25 Correct 518 ms 492 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 2 ms 364 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 64 ms 364 KB Output is correct
46 Correct 1 ms 364 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 105 ms 364 KB Output is correct
49 Correct 110 ms 384 KB Output is correct
50 Correct 109 ms 492 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 65 ms 492 KB Output is correct
54 Correct 1 ms 364 KB Output is correct
55 Correct 87 ms 364 KB Output is correct
56 Correct 64 ms 364 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 2 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 106 ms 364 KB Output is correct
61 Correct 108 ms 512 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 287 ms 620 KB Output is correct
64 Correct 295 ms 528 KB Output is correct
65 Correct 453 ms 640 KB Output is correct
66 Correct 332 ms 620 KB Output is correct
67 Correct 448 ms 492 KB Output is correct
68 Correct 446 ms 512 KB Output is correct
69 Correct 454 ms 492 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 438 ms 492 KB Output is correct
73 Correct 438 ms 492 KB Output is correct
74 Correct 438 ms 620 KB Output is correct
75 Correct 492 ms 492 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 457 ms 548 KB Output is correct
79 Correct 516 ms 492 KB Output is correct
80 Correct 885 ms 548 KB Output is correct
81 Correct 872 ms 620 KB Output is correct
82 Correct 859 ms 620 KB Output is correct
83 Correct 516 ms 620 KB Output is correct
84 Correct 2 ms 364 KB Output is correct
85 Correct 64 ms 364 KB Output is correct
86 Correct 427 ms 620 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 106 ms 364 KB Output is correct
90 Correct 105 ms 364 KB Output is correct
91 Correct 106 ms 464 KB Output is correct
92 Correct 855 ms 620 KB Output is correct
93 Correct 852 ms 620 KB Output is correct
94 Correct 847 ms 620 KB Output is correct
95 Correct 1 ms 364 KB Output is correct
96 Correct 1 ms 364 KB Output is correct
97 Correct 459 ms 620 KB Output is correct
98 Correct 65 ms 364 KB Output is correct
99 Correct 435 ms 620 KB Output is correct
100 Correct 1 ms 364 KB Output is correct
101 Correct 64 ms 364 KB Output is correct
102 Correct 63 ms 364 KB Output is correct
103 Correct 438 ms 492 KB Output is correct
104 Correct 1 ms 364 KB Output is correct
105 Correct 1 ms 364 KB Output is correct
106 Correct 1 ms 364 KB Output is correct
107 Correct 105 ms 364 KB Output is correct
108 Correct 105 ms 364 KB Output is correct
109 Correct 876 ms 620 KB Output is correct
110 Correct 859 ms 492 KB Output is correct
111 Correct 1 ms 364 KB Output is correct