QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#430345#7560. Computer NetworkpandapythonerTL 1ms3880kbC++201.3kb2024-06-03 18:24:362024-06-03 18:24:36

Judging History

你现在查看的是最新测评结果

  • [2024-06-03 18:24:36]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3880kb
  • [2024-06-03 18:24:36]
  • 提交

answer

#include <bits/stdc++.h>


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()


using namespace std;

const ll inf = 1e18;
mt19937 rnd(234);


int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    int n;
    cin >> n;
    vector<ll> a(n), b(n);
    for (int i = 0; i < n; i += 1) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i += 1) {
        cin >> b[i];
    }
    ll rs = -1;
    for (int k = 0; k < 30; k += 1) {
        ll l = 0;
        ll r = inf;
        for (int i = 0; i < n; i += 1) {
            l = max(l, (b[i] << k) - a[i]);
            r = min(r, (b[i] << k) - a[i] + (1ll << k) - 1);
        }
        if (l > r) {
            continue;
        }
        auto relax = [&](ll x) {
            ll val = (x >> k) + __popcount(x & ((1ll << k) - 1)) + k;
            if (rs == -1 or val < rs) {
                rs = val;
            }
            };
        while (l <= r) {
            relax(l);
            ll dl = l - (l & (l - 1));
            l += dl;
        }
    }
    cout << rs << "\n";
    return 0;
}

/*
5
1 2 3 4 5
6 6 6 6 7


3
2 3 4
1 2 3


2
65536 65537
1 2

*/

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3620kb

input:

5
1 2 3 4 5
6 6 6 6 7

output:

9

result:

ok 1 number(s): "9"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3576kb

input:

3
2 3 4
1 2 3

output:

-1

result:

ok 1 number(s): "-1"

Test #3:

score: 0
Accepted
time: 0ms
memory: 3588kb

input:

2
65536 65537
1 2

output:

32

result:

ok 1 number(s): "32"

Test #4:

score: 0
Accepted
time: 0ms
memory: 3580kb

input:

1
0
28

output:

28

result:

ok 1 number(s): "28"

Test #5:

score: 0
Accepted
time: 0ms
memory: 3508kb

input:

1
249912
43

output:

26

result:

ok 1 number(s): "26"

Test #6:

score: 0
Accepted
time: 1ms
memory: 3584kb

input:

2
52522336 155670
52532336 165670

output:

10000

result:

ok 1 number(s): "10000"

Test #7:

score: 0
Accepted
time: 1ms
memory: 3644kb

input:

2
141839218 538313890
17731054 67290388

output:

1155

result:

ok 1 number(s): "1155"

Test #8:

score: 0
Accepted
time: 0ms
memory: 3644kb

input:

2
678834913 571995689
84855772 71500869

output:

1411

result:

ok 1 number(s): "1411"

Test #9:

score: 0
Accepted
time: 0ms
memory: 3640kb

input:

10
66 0 65 10 40 1 44 29 13 15
84 18 83 28 58 19 62 47 31 33

output:

18

result:

ok 1 number(s): "18"

Test #10:

score: 0
Accepted
time: 0ms
memory: 3880kb

input:

10
0 74752 70656 67584 29696 44032 80896 22528 1024 52224
2 75 71 68 31 45 81 24 3 53

output:

12

result:

ok 1 number(s): "12"

Test #11:

score: 0
Accepted
time: 0ms
memory: 3652kb

input:

10
216 232 28 340 0 44 212 172 268 60
59 63 12 90 5 16 58 48 72 20

output:

7

result:

ok 1 number(s): "7"

Test #12:

score: 0
Accepted
time: 0ms
memory: 3876kb

input:

10
31 36 17 0 61 25 66 0 74 56
47 52 33 16 77 41 82 16 90 72

output:

16

result:

ok 1 number(s): "16"

Test #13:

score: 0
Accepted
time: 0ms
memory: 3840kb

input:

10
17 6 41 68 34 46 32 64 24 0
36 25 60 87 53 65 51 83 43 19

output:

19

result:

ok 1 number(s): "19"

Test #14:

score: -100
Time Limit Exceeded

input:

1000
403 162 111 73 964 795 667 191 80 204 250 672 907 603 523 804 203 729 21 717 788 916 570 41 811 990 730 61 376 162 972 288 12 859 935 290 178 657 199 143 634 417 43 980 232 143 27 669 676 699 215 96 690 293 419 522 841 774 31 875 481 365 402 312 773 882 478 758 345 970 558 174 997 272 557 201 6...

output:


result: