oj.uz

Submission #155512

# Submission time Handle Problem Language Result Execution time Memory
155512 2019-09-28T20:30:04 Z Dasha_Gnedko Chessboard (IZhO18_chessboard) C++14
70 / 100
 1717 ms 4860 KB 
#include <bits/stdc++.h>

//#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#define ll long long
#define ld long double
#define pb push_back
#define F first
#define S second
#define endl '\n'
//#define int long long

using namespace std;

//using namespace __gnu_pbds;
//template <typename T> using ordered_set = tree <T, null_type, less < T >, rb_tree_tag, tree_order_statistics_node_update>;

const int N = 1e5 + 100;
const int M = 21890;
const ll mod = 1e9 + 7;
const ll MOD = 998244353;
const int P = 1336;
const ld eps = 0.000000001;
const int inf = 1e9 + 7;
const ll inff = 1e18 + 7;

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

int l1[N], r1[N], l2[N], r2[N];
int m;
int lp[N];
vector <int> pr;
vector < pair <int, int> > ve;
vector <int> a;

void DFS(int i, ll ch)
{
//    cerr << i << " " << ch << endl;
    if (i == ve.size())
    {
        a.pb(ch);
        return;
    }
    for(int j = 0; j <= ve[i].S; j++)
    {
        if (j == 0) DFS(i + 1, ch);
        else
        {
            ch *= ve[i].F;
            DFS(i + 1, ch);
        }
    }
}

pair <int, pair <ll, ll> > get(ll r, ll x, ll y, int fl)
{
    ll gx = x / r, gy = y / r;
    if (x % r) gx++;
    if (y % r) gy++;

    bool f;

    if (fl == 0)
    {
        if (gx % 2)
        {
            if (gy % 2) f = 0;
            else f = 1;
        }
        else if (gy % 2) f = 1;
        else f = 0;
    }
    else
    {
        if (gx % 2)
        {
            if (gy % 2) f = 1;
            else f = 0;
        }
        else if (gy % 2) f = 0;
        else f = 1;
    }

    ll bx = 1ll * gx * r - x + 1;
    ll by = 1ll * gy * r - y + 1;

    return {f, {bx, by}};

}

ll solve(ll r, ll x1, ll y1, ll x2, ll y2, int fl)
{
    ll gx1 = x1 / r + 1, gx2 = x2 / r;
    if (x1 % r != 1) gx1++;
    if (x1 % r == 0) gx1--;

    ll gy1 = y1 / r + 1, gy2 = y2 / r;
    if (y1 % r != 1) gy1++;
    if (y1 % r == 0) gy1--;

    if (r == 1)
    {
        gx1 = x1;
        gx2 = x2;
        gy1 = y1;
        gy2 = y2;
    }


    if (gx1 > gx2 || gy1 > gy2)
    {

//    cout << "! " << gx1 << " " << gx2 << "     " << gy1 << " " << gy2 << endl;
        if (gx1 > gx2 && gy1 > gy2)
        {
            pair < int, pair <ll, ll> > p;

            ll gx = x1 / r, gy = y1 / r;
            if (x1 % r) gx++;
            if (y1 % r) gy++;

            bool f;

            if (fl == 0)
            {
                if (gx % 2)
                {
                    if (gy % 2) f = 0;
                    else f = 1;
                }
                else if (gy % 2) f = 1;
                else f = 0;
            }
            else
            {
                if (gx % 2)
                {
                    if (gy % 2) f = 1;
                    else f = 0;
                }
                else if (gy % 2) f = 0;
                else f = 1;
            }

            ll bx = 1ll * gx * r - x1 + 1;
            ll by = 1ll * gy * r - y1 + 1;

            p.F = f;
            p.S.F = bx;
            p.S.S = by;
//            cout << x1 << " " << y1 << " " << p.S.F << " " << p.S.S << endl;
            if (x1 + p.S.F > x2 && y1 + p.S.S > y2)
            {
//                cout << x1 << " " << y1 << " " << p.F << endl;
                if (p.F == 0) return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1);
                else return 0;
            }

            if (x1 + p.S.F > x2)
            {
                ll S = 1ll * (x2 - x1 + 1) * p.S.S;
                if (p.F == 0) return S;
                else return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1) - S;
            }

            if (y1 + p.S.S > y2)
            {
                ll S = 1ll * (y2 - y1 + 1) * p.S.F;
                if (p.F == 0) return S;
                else return 1ll * (x2 - x1 + 1) * (y2 - y1 + 1) - S;
            }

            ll v1 = 1ll * p.S.F * p.S.S + 1ll * (x2 - x1 + 1 - p.S.F) * (y2 - y1 + 1 - p.S.S);
            ll v2 = 1ll * (x2 - x1 + 1) * (y2 - y1 + 1) - v1;

//            cout << "!!! " << v1 << " " << v2 << endl;

            if (p.F == 0) return v1;
            else return v2;

        }

        if (gx1 <= gx2)
        {
            pair < int, pair <ll, ll> > p = get(r, x1, y1, fl);

            if (y1 + p.S.S <= y2)
            {
                return solve(r, x1, y1, x2, y1 + p.S.S - 1, fl) + solve(r, x1, y1 + p.S.S, x2, y2, fl);
            }

            ll S = p.S.F * (y2 - y1 + 1);
            ll k = (gx2 - gx1 + 1) / 2;
            S += r * r * k;

            pair < int, pair <ll, ll> > p1 = get(r, gx2 * r + 1, y1, fl);
            if (p1.F == p.F) S += (x2 - gx2 * r) * (y2 - y1 + 1);

            if (p.F == 0) return S;
            else return (x2 - x1 + 1) * (y2 - y1 + 1) - S;
        }

        if (gy1 <= gy2)
        {
            pair < int, pair <ll, ll> > p = get(r, x1, y1, fl);

            if (x1 + p.S.F <= x2)
            {
                return solve(r, x1, y1, x1 + p.S.F - 1, y2, fl) + solve(r, x1 + p.S.F, y1, x2, y2, fl);
            }

            ll S = (x2 - x1 + 1) * p.S.S;
            ll k = (gy2 - gy1 + 1) / 2;
            S += r * r * k;

            pair < int, pair <ll, ll> > p1 = get(r, x1, gy2 * r + 1, fl);
            if (p1.F == p.F) S += (y2 - gy2 * r) * (x2 - x1 + 1);

            if (p.F == 0) return S;
            else return (x2 - x1 + 1) * (y2 - y1 + 1) - S;
        }


        return 0;

    }

    ll stx = 1ll * gx1 * r - r + 1;
    ll ex = 1ll * gx2 * r;

    ll sty = 1ll * gy1 * r - r + 1;
    ll ey = 1ll * gy2 * r;

    ll kolx = (gx2 - gx1 + 1 + 1) / 2;
    ll koly = (gy2 - gy1 + 1 + 1) / 2;

    ll S = 1ll * kolx * koly * r * r;

    kolx = (gx2 - gx1 + 1) / 2;
    koly = (gy2 - gy1 + 1) / 2;

    S += 1ll * kolx * koly * r * r;

    pair < int, pair <ll, ll> > p;

    ll gx = stx / r, gy = sty / r;
    if (stx % r) gx++;
    if (sty % r) gy++;

    bool f;

    if (fl == 0)
    {
        if (gx % 2)
        {
            if (gy % 2) f = 0;
            else f = 1;
        }
        else if (gy % 2) f = 1;
        else f = 0;
    }
    else
    {
        if (gx % 2)
        {
            if (gy % 2) f = 1;
            else f = 0;
        }
        else if (gy % 2) f = 0;
        else f = 1;
    }

    ll bx = 1ll * gx * r - stx + 1;
    ll by = 1ll * gy * r - sty + 1;

    p.F = f;
    p.S.F = bx;
    p.S.S = by;

    ll add = solve(r, x1, y1, stx - 1, y2, fl);
    add += solve(r, ex + 1, y1, x2, y2, fl);
    add += solve(r, stx, y1, ex, sty - 1, fl);
    add += solve(r, stx, ey + 1, ex, y2, fl);

//    cout << p.F << " " << S << endl;

    if (p.F == 0) return S + add;
    else return 1ll * (ex - stx + 1) * (ey - sty + 1) - S + add;

}


int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));

    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);

    ll n;
    cin >> n >> m;

    for(int i = 0; i < m; i++)
    {
        cin >> l1[i] >> r1[i] >> l2[i] >> r2[i];
//        cout << solve(4, l1[i], r1[i], l2[i], r2[i], 1) << endl;
    }

//    cout << get_ans(2, n);
//
//    return 0;

    for(int i = 2; i < N; i++)
    {
        if (lp[i] == 0)
        {
            lp[i] = i;
            pr.pb(i);
        }
        for(int j = 0; j < pr.size() && pr[j] * i < N && pr[j] <= lp[i]; j++)
        {
            lp[pr[j] * i] = pr[j];
        }
    }

    int ch = n, kopn = n;

    while (ch > 1)
    {
//        cerr << ch << endl;3
        int d = lp[ch];
        if (ve.size() && ve.back().F == d) ve.back().S++;
        else ve.pb({d, 1});
        ch /= d;
    }

//    return 0;

    DFS(0, 1);

    ll ans = inff;

    for(auto to: a)
    {
//        cout << to << endl;
        if (to == kopn) continue;

        n = kopn;
        ll r = to;

        ll S = 1ll * n * n;
        n /= r;

        ll kx = 1ll * (n + 1) / 2;
        ll k1 = kx * kx;
        kx = 1ll * n / 2;
        k1 += kx * kx;
        k1 *= r * r;

        ll k2 = S - k1;


        ll v1 = 0, v2 = 0;

        for(int i = 0; i < m; i++)
        {
            ll pl = 1ll * (l2[i] - l1[i] + 1) * (r2[i] - r1[i] + 1);
            ll c1 = solve(r, l1[i], r1[i], l2[i], r2[i], 1);
            ll c2 = solve(r, l1[i], r1[i], l2[i], r2[i], 0);

//        cout << r << " " << solve(r, l1[i], r1[i], l2[i], r2[i], 1) << endl;
            v1 += c1;
            k1 -= (pl - c1);

            v2 += c2;
            k2 -= (pl - c2);
        }

        ans = min(ans, min(v1 + k1, v2 + k2));
    }

    cout << ans;


}

Compilation message

chessboard.cpp: In function 'void DFS(int, long long int)':
chessboard.cpp:44:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (i == ve.size())
         ~~^~~~~~~~~~~~
chessboard.cpp: In function 'int32_t main()':
chessboard.cpp:328:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j = 0; j < pr.size() && pr[j] * i < N && pr[j] <= lp[i]; j++)
                        ~~^~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 3 ms 760 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 3320 KB Output is correct
2 Correct 27 ms 1400 KB Output is correct
3 Correct 60 ms 2428 KB Output is correct
4 Correct 68 ms 2424 KB Output is correct
5 Correct 83 ms 2964 KB Output is correct
6 Correct 56 ms 2360 KB Output is correct
7 Correct 14 ms 1144 KB Output is correct
8 Correct 55 ms 2296 KB Output is correct
9 Correct 135 ms 4384 KB Output is correct
10 Correct 77 ms 2808 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 4 ms 888 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 892 KB Output is correct
9 Correct 4 ms 888 KB Output is correct
10 Correct 4 ms 892 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 5 ms 888 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 5 ms 888 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 888 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 4 ms 888 KB Output is correct
4 Correct 6 ms 888 KB Output is correct
5 Correct 5 ms 888 KB Output is correct
6 Correct 4 ms 888 KB Output is correct
7 Correct 5 ms 888 KB Output is correct
8 Correct 5 ms 892 KB Output is correct
9 Correct 4 ms 888 KB Output is correct
10 Correct 4 ms 892 KB Output is correct
11 Correct 5 ms 1016 KB Output is correct
12 Correct 5 ms 888 KB Output is correct
13 Correct 5 ms 888 KB Output is correct
14 Correct 5 ms 888 KB Output is correct
15 Correct 5 ms 888 KB Output is correct
16 Correct 49 ms 1656 KB Output is correct
17 Correct 119 ms 3584 KB Output is correct
18 Correct 165 ms 4044 KB Output is correct
19 Correct 420 ms 3708 KB Output is correct
20 Correct 523 ms 4088 KB Output is correct
21 Correct 115 ms 3448 KB Output is correct
22 Correct 5 ms 888 KB Output is correct
23 Correct 94 ms 2168 KB Output is correct
24 Correct 152 ms 3832 KB Output is correct
25 Correct 21 ms 1144 KB Output is correct
26 Correct 95 ms 2680 KB Output is correct
27 Correct 133 ms 3164 KB Output is correct
28 Correct 161 ms 3960 KB Output is correct
29 Correct 50 ms 1912 KB Output is correct
30 Correct 8 ms 888 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 3320 KB Output is correct
2 Correct 27 ms 1400 KB Output is correct
3 Correct 60 ms 2428 KB Output is correct
4 Correct 68 ms 2424 KB Output is correct
5 Correct 83 ms 2964 KB Output is correct
6 Correct 56 ms 2360 KB Output is correct
7 Correct 14 ms 1144 KB Output is correct
8 Correct 55 ms 2296 KB Output is correct
9 Correct 135 ms 4384 KB Output is correct
10 Correct 77 ms 2808 KB Output is correct
11 Correct 4 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 4 ms 888 KB Output is correct
14 Correct 6 ms 888 KB Output is correct
15 Correct 5 ms 888 KB Output is correct
16 Correct 4 ms 888 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 892 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 4 ms 892 KB Output is correct
21 Correct 5 ms 1016 KB Output is correct
22 Correct 5 ms 888 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 5 ms 888 KB Output is correct
25 Correct 5 ms 888 KB Output is correct
26 Correct 49 ms 1656 KB Output is correct
27 Correct 119 ms 3584 KB Output is correct
28 Correct 165 ms 4044 KB Output is correct
29 Correct 420 ms 3708 KB Output is correct
30 Correct 523 ms 4088 KB Output is correct
31 Correct 115 ms 3448 KB Output is correct
32 Correct 5 ms 888 KB Output is correct
33 Correct 94 ms 2168 KB Output is correct
34 Correct 152 ms 3832 KB Output is correct
35 Correct 21 ms 1144 KB Output is correct
36 Correct 95 ms 2680 KB Output is correct
37 Correct 133 ms 3164 KB Output is correct
38 Correct 161 ms 3960 KB Output is correct
39 Correct 50 ms 1912 KB Output is correct
40 Correct 8 ms 888 KB Output is correct
41 Correct 351 ms 4176 KB Output is correct
42 Correct 162 ms 4628 KB Output is correct
43 Correct 227 ms 4216 KB Output is correct
44 Correct 158 ms 4508 KB Output is correct
45 Correct 146 ms 4780 KB Output is correct
46 Correct 391 ms 4600 KB Output is correct
47 Correct 128 ms 4344 KB Output is correct
48 Correct 193 ms 4344 KB Output is correct
49 Correct 145 ms 4216 KB Output is correct
50 Correct 1557 ms 4488 KB Output is correct
51 Correct 1671 ms 4804 KB Output is correct
52 Correct 1545 ms 4472 KB Output is correct
53 Correct 1650 ms 4696 KB Output is correct
54 Correct 1524 ms 4408 KB Output is correct
55 Correct 1717 ms 4860 KB Output is correct
56 Correct 1477 ms 4348 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 888 KB Output is correct
2 Correct 3 ms 888 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 4 ms 888 KB Output is correct
5 Correct 3 ms 764 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 3 ms 888 KB Output is correct
8 Correct 3 ms 760 KB Output is correct
9 Correct 94 ms 3320 KB Output is correct
10 Correct 27 ms 1400 KB Output is correct
11 Correct 60 ms 2428 KB Output is correct
12 Correct 68 ms 2424 KB Output is correct
13 Correct 83 ms 2964 KB Output is correct
14 Correct 56 ms 2360 KB Output is correct
15 Correct 14 ms 1144 KB Output is correct
16 Correct 55 ms 2296 KB Output is correct
17 Correct 135 ms 4384 KB Output is correct
18 Correct 77 ms 2808 KB Output is correct
19 Correct 4 ms 888 KB Output is correct
20 Correct 3 ms 888 KB Output is correct
21 Correct 4 ms 888 KB Output is correct
22 Correct 6 ms 888 KB Output is correct
23 Correct 5 ms 888 KB Output is correct
24 Correct 4 ms 888 KB Output is correct
25 Correct 5 ms 888 KB Output is correct
26 Correct 5 ms 892 KB Output is correct
27 Correct 4 ms 888 KB Output is correct
28 Correct 4 ms 892 KB Output is correct
29 Correct 5 ms 1016 KB Output is correct
30 Correct 5 ms 888 KB Output is correct
31 Correct 5 ms 888 KB Output is correct
32 Correct 5 ms 888 KB Output is correct
33 Correct 5 ms 888 KB Output is correct
34 Correct 49 ms 1656 KB Output is correct
35 Correct 119 ms 3584 KB Output is correct
36 Correct 165 ms 4044 KB Output is correct
37 Correct 420 ms 3708 KB Output is correct
38 Correct 523 ms 4088 KB Output is correct
39 Correct 115 ms 3448 KB Output is correct
40 Correct 5 ms 888 KB Output is correct
41 Correct 94 ms 2168 KB Output is correct
42 Correct 152 ms 3832 KB Output is correct
43 Correct 21 ms 1144 KB Output is correct
44 Correct 95 ms 2680 KB Output is correct
45 Correct 133 ms 3164 KB Output is correct
46 Correct 161 ms 3960 KB Output is correct
47 Correct 50 ms 1912 KB Output is correct
48 Correct 8 ms 888 KB Output is correct
49 Correct 351 ms 4176 KB Output is correct
50 Correct 162 ms 4628 KB Output is correct
51 Correct 227 ms 4216 KB Output is correct
52 Correct 158 ms 4508 KB Output is correct
53 Correct 146 ms 4780 KB Output is correct
54 Correct 391 ms 4600 KB Output is correct
55 Correct 128 ms 4344 KB Output is correct
56 Correct 193 ms 4344 KB Output is correct
57 Correct 145 ms 4216 KB Output is correct
58 Correct 1557 ms 4488 KB Output is correct
59 Correct 1671 ms 4804 KB Output is correct
60 Correct 1545 ms 4472 KB Output is correct
61 Correct 1650 ms 4696 KB Output is correct
62 Correct 1524 ms 4408 KB Output is correct
63 Correct 1717 ms 4860 KB Output is correct
64 Correct 1477 ms 4348 KB Output is correct
65 Correct 3 ms 888 KB Output is correct
66 Incorrect 4 ms 888 KB Output isn't correct
67 Halted 0 ms 0 KB -