oj.uz

Submission #643445

# Submission time Handle Problem Language Result Execution time Memory
643445 2022-09-22T03:47:21 Z cologne Broken Device 2 (JOI22_device2) C++17
100 / 100
 78 ms 2936 KB 
#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

namespace
{
    const int MAX = 140;
    bool inited = false;
    vector<long long> D(MAX + 1);
    void init()
    {
        if (inited)
            return;
        inited = true;
        D[0] = 1, D[1] = 1, D[2] = 2;
        for (int i = 3; i < MAX; i++)
            D[i] = D[i - 2] + D[i - 3] + 1;
    }
}

int Declare()
{
    init();
    return MAX;
}

pair<vector<int>, vector<int>> Asolve(int sz, long long A)
{
    vector<int> U, V;

    int lst = 0;
    if (A >= D[sz - 1])
    {
        U.push_back(1);
        V.push_back(1);
        A -= D[sz - 1];
        lst = 1;
    }
    else
    {
        U.push_back(0);
        V.push_back(0);
        lst = 0;
    }
    --sz;
    for (int i = 0; i < sz; i++)
        V.push_back(1 - V.back());

    while (sz)
    {
        if (A == 0)
        {
            for (int i = 0; i < sz; i++)
                U.push_back(1 - U.back());
            sz = 0;
            break;
        }
        --A;
        if (lst == 1)
        {
            if (A >= (sz >= 3 ? D[sz - 3] : 0))
            {
                for (int i = 0; i < 2; i++)
                    U.push_back(1);
                A -= (sz >= 3 ? D[sz - 3] : 0);
                sz -= 2;
            }
            else
            {
                lst = 0;
                for (int i = 0; i < 3; i++)
                    U.push_back(0);
                sz -= 3;
            }
        }
        else
        {
            if (A >= (sz >= 2 ? D[sz - 2] : 0))
            {
                lst = 1;
                for (int i = 0; i < 3; i++)
                    U.push_back(1);
                A -= (sz >= 2 ? D[sz - 2] : 0);
                sz -= 3;
            }
            else
            {
                for (int i = 0; i < 2; i++)
                    U.push_back(0);
                sz -= 2;
            }
        }
    }
    return {U, V};
}

pair<vector<int>, vector<int>> Anna(long long A)
{
    --A;
    for (int i = 1; i <= MAX; i++)
    {
        if (A >= 2 * D[i - 1])
            A -= 2 * D[i - 1];
        else
            return Asolve(i, A);
    }
    cerr << A << endl;
    assert(false);
}
#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

namespace
{
    const int MAX = 140;
    bool inited = false;
    vector<long long> D(MAX + 1);
    void init()
    {
        if (inited)
            return;
        inited = true;
        D[0] = 1, D[1] = 1, D[2] = 2;
        for (int i = 3; i < MAX; i++)
            D[i] = D[i - 2] + D[i - 3] + 1;
    }
}

long long bsolve(vector<int> u)
{
    int N = u.size() / 2, rem = N, prv = -1;
    long long ret = -1;

    int state = 0, ulimit = 2, ucount = 1;
    long long uplus = D[rem - 1];
    int dlimit = -2, dcount = 1;
    for (int v : u)
    {
        state += v * 4 - 2;
        if (state == ulimit)
        {
            ret += uplus + 1;
            rem -= ucount;
            ulimit = state + 4;
            ucount = 2;
            uplus = rem >= 3 ? D[rem - 3] : 0;
            dlimit = state - 4;
            dcount = 3;
        }
        else if (state == dlimit)
        {
            ret += 1;
            rem -= dcount;
            ulimit = state + 4;
            ucount = 3;
            uplus = rem >= 2 ? D[rem - 2] : 0;
            dlimit = state - 4;
            dcount = 2;
        }
    }

    return ret;
}

long long Bruno(vector<int> u)
{
    init();
    long long ans = 1;
    for (int i = 1; i < (int)u.size() / 2; i++)
        ans += 2 * D[i - 1];
    return ans + bsolve(u);
}

Compilation message

Bruno.cpp: In function 'long long int bsolve(std::vector<int>)':
Bruno.cpp:23:36: warning: unused variable 'prv' [-Wunused-variable]
   23 |     int N = u.size() / 2, rem = N, prv = -1;
      |                                    ^~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 13 ms 808 KB Output is correct
3 Correct 16 ms 820 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 13 ms 808 KB Output is correct
3 Correct 16 ms 820 KB Output is correct
4 Correct 28 ms 1272 KB Output is correct
5 Correct 24 ms 1284 KB Output is correct
6 Correct 24 ms 1256 KB Output is correct
7 Correct 24 ms 1312 KB Output is correct
8 Correct 28 ms 1264 KB Output is correct
9 Correct 27 ms 1324 KB Output is correct
10 Correct 25 ms 1336 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 13 ms 808 KB Output is correct
3 Correct 16 ms 820 KB Output is correct
4 Correct 28 ms 1272 KB Output is correct
5 Correct 24 ms 1284 KB Output is correct
6 Correct 24 ms 1256 KB Output is correct
7 Correct 24 ms 1312 KB Output is correct
8 Correct 28 ms 1264 KB Output is correct
9 Correct 27 ms 1324 KB Output is correct
10 Correct 25 ms 1336 KB Output is correct
11 Correct 26 ms 1236 KB Output is correct
12 Correct 26 ms 1456 KB Output is correct
13 Correct 26 ms 1312 KB Output is correct
14 Correct 26 ms 1440 KB Output is correct
15 Correct 28 ms 1300 KB Output is correct
16 Correct 26 ms 1388 KB Output is correct
17 Correct 25 ms 1276 KB Output is correct
18 Correct 24 ms 1280 KB Output is correct
19 Correct 24 ms 1416 KB Output is correct
20 Correct 23 ms 1292 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 13 ms 808 KB Output is correct
3 Correct 16 ms 820 KB Output is correct
4 Correct 28 ms 1272 KB Output is correct
5 Correct 24 ms 1284 KB Output is correct
6 Correct 24 ms 1256 KB Output is correct
7 Correct 24 ms 1312 KB Output is correct
8 Correct 28 ms 1264 KB Output is correct
9 Correct 27 ms 1324 KB Output is correct
10 Correct 25 ms 1336 KB Output is correct
11 Correct 26 ms 1236 KB Output is correct
12 Correct 26 ms 1456 KB Output is correct
13 Correct 26 ms 1312 KB Output is correct
14 Correct 26 ms 1440 KB Output is correct
15 Correct 28 ms 1300 KB Output is correct
16 Correct 26 ms 1388 KB Output is correct
17 Correct 25 ms 1276 KB Output is correct
18 Correct 24 ms 1280 KB Output is correct
19 Correct 24 ms 1416 KB Output is correct
20 Correct 23 ms 1292 KB Output is correct
21 Correct 30 ms 1472 KB Output is correct
22 Correct 33 ms 1448 KB Output is correct
23 Correct 36 ms 1556 KB Output is correct
24 Correct 30 ms 1536 KB Output is correct
25 Correct 28 ms 1628 KB Output is correct
26 Correct 30 ms 1456 KB Output is correct
27 Correct 30 ms 1528 KB Output is correct
28 Correct 32 ms 1420 KB Output is correct
29 Correct 33 ms 1384 KB Output is correct
30 Correct 26 ms 1476 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 524 KB Output is correct
2 Correct 13 ms 808 KB Output is correct
3 Correct 16 ms 820 KB Output is correct
4 Correct 28 ms 1272 KB Output is correct
5 Correct 24 ms 1284 KB Output is correct
6 Correct 24 ms 1256 KB Output is correct
7 Correct 24 ms 1312 KB Output is correct
8 Correct 28 ms 1264 KB Output is correct
9 Correct 27 ms 1324 KB Output is correct
10 Correct 25 ms 1336 KB Output is correct
11 Correct 26 ms 1236 KB Output is correct
12 Correct 26 ms 1456 KB Output is correct
13 Correct 26 ms 1312 KB Output is correct
14 Correct 26 ms 1440 KB Output is correct
15 Correct 28 ms 1300 KB Output is correct
16 Correct 26 ms 1388 KB Output is correct
17 Correct 25 ms 1276 KB Output is correct
18 Correct 24 ms 1280 KB Output is correct
19 Correct 24 ms 1416 KB Output is correct
20 Correct 23 ms 1292 KB Output is correct
21 Correct 30 ms 1472 KB Output is correct
22 Correct 33 ms 1448 KB Output is correct
23 Correct 36 ms 1556 KB Output is correct
24 Correct 30 ms 1536 KB Output is correct
25 Correct 28 ms 1628 KB Output is correct
26 Correct 30 ms 1456 KB Output is correct
27 Correct 30 ms 1528 KB Output is correct
28 Correct 32 ms 1420 KB Output is correct
29 Correct 33 ms 1384 KB Output is correct
30 Correct 26 ms 1476 KB Output is correct
31 Correct 39 ms 1944 KB Output is correct
32 Correct 39 ms 2016 KB Output is correct
33 Correct 46 ms 1908 KB Output is correct
34 Correct 47 ms 1952 KB Output is correct
35 Correct 43 ms 2004 KB Output is correct
36 Correct 41 ms 1896 KB Output is correct
37 Correct 38 ms 1976 KB Output is correct
38 Correct 34 ms 1800 KB Output is correct
39 Correct 36 ms 1776 KB Output is correct
40 Correct 36 ms 1812 KB Output is correct

Subtask #6
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 2716 KB Output is correct
2 Correct 64 ms 2936 KB Output is correct
3 Correct 60 ms 2844 KB Output is correct
4 Correct 61 ms 2920 KB Output is correct
5 Correct 78 ms 2892 KB Output is correct
6 Correct 61 ms 2916 KB Output is correct
7 Correct 61 ms 2924 KB Output is correct
8 Correct 61 ms 2916 KB Output is correct
9 Correct 60 ms 2904 KB Output is correct
10 Correct 64 ms 2840 KB Output is correct
11 Correct 67 ms 2840 KB Output is correct
12 Correct 63 ms 2808 KB Output is correct
13 Correct 60 ms 2876 KB Output is correct
14 Correct 60 ms 2860 KB Output is correct
15 Correct 55 ms 2784 KB Output is correct
16 Correct 62 ms 2800 KB Output is correct
17 Correct 66 ms 2848 KB Output is correct
18 Correct 56 ms 2728 KB Output is correct
19 Correct 54 ms 2748 KB Output is correct
20 Correct 55 ms 2708 KB Output is correct