oj.uz

Submission #633714

# Submission time Handle Problem Language Result Execution time Memory
633714 2022-08-23T06:48:21 Z 406 Party (INOI20_party) C++17
63 / 100
 3000 ms 1026164 KB 
#include <bits/stdc++.h>
using ll = long long;
using namespace std;

#define forn(a, b) for (int a = 0; a < (b); a++)
#define rofn(a, b) for (int a = (b) - 1; a >= 0; a--)
#define LOG(a) (63 - __builtin_clzll(a))
#define chmx(a, b) a = max(a, b)
#define chmn(a, b) a = min(a, b)
#define pb push_back
#define gc() (pt1==pt2&&(pt2=(pt1=buf)+fread(buf,1,1<<21,stdin),pt1==pt2)?EOF:*pt1++)
char buf[1<<21],*pt1,*pt2;

inline ll read() {
	ll x = 0;char c;
	while(!isdigit(c = gc()));
	while(isdigit(c)) x = (x<<3)+(x<<1)+(c^48), c = gc();
	return x;
}

const ll INFL = 1ll << 60;
const int INF = 1 << 29;
const int N = 61;
const int M = 2 * N;
const int MOD = 1e9 + 7;
const int X = 2.62e8;

ll d[2][M][M], n;
int ptr, ans, q;
int pw2[X + 1];

ll pw(ll a, int b) {
    ll re = 1;
    while (b) {
        if (b & 1)
            re = (re * a) % MOD;
        a = (a * a) % MOD;
        b >>= 1;
    }
    return re;
}

ll p2(ll b) {
    b %= (MOD - 1);
    ll a = pw(pw2[X], b / X) * pw2[b % X];
    return a % MOD;
}

void calc_dist(ll v) {
    for (int k = LOG(v) + 1; k < N; k++) {
        int x = k - LOG(v) - 1;
        if ((v << x) > n)
            d[1][ptr][x] = 0;
        else
            d[1][ptr][x] = min(n - (v << x) + 1, ((ll)1 << x));
    }
    if (v > 1) {
        for (int k = 2; k < N; k++)
            d[0][ptr][k] -= d[1][ptr][k - 2];
    }
}

void pass() {
    for (int k = 1; k < M; k++)
        d[0][ptr + 1][k] = d[0][ptr][k - 1] + d[1][ptr][k - 1];
    ptr++;
}

void Complete(ll v) {
    if (v > n) {
        ptr--;
        return;
    }
    //cout << "C: " << v << ' ' << sub << " PTR: " << ptr << '\n';
    calc_dist(v);

    pass();
    Complete(v << 1);
    q <<= 1;
    if (q >= MOD)
        q -= MOD;

    ll s = 0;
    for (int k = 0; s != n; k++) {
        s += d[0][ptr][k] + d[1][ptr][k];
        q += p2(n - s) - 1;
        if (q >= MOD)
            q -= MOD;
    }
    ptr--;
}

int solve(ll a, ll b) {
    int x = LOG(b) - LOG(a);
    a <<= x;
    return x + (a <= b);
}

void F(ll v, ll sub) {
    if (v > n) {
        ptr--;
        return;
    }

    if (((sub) & (sub + 1)) == 0) {
        q = 0;
        Complete(v);
        ans += q;
        if (ans >= MOD)
            ans -= MOD;
        return;
    }

    //cout << "F: " << v << ' ' << sub << " PTR: " << ptr << '\n';
    calc_dist(v);

    ll r = (v << 1) | 1;
    ll l = (v << 1);
    int cntr = solve(r, n), cntl = solve(l, n);

    if (cntr == cntl) {
        q = 0;
        pass();
        Complete(v << 1);
        ans += q;
        ans %= MOD;

        pass();
        F((v << 1) | 1, sub - (1ll << cntl));
    }
    else {
        q = 0;
        pass();
        Complete((v << 1) | 1);

        ans += q;
        if (ans >= MOD)
            ans -= MOD;

        pass();
        F((v << 1), sub - (1ll << cntr));
    }
    

    ll s = 0;
    for (int k = 0; s != n; k++) {
        s += d[0][ptr][k] + d[1][ptr][k];
        ans += p2(n - s) - 1;
        if (ans >= MOD)
            ans -= MOD;
    }
    ptr--;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);

    pw2[0] = 1;
    for (int i = 1; i <= X; i++) {
        pw2[i] = pw2[i - 1] * 2;
        if (pw2[i] >= MOD)
            pw2[i] -= MOD;
    }

    int query = read();
    //cin >> query;
    while (query--) {
        //cin >> n;
        n = read();

        F(1, n);
        ll re = p2(n) - 1;

        ans = (ans * pw(re, MOD - 2)) % MOD;
        cout << ans << '\n';

        ans = q = ptr = 0;
    }
    return 0;
}
//assert
//yaddasht
//nim saat dar ye vaziat
//checkpoint
//f ha ro benvisim

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1628 ms 1025812 KB Output is correct
2 Correct 1306 ms 1025796 KB Output is correct
3 Correct 1296 ms 1025856 KB Output is correct
4 Correct 1301 ms 1025724 KB Output is correct
5 Correct 1276 ms 1025880 KB Output is correct
6 Correct 1295 ms 1025964 KB Output is correct
7 Correct 1289 ms 1025744 KB Output is correct
8 Correct 1284 ms 1025772 KB Output is correct
9 Correct 1296 ms 1025784 KB Output is correct
10 Correct 1314 ms 1025784 KB Output is correct
11 Correct 1304 ms 1025716 KB Output is correct
12 Correct 1285 ms 1025712 KB Output is correct
13 Correct 1328 ms 1025816 KB Output is correct
14 Correct 1326 ms 1025748 KB Output is correct
15 Correct 1301 ms 1025900 KB Output is correct
16 Correct 1294 ms 1025788 KB Output is correct
17 Correct 1318 ms 1025880 KB Output is correct
18 Correct 1295 ms 1025828 KB Output is correct
19 Correct 1324 ms 1025852 KB Output is correct
20 Correct 1299 ms 1025684 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1294 ms 1025908 KB Output is correct
2 Correct 1293 ms 1025876 KB Output is correct
3 Correct 1290 ms 1025904 KB Output is correct
4 Correct 1269 ms 1025824 KB Output is correct
5 Correct 1429 ms 1025800 KB Output is correct
6 Correct 1281 ms 1025768 KB Output is correct
7 Correct 1279 ms 1025916 KB Output is correct
8 Correct 1265 ms 1025804 KB Output is correct
9 Correct 1271 ms 1025960 KB Output is correct
10 Correct 1270 ms 1025880 KB Output is correct
11 Correct 1421 ms 1025928 KB Output is correct
12 Correct 1419 ms 1026000 KB Output is correct
13 Correct 1417 ms 1025920 KB Output is correct
14 Correct 1413 ms 1025972 KB Output is correct
15 Correct 1421 ms 1025964 KB Output is correct
16 Correct 1421 ms 1025888 KB Output is correct
17 Correct 1431 ms 1026092 KB Output is correct
18 Correct 1421 ms 1026016 KB Output is correct
19 Correct 1412 ms 1025860 KB Output is correct
20 Correct 1418 ms 1026036 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1390 ms 1026016 KB Output is correct
2 Correct 1402 ms 1025968 KB Output is correct
3 Correct 1379 ms 1025768 KB Output is correct
4 Correct 1398 ms 1026044 KB Output is correct
5 Correct 1399 ms 1026000 KB Output is correct
6 Correct 1692 ms 1025948 KB Output is correct
7 Correct 1415 ms 1025864 KB Output is correct
8 Correct 1410 ms 1025960 KB Output is correct
9 Correct 1280 ms 1025880 KB Output is correct
10 Correct 1280 ms 1025872 KB Output is correct
11 Correct 1285 ms 1025904 KB Output is correct
12 Correct 1286 ms 1025904 KB Output is correct
13 Correct 1747 ms 1025880 KB Output is correct
14 Correct 1745 ms 1025936 KB Output is correct
15 Correct 1757 ms 1026072 KB Output is correct
16 Correct 1762 ms 1025944 KB Output is correct
17 Correct 1319 ms 1025808 KB Output is correct
18 Correct 1299 ms 1025876 KB Output is correct
19 Correct 1294 ms 1025952 KB Output is correct
20 Correct 1295 ms 1025892 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1628 ms 1025812 KB Output is correct
2 Correct 1306 ms 1025796 KB Output is correct
3 Correct 1296 ms 1025856 KB Output is correct
4 Correct 1301 ms 1025724 KB Output is correct
5 Correct 1276 ms 1025880 KB Output is correct
6 Correct 1295 ms 1025964 KB Output is correct
7 Correct 1289 ms 1025744 KB Output is correct
8 Correct 1284 ms 1025772 KB Output is correct
9 Correct 1296 ms 1025784 KB Output is correct
10 Correct 1314 ms 1025784 KB Output is correct
11 Correct 1304 ms 1025716 KB Output is correct
12 Correct 1285 ms 1025712 KB Output is correct
13 Correct 1328 ms 1025816 KB Output is correct
14 Correct 1326 ms 1025748 KB Output is correct
15 Correct 1301 ms 1025900 KB Output is correct
16 Correct 1294 ms 1025788 KB Output is correct
17 Correct 1318 ms 1025880 KB Output is correct
18 Correct 1295 ms 1025828 KB Output is correct
19 Correct 1324 ms 1025852 KB Output is correct
20 Correct 1299 ms 1025684 KB Output is correct
21 Correct 1294 ms 1025908 KB Output is correct
22 Correct 1293 ms 1025876 KB Output is correct
23 Correct 1290 ms 1025904 KB Output is correct
24 Correct 1269 ms 1025824 KB Output is correct
25 Correct 1429 ms 1025800 KB Output is correct
26 Correct 1281 ms 1025768 KB Output is correct
27 Correct 1279 ms 1025916 KB Output is correct
28 Correct 1265 ms 1025804 KB Output is correct
29 Correct 1271 ms 1025960 KB Output is correct
30 Correct 1270 ms 1025880 KB Output is correct
31 Correct 1421 ms 1025928 KB Output is correct
32 Correct 1419 ms 1026000 KB Output is correct
33 Correct 1417 ms 1025920 KB Output is correct
34 Correct 1413 ms 1025972 KB Output is correct
35 Correct 1421 ms 1025964 KB Output is correct
36 Correct 1421 ms 1025888 KB Output is correct
37 Correct 1431 ms 1026092 KB Output is correct
38 Correct 1421 ms 1026016 KB Output is correct
39 Correct 1412 ms 1025860 KB Output is correct
40 Correct 1418 ms 1026036 KB Output is correct
41 Correct 1390 ms 1026016 KB Output is correct
42 Correct 1402 ms 1025968 KB Output is correct
43 Correct 1379 ms 1025768 KB Output is correct
44 Correct 1398 ms 1026044 KB Output is correct
45 Correct 1399 ms 1026000 KB Output is correct
46 Correct 1692 ms 1025948 KB Output is correct
47 Correct 1415 ms 1025864 KB Output is correct
48 Correct 1410 ms 1025960 KB Output is correct
49 Correct 1280 ms 1025880 KB Output is correct
50 Correct 1280 ms 1025872 KB Output is correct
51 Correct 1285 ms 1025904 KB Output is correct
52 Correct 1286 ms 1025904 KB Output is correct
53 Correct 1747 ms 1025880 KB Output is correct
54 Correct 1745 ms 1025936 KB Output is correct
55 Correct 1757 ms 1026072 KB Output is correct
56 Correct 1762 ms 1025944 KB Output is correct
57 Correct 1319 ms 1025808 KB Output is correct
58 Correct 1299 ms 1025876 KB Output is correct
59 Correct 1294 ms 1025952 KB Output is correct
60 Correct 1295 ms 1025892 KB Output is correct
61 Correct 1260 ms 1025660 KB Output is correct
62 Correct 1276 ms 1025864 KB Output is correct
63 Correct 2511 ms 1026028 KB Output is correct
64 Correct 2499 ms 1025968 KB Output is correct
65 Correct 2572 ms 1025916 KB Output is correct
66 Correct 2849 ms 1026164 KB Output is correct
67 Correct 2582 ms 1026000 KB Output is correct
68 Correct 2602 ms 1026008 KB Output is correct
69 Correct 2562 ms 1026004 KB Output is correct
70 Correct 2676 ms 1025912 KB Output is correct
71 Correct 1340 ms 1026084 KB Output is correct
72 Correct 1327 ms 1026020 KB Output is correct
73 Correct 1423 ms 1025928 KB Output is correct
74 Correct 1445 ms 1025976 KB Output is correct
75 Execution timed out 3145 ms 1025980 KB Time limit exceeded
76 Halted 0 ms 0 KB -