QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#666632#7735. Primitive RootricofxWA 9ms3628kbC++201.6kb2024-10-22 19:26:372024-10-22 19:26:50

Judging History

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

  • [2024-10-22 19:26:50]
  • 评测
  • 测评结果:WA
  • 用时:9ms
  • 内存:3628kb
  • [2024-10-22 19:26:37]
  • 提交

answer

//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mod = 998244353;
const int N = 1e5 + 5;

ll n, m;

void MAIN() {
    cin >> n >> m;
    vector<pair<ll, ll>> li;
    ll now = 0, pn = 0, nn = n - 1;
    for (int i = 62; i >= 0; i--) {
        int v = ((m >> i) & 1);
        pn |= (nn & (1ll << i));
        if (v == 0) continue;
        ll r = (now | pn) + (1ll << i) - 2, l = max((now | pn) - 1, 0ll);
        if (l > r) {
            now |= 1ll << i;
            continue;
        }
        l = (l + n - 1) / n; r = r / n;
        if (l <= r) li.push_back({l, r});
        now |= 1ll << i;
    }
    now ^= pn;
    --now;
    if (now % n == 0) li.push_back({now / n, now / n});
    sort(li.begin(), li.end());
    //for (auto [x, y] : li) cout << x << ' ' << y << '\n';
    ll mxt = -1;
    ll ans = 0;
    for (auto [x, y] : li) {
        if (y > mxt) ans += y - max(mxt, x - 1), mxt = y; 
    }
    cout << ans << '\n';
}

int main() {
#ifdef LOCAL
    auto start = chrono::steady_clock::now();
    freopen("miku.in", "r", stdin);
    freopen("miku.out", "w", stdout);
#endif
    ios::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    cin >> T;
    while (T--) MAIN();
#ifdef LOCAL
    auto end = chrono::steady_clock::now();
    cout << "\nqwq: " <<  chrono::duration_cast<chrono::milliseconds>(end - start).count() << "ms\n";
#endif
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3628kb

input:

3
2 0
7 11
1145141 998244353

output:

1
2
872

result:

ok 3 lines

Test #2:

score: -100
Wrong Answer
time: 9ms
memory: 3628kb

input:

47595
2 0
2 1
2 2
2 3
2 4
2 5
2 6
2 7
2 8
2 9
2 10
2 11
2 12
2 13
2 14
2 15
2 16
2 17
2 18
2 19
2 20
2 21
2 22
2 23
2 24
2 25
2 26
2 27
2 28
2 29
2 30
2 31
2 32
2 33
2 34
2 35
2 36
2 37
2 38
2 39
2 40
2 41
2 42
2 43
2 44
2 45
2 46
2 47
2 48
2 49
2 50
2 51
2 52
2 53
2 54
2 55
2 56
2 57
2 58
2 59
2 60...

output:

1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
49
50
50
51
51
52
52
53
53
...

result:

wrong answer 509th lines differ - expected: '3', found: '2'