oj.uz

Submission #565320

# Submission time Handle Problem Language Result Execution time Memory
565320 2022-05-20T16:58:58 Z Sorting Broken Device 2 (JOI22_device2) C++17
40 / 100
 104 ms 3564 KB 
#include "Anna.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int BITS = 60;
static const int C = 3;

static const int LEN = 178;

int Declare() {
    return C * BITS;
}

pair<vector<int>, vector<int>> Anna(ll a) {
    vector<int> v1, v2;
    for(ll i = 0; i < LEN; i += 2){
        v1.push_back(0);
        v1.push_back(1);
    }
    vector<int> seq;
    for(ll i = 0; i < BITS; ++i){
        ll bit = (a >> i) & 1ll;
        seq.push_back(bit);
    }

    ll cnt = 1;
    for(ll i = 1; i <= BITS; ++i){
        if(i == BITS || seq[i] != seq[i - 1]){
            for(ll j = 0; j < 2 * cnt + 1; ++j)
                v2.push_back(seq[i - 1]);
            cnt = 0;
        }
        ++cnt;
    }

    while(v2.size() < LEN)
        v2.push_back(0);

    assert((int)v2.size() == LEN);

    return {v1, v2};
}

#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

static const int BITS = 60;
static const int C = 3;

ll Bruno(vector<int> u) {
    ll curr = 0, prefix = 0, dir = 0;
    vector<ll> bits;
    for(ll i = 0; i < u.size(); ++i){
        prefix += u[i] ? 1 : -1;

        if(dir == -1 && prefix <= curr - (C - 1)){
            bits.push_back(0);
            curr -= C - 1;
            continue;
        }
        if(dir == 1 && prefix >= curr + C - 2){
            bits.push_back(1);
            curr += C - 1;
            continue;
        }

        if(prefix <= curr - C){
            bits.push_back(0);
            curr -= C;
            dir = -1;
        }
        else if(prefix >= curr + C - 1){
            bits.push_back(1);
            curr += C;
            dir = 1;
        }
    }

    ll ans = 0;
    assert(bits.size() >= BITS);
    bits.resize(BITS);
    for(ll i = 0; i < bits.size(); ++i)
        ans += bits[i] << i;
    return ans;
}

Compilation message

Bruno.cpp: In function 'll Bruno(std::vector<int>)':
Bruno.cpp:14:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for(ll i = 0; i < u.size(); ++i){
      |                   ~~^~~~~~~~~~
Bruno.cpp:43:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for(ll i = 0; i < bits.size(); ++i)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 92 ms 3512 KB Output is correct
3 Correct 89 ms 3444 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 92 ms 3512 KB Output is correct
3 Correct 89 ms 3444 KB Output is correct
4 Correct 80 ms 3380 KB Output is correct
5 Correct 79 ms 3380 KB Output is correct
6 Correct 88 ms 3564 KB Output is correct
7 Correct 77 ms 3316 KB Output is correct
8 Correct 80 ms 3384 KB Output is correct
9 Correct 88 ms 3456 KB Output is correct
10 Correct 79 ms 3424 KB Output is correct

Subtask #3
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 92 ms 3512 KB Output is correct
3 Correct 89 ms 3444 KB Output is correct
4 Correct 80 ms 3380 KB Output is correct
5 Correct 79 ms 3380 KB Output is correct
6 Correct 88 ms 3564 KB Output is correct
7 Correct 77 ms 3316 KB Output is correct
8 Correct 80 ms 3384 KB Output is correct
9 Correct 88 ms 3456 KB Output is correct
10 Correct 79 ms 3424 KB Output is correct
11 Correct 76 ms 3332 KB Output is correct
12 Correct 77 ms 3328 KB Output is correct
13 Correct 80 ms 3380 KB Output is correct
14 Correct 87 ms 3396 KB Output is correct
15 Correct 82 ms 3384 KB Output is correct
16 Correct 78 ms 3408 KB Output is correct
17 Correct 79 ms 3456 KB Output is correct
18 Correct 83 ms 3432 KB Output is correct
19 Correct 80 ms 3416 KB Output is correct
20 Correct 79 ms 3448 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 92 ms 3512 KB Output is correct
3 Correct 89 ms 3444 KB Output is correct
4 Correct 80 ms 3380 KB Output is correct
5 Correct 79 ms 3380 KB Output is correct
6 Correct 88 ms 3564 KB Output is correct
7 Correct 77 ms 3316 KB Output is correct
8 Correct 80 ms 3384 KB Output is correct
9 Correct 88 ms 3456 KB Output is correct
10 Correct 79 ms 3424 KB Output is correct
11 Correct 76 ms 3332 KB Output is correct
12 Correct 77 ms 3328 KB Output is correct
13 Correct 80 ms 3380 KB Output is correct
14 Correct 87 ms 3396 KB Output is correct
15 Correct 82 ms 3384 KB Output is correct
16 Correct 78 ms 3408 KB Output is correct
17 Correct 79 ms 3456 KB Output is correct
18 Correct 83 ms 3432 KB Output is correct
19 Correct 80 ms 3416 KB Output is correct
20 Correct 79 ms 3448 KB Output is correct
21 Correct 80 ms 3348 KB Output is correct
22 Correct 82 ms 3504 KB Output is correct
23 Correct 77 ms 3344 KB Output is correct
24 Correct 83 ms 3320 KB Output is correct
25 Correct 78 ms 3372 KB Output is correct
26 Correct 90 ms 3332 KB Output is correct
27 Correct 71 ms 3420 KB Output is correct
28 Correct 77 ms 3368 KB Output is correct
29 Correct 82 ms 3520 KB Output is correct
30 Correct 83 ms 3340 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 516 KB Output is correct
2 Correct 92 ms 3512 KB Output is correct
3 Correct 89 ms 3444 KB Output is correct
4 Correct 80 ms 3380 KB Output is correct
5 Correct 79 ms 3380 KB Output is correct
6 Correct 88 ms 3564 KB Output is correct
7 Correct 77 ms 3316 KB Output is correct
8 Correct 80 ms 3384 KB Output is correct
9 Correct 88 ms 3456 KB Output is correct
10 Correct 79 ms 3424 KB Output is correct
11 Correct 76 ms 3332 KB Output is correct
12 Correct 77 ms 3328 KB Output is correct
13 Correct 80 ms 3380 KB Output is correct
14 Correct 87 ms 3396 KB Output is correct
15 Correct 82 ms 3384 KB Output is correct
16 Correct 78 ms 3408 KB Output is correct
17 Correct 79 ms 3456 KB Output is correct
18 Correct 83 ms 3432 KB Output is correct
19 Correct 80 ms 3416 KB Output is correct
20 Correct 79 ms 3448 KB Output is correct
21 Correct 80 ms 3348 KB Output is correct
22 Correct 82 ms 3504 KB Output is correct
23 Correct 77 ms 3344 KB Output is correct
24 Correct 83 ms 3320 KB Output is correct
25 Correct 78 ms 3372 KB Output is correct
26 Correct 90 ms 3332 KB Output is correct
27 Correct 71 ms 3420 KB Output is correct
28 Correct 77 ms 3368 KB Output is correct
29 Correct 82 ms 3520 KB Output is correct
30 Correct 83 ms 3340 KB Output is correct
31 Correct 80 ms 3332 KB Output is correct
32 Correct 78 ms 3408 KB Output is correct
33 Correct 78 ms 3428 KB Output is correct
34 Correct 80 ms 3444 KB Output is correct
35 Correct 84 ms 3340 KB Output is correct
36 Correct 86 ms 3564 KB Output is correct
37 Correct 73 ms 3328 KB Output is correct
38 Correct 82 ms 3452 KB Output is correct
39 Correct 82 ms 3348 KB Output is correct
40 Correct 104 ms 3376 KB Output is correct

Subtask #6
0 / 60.0

# Verdict Execution time Memory Grader output
1 Partially correct 77 ms 3388 KB Output is partially correct
2 Partially correct 79 ms 3352 KB Output is partially correct
3 Partially correct 97 ms 3344 KB Output is partially correct
4 Partially correct 83 ms 3344 KB Output is partially correct
5 Partially correct 79 ms 3512 KB Output is partially correct
6 Partially correct 77 ms 3284 KB Output is partially correct
7 Partially correct 93 ms 3464 KB Output is partially correct
8 Partially correct 103 ms 3384 KB Output is partially correct
9 Partially correct 79 ms 3488 KB Output is partially correct
10 Partially correct 78 ms 3376 KB Output is partially correct
11 Partially correct 80 ms 3312 KB Output is partially correct
12 Partially correct 83 ms 3320 KB Output is partially correct
13 Partially correct 81 ms 3432 KB Output is partially correct
14 Partially correct 72 ms 3404 KB Output is partially correct
15 Runtime error 2 ms 596 KB Execution killed with signal 6
16 Halted 0 ms 0 KB -