QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#205099	#7560. Computer Network	ucup-team1448^#	TL	1ms	6172kb	C++14	1.2kb	2023-10-07 14:52:05	2023-10-07 14:52:06

Judging History

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

[2023-10-07 14:52:06]
评测

测评结果：TL
用时：1ms
内存：6172kb

查看

[2023-10-07 14:52:05]
提交

answer

#include <bits/stdc++.h>
using namespace std;
template <typename T> void rd(T &x) {
    x = 0;
    int f = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') f = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - 48;
        c = getchar();
    }
    x *= f;
}
template <typename T, typename... T2> void rd(T &x, T2 &...y) {
    rd(x), rd(y...);
}

using ll = long long;
const int Nmax = 1e6 + 5, Vmax = 30;
const ll inf = 1e18;
int n;
ll a[Nmax], b[Nmax], ans = inf;

int main() {
    rd(n);
    for (int i = 1; i <= n; ++i)
        rd(a[i]);
    for (int i = 1; i <= n; ++i)
        rd(b[i]);
    for (int i = 0; i < Vmax; ++i) {
        ll l = 0, r = inf;
        for (int j = 1; j <= n; ++j) {
            l = max(l, (b[j] << i) - a[j]);
            r = min(r, ((b[j] + 1) << i) - a[j]);
            // printf("<%d %d>\n", (b[j] << i) - a[j], ((b[j] + 1) << i) -
            // a[j]);
        }
        // printf("%lld %lld\n", l, r);
        ll mn = inf;
        for (; l < r; l += l & -l)
            mn = min(mn, (l >> i) + __builtin_popcount(l & ((1ll << i) - 1)));
        ans = min(ans, mn + i);
    }
    printf("%lld", ans == inf ? -1 : ans);
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 1ms

memory: 5816kb

input:

5
1 2 3 4 5
6 6 6 6 7

output:

result:

ok 1 number(s): "9"

Test #2:

score: 0

Accepted

time: 1ms

memory: 5888kb

input:

3
2 3 4
1 2 3

output:

-1

result:

ok 1 number(s): "-1"

Test #3:

score: 0

Accepted

time: 1ms

memory: 5760kb

input:

2
65536 65537
1 2

output:

result:

ok 1 number(s): "32"

Test #4:

score: 0

Accepted

time: 1ms

memory: 6172kb

input:

1
0
28

output:

result:

ok 1 number(s): "28"

Test #5:

score: 0

Accepted

time: 1ms

memory: 5812kb

input:

1
249912
43

output:

result:

ok 1 number(s): "26"

Test #6:

score: 0

Accepted

time: 1ms

memory: 6068kb

input:

2
52522336 155670
52532336 165670

output:

result:

ok 1 number(s): "10000"

Test #7:

score: 0

Accepted

time: 0ms

memory: 5812kb

input:

2
141839218 538313890
17731054 67290388

output:

result:

ok 1 number(s): "1155"

Test #8:

score: 0

Accepted

time: 0ms

memory: 5808kb

input:

2
678834913 571995689
84855772 71500869

output:

result:

ok 1 number(s): "1411"

Test #9:

score: 0

Accepted

time: 0ms

memory: 6068kb

input:

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

output:

result:

ok 1 number(s): "18"

Test #10:

score: 0

Accepted

time: 1ms

memory: 5840kb

input:

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

output:

result:

ok 1 number(s): "12"

Test #11:

score: 0

Accepted

time: 1ms

memory: 5812kb

input:

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

output:

result:

ok 1 number(s): "7"

Test #12:

score: 0

Accepted

time: 0ms

memory: 5812kb

input:

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

output:

result:

ok 1 number(s): "16"

Test #13:

score: 0

Accepted

time: 1ms

memory: 5880kb

input:

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

output:

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...