oj.uz

Submission #633711

# Submission time Handle Problem Language Result Execution time Memory
633711 2022-08-23T06:28:58 Z 406 Party (INOI20_party) C++17
63 / 100
 3000 ms 1018256 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() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
//char buf[1<<21],*p1,*p2;

/*inline int read() {
	ll x = 0, f = 1; char c;
	while(!isdigit(c = gc())) if(c=='-') f=-1;
	while(isdigit(c)) x = (x<<3)+(x<<1)+(c^48), c = gc();
	return x * f;
}
*/
const ll INFL = 1ll << 60;
const int INF = 1 << 29;
const int N = 62;
const int M = 2 * N;
const int MOD = 1e9 + 7;
const int X = 2.6e8;
//const int X = 1e7;

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


ll pw(ll a, ll b) {
    b %= (MOD - 1);
    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 = 1;
    while (b > X) {
        a = (a * pw2[X]) % MOD;
        b -= X;
    }
    a *= pw2[b];
    return a % MOD;
}

void calc_dist(ll v, ll sub, int lg) {
    for (int k = lg; k < 62; k++) {
        int x = k - lg;
        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, ll sub, int lg) {
    if (v > n) {
        ptr--;
        return;
    }
    //cout << "C: " << v << ' ' << sub << " PTR: " << ptr << '\n';
    calc_dist(v, sub, lg);

    pass();
    Complete(v << 1, sub >> 1, lg + 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--;
}

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

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

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

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

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

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

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

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

    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;
    cin >> query;
    while (query--) {
        cin >> n;

        F(1, n, 1);
        ll re = pw(2, 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 1423 ms 1017932 KB Output is correct
2 Correct 1490 ms 1017888 KB Output is correct
3 Correct 1477 ms 1017932 KB Output is correct
4 Correct 1506 ms 1017848 KB Output is correct
5 Correct 1389 ms 1017928 KB Output is correct
6 Correct 1439 ms 1017832 KB Output is correct
7 Correct 1539 ms 1017920 KB Output is correct
8 Correct 1442 ms 1017856 KB Output is correct
9 Correct 1494 ms 1017876 KB Output is correct
10 Correct 1410 ms 1017940 KB Output is correct
11 Correct 1422 ms 1017876 KB Output is correct
12 Correct 1421 ms 1017956 KB Output is correct
13 Correct 1425 ms 1017848 KB Output is correct
14 Correct 1392 ms 1017876 KB Output is correct
15 Correct 1566 ms 1017908 KB Output is correct
16 Correct 1522 ms 1017944 KB Output is correct
17 Correct 1448 ms 1017912 KB Output is correct
18 Correct 1434 ms 1017896 KB Output is correct
19 Correct 1416 ms 1017948 KB Output is correct
20 Correct 1420 ms 1017992 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1425 ms 1018012 KB Output is correct
2 Correct 1394 ms 1017948 KB Output is correct
3 Correct 1459 ms 1017940 KB Output is correct
4 Correct 1443 ms 1018020 KB Output is correct
5 Correct 1416 ms 1017936 KB Output is correct
6 Correct 1424 ms 1018016 KB Output is correct
7 Correct 1411 ms 1017940 KB Output is correct
8 Correct 1407 ms 1017996 KB Output is correct
9 Correct 1439 ms 1017972 KB Output is correct
10 Correct 1488 ms 1018000 KB Output is correct
11 Correct 1573 ms 1018172 KB Output is correct
12 Correct 1589 ms 1018092 KB Output is correct
13 Correct 1594 ms 1018044 KB Output is correct
14 Correct 1751 ms 1018040 KB Output is correct
15 Correct 1836 ms 1018056 KB Output is correct
16 Correct 1706 ms 1018052 KB Output is correct
17 Correct 1577 ms 1018044 KB Output is correct
18 Correct 1572 ms 1018056 KB Output is correct
19 Correct 1535 ms 1018016 KB Output is correct
20 Correct 1578 ms 1018052 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1516 ms 1018148 KB Output is correct
2 Correct 1545 ms 1018040 KB Output is correct
3 Correct 1533 ms 1018032 KB Output is correct
4 Correct 1506 ms 1017976 KB Output is correct
5 Correct 1511 ms 1018048 KB Output is correct
6 Correct 1499 ms 1018040 KB Output is correct
7 Correct 1523 ms 1018032 KB Output is correct
8 Correct 1716 ms 1018036 KB Output is correct
9 Correct 1398 ms 1017980 KB Output is correct
10 Correct 1408 ms 1017972 KB Output is correct
11 Correct 1472 ms 1018060 KB Output is correct
12 Correct 1419 ms 1018092 KB Output is correct
13 Correct 1774 ms 1018036 KB Output is correct
14 Correct 1773 ms 1018088 KB Output is correct
15 Correct 1793 ms 1018088 KB Output is correct
16 Correct 1859 ms 1017980 KB Output is correct
17 Correct 1415 ms 1017948 KB Output is correct
18 Correct 1363 ms 1018140 KB Output is correct
19 Correct 1392 ms 1018112 KB Output is correct
20 Correct 1361 ms 1018032 KB Output is correct

Subtask #4
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1423 ms 1017932 KB Output is correct
2 Correct 1490 ms 1017888 KB Output is correct
3 Correct 1477 ms 1017932 KB Output is correct
4 Correct 1506 ms 1017848 KB Output is correct
5 Correct 1389 ms 1017928 KB Output is correct
6 Correct 1439 ms 1017832 KB Output is correct
7 Correct 1539 ms 1017920 KB Output is correct
8 Correct 1442 ms 1017856 KB Output is correct
9 Correct 1494 ms 1017876 KB Output is correct
10 Correct 1410 ms 1017940 KB Output is correct
11 Correct 1422 ms 1017876 KB Output is correct
12 Correct 1421 ms 1017956 KB Output is correct
13 Correct 1425 ms 1017848 KB Output is correct
14 Correct 1392 ms 1017876 KB Output is correct
15 Correct 1566 ms 1017908 KB Output is correct
16 Correct 1522 ms 1017944 KB Output is correct
17 Correct 1448 ms 1017912 KB Output is correct
18 Correct 1434 ms 1017896 KB Output is correct
19 Correct 1416 ms 1017948 KB Output is correct
20 Correct 1420 ms 1017992 KB Output is correct
21 Correct 1425 ms 1018012 KB Output is correct
22 Correct 1394 ms 1017948 KB Output is correct
23 Correct 1459 ms 1017940 KB Output is correct
24 Correct 1443 ms 1018020 KB Output is correct
25 Correct 1416 ms 1017936 KB Output is correct
26 Correct 1424 ms 1018016 KB Output is correct
27 Correct 1411 ms 1017940 KB Output is correct
28 Correct 1407 ms 1017996 KB Output is correct
29 Correct 1439 ms 1017972 KB Output is correct
30 Correct 1488 ms 1018000 KB Output is correct
31 Correct 1573 ms 1018172 KB Output is correct
32 Correct 1589 ms 1018092 KB Output is correct
33 Correct 1594 ms 1018044 KB Output is correct
34 Correct 1751 ms 1018040 KB Output is correct
35 Correct 1836 ms 1018056 KB Output is correct
36 Correct 1706 ms 1018052 KB Output is correct
37 Correct 1577 ms 1018044 KB Output is correct
38 Correct 1572 ms 1018056 KB Output is correct
39 Correct 1535 ms 1018016 KB Output is correct
40 Correct 1578 ms 1018052 KB Output is correct
41 Correct 1516 ms 1018148 KB Output is correct
42 Correct 1545 ms 1018040 KB Output is correct
43 Correct 1533 ms 1018032 KB Output is correct
44 Correct 1506 ms 1017976 KB Output is correct
45 Correct 1511 ms 1018048 KB Output is correct
46 Correct 1499 ms 1018040 KB Output is correct
47 Correct 1523 ms 1018032 KB Output is correct
48 Correct 1716 ms 1018036 KB Output is correct
49 Correct 1398 ms 1017980 KB Output is correct
50 Correct 1408 ms 1017972 KB Output is correct
51 Correct 1472 ms 1018060 KB Output is correct
52 Correct 1419 ms 1018092 KB Output is correct
53 Correct 1774 ms 1018036 KB Output is correct
54 Correct 1773 ms 1018088 KB Output is correct
55 Correct 1793 ms 1018088 KB Output is correct
56 Correct 1859 ms 1017980 KB Output is correct
57 Correct 1415 ms 1017948 KB Output is correct
58 Correct 1363 ms 1018140 KB Output is correct
59 Correct 1392 ms 1018112 KB Output is correct
60 Correct 1361 ms 1018032 KB Output is correct
61 Correct 1360 ms 1017852 KB Output is correct
62 Correct 1373 ms 1017960 KB Output is correct
63 Correct 2285 ms 1018036 KB Output is correct
64 Correct 2276 ms 1018084 KB Output is correct
65 Correct 2255 ms 1018064 KB Output is correct
66 Correct 2215 ms 1018184 KB Output is correct
67 Correct 2234 ms 1018072 KB Output is correct
68 Correct 2260 ms 1018256 KB Output is correct
69 Correct 2215 ms 1018044 KB Output is correct
70 Correct 2216 ms 1018060 KB Output is correct
71 Correct 1329 ms 1018180 KB Output is correct
72 Correct 1331 ms 1018072 KB Output is correct
73 Correct 1461 ms 1018156 KB Output is correct
74 Correct 1400 ms 1018120 KB Output is correct
75 Execution timed out 3144 ms 1018128 KB Time limit exceeded
76 Halted 0 ms 0 KB -