oj.uz

답안 #155234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
155234 2019-09-27T07:58:06 Z Dasha_Gnedko Chessboard (IZhO18_chessboard) C++14
47 / 100
 2000 ms 2092 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 = 1e6 + 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;

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 = get(r, x1, y1, fl);
//            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;

        }

        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 = get(r, stx, sty, fl);

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

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

}

ll get_ans(ll r, int n)
{
    ll S = 1ll * n * n;
//    cout << S << endl;

    n /= r;

    ll kx = 1ll * (n + 1) / 2;
//    cerr << kx << " " << kx * kx << endl;
    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);
    }

//    cout << v1 << " " << v2 <<

//    cout << r << " " << v1 << " " << k1 << " " << v2 << " " << k2 << endl;

    return min(v1 + k1, v2 + k2);

}

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);

    int n;
    cin >> n >> m;

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

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

    ll d = 1;
    ll ans = inff;
    while (d * d <= n)
    {
        if (n % d == 0)
        {
            ans = min(ans, get_ans(d, n));
            if (d != 1) ans = min(ans, get_ans(n / d, n));
        }
        d++;
    }

    cout << ans;

}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1420 KB Output is correct
2 Correct 11 ms 632 KB Output is correct
3 Correct 24 ms 960 KB Output is correct
4 Correct 29 ms 1016 KB Output is correct
5 Correct 33 ms 1204 KB Output is correct
6 Correct 22 ms 960 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 22 ms 888 KB Output is correct
9 Correct 55 ms 1912 KB Output is correct
10 Correct 32 ms 1196 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 380 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 26 ms 876 KB Output is correct
17 Correct 48 ms 1768 KB Output is correct
18 Correct 87 ms 1912 KB Output is correct
19 Correct 456 ms 1836 KB Output is correct
20 Correct 502 ms 2012 KB Output is correct
21 Correct 42 ms 1656 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 67 ms 1016 KB Output is correct
24 Correct 77 ms 1784 KB Output is correct
25 Correct 16 ms 532 KB Output is correct
26 Correct 50 ms 1272 KB Output is correct
27 Correct 83 ms 1512 KB Output is correct
28 Correct 82 ms 2092 KB Output is correct
29 Correct 18 ms 888 KB Output is correct
30 Correct 4 ms 376 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 1420 KB Output is correct
2 Correct 11 ms 632 KB Output is correct
3 Correct 24 ms 960 KB Output is correct
4 Correct 29 ms 1016 KB Output is correct
5 Correct 33 ms 1204 KB Output is correct
6 Correct 22 ms 960 KB Output is correct
7 Correct 6 ms 508 KB Output is correct
8 Correct 22 ms 888 KB Output is correct
9 Correct 55 ms 1912 KB Output is correct
10 Correct 32 ms 1196 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 380 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 4 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 26 ms 876 KB Output is correct
27 Correct 48 ms 1768 KB Output is correct
28 Correct 87 ms 1912 KB Output is correct
29 Correct 456 ms 1836 KB Output is correct
30 Correct 502 ms 2012 KB Output is correct
31 Correct 42 ms 1656 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 67 ms 1016 KB Output is correct
34 Correct 77 ms 1784 KB Output is correct
35 Correct 16 ms 532 KB Output is correct
36 Correct 50 ms 1272 KB Output is correct
37 Correct 83 ms 1512 KB Output is correct
38 Correct 82 ms 2092 KB Output is correct
39 Correct 18 ms 888 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 371 ms 1828 KB Output is correct
42 Correct 89 ms 1912 KB Output is correct
43 Correct 200 ms 1656 KB Output is correct
44 Correct 86 ms 1784 KB Output is correct
45 Correct 57 ms 1916 KB Output is correct
46 Correct 519 ms 1788 KB Output is correct
47 Correct 50 ms 1784 KB Output is correct
48 Correct 142 ms 1784 KB Output is correct
49 Correct 80 ms 1656 KB Output is correct
50 Execution timed out 2062 ms 1784 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 38 ms 1420 KB Output is correct
10 Correct 11 ms 632 KB Output is correct
11 Correct 24 ms 960 KB Output is correct
12 Correct 29 ms 1016 KB Output is correct
13 Correct 33 ms 1204 KB Output is correct
14 Correct 22 ms 960 KB Output is correct
15 Correct 6 ms 508 KB Output is correct
16 Correct 22 ms 888 KB Output is correct
17 Correct 55 ms 1912 KB Output is correct
18 Correct 32 ms 1196 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 3 ms 380 KB Output is correct
21 Correct 3 ms 376 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 4 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 3 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 26 ms 876 KB Output is correct
35 Correct 48 ms 1768 KB Output is correct
36 Correct 87 ms 1912 KB Output is correct
37 Correct 456 ms 1836 KB Output is correct
38 Correct 502 ms 2012 KB Output is correct
39 Correct 42 ms 1656 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 67 ms 1016 KB Output is correct
42 Correct 77 ms 1784 KB Output is correct
43 Correct 16 ms 532 KB Output is correct
44 Correct 50 ms 1272 KB Output is correct
45 Correct 83 ms 1512 KB Output is correct
46 Correct 82 ms 2092 KB Output is correct
47 Correct 18 ms 888 KB Output is correct
48 Correct 4 ms 376 KB Output is correct
49 Correct 371 ms 1828 KB Output is correct
50 Correct 89 ms 1912 KB Output is correct
51 Correct 200 ms 1656 KB Output is correct
52 Correct 86 ms 1784 KB Output is correct
53 Correct 57 ms 1916 KB Output is correct
54 Correct 519 ms 1788 KB Output is correct
55 Correct 50 ms 1784 KB Output is correct
56 Correct 142 ms 1784 KB Output is correct
57 Correct 80 ms 1656 KB Output is correct
58 Execution timed out 2062 ms 1784 KB Time limit exceeded
59 Halted 0 ms 0 KB -