oj.uz

답안 #154104

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154104 2019-09-18T11:14:35 Z dandrozavr Chessboard (IZhO18_chessboard) C++17
70 / 100
 1143 ms 19192 KB 
/*
Uruchamiamy samolot zwiadowczy ( + 500% do wzlamaniej )

/▄/  /█/  /◐/   /▐/   /▌/ /▀/ /░/ /🔥/   choose  own style!

***IT'S OUR LONG WAY TO THE OIILLLL***

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀🔥░░░░░░░░███░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░█▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▀██████████████████████████████████████████████████
░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▄████▄████████ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ █████
░░░░░░░░░░░░░░░░░░░░░░░░░░░▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█████████▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀🔥░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████░░░░░░░░░░░░░░░
*/


//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
//#pragma comment(linker, "/stack:200000000")

#include <bits/stdc++.h>
using namespace std;



#define pb push_back
#define ll long long
#define ld long doubl
#define fi first
#define se second
#define eb emplace_back
#define pii pair < int , int >
#define pipii pair< int, pair < int , int > >
#define TIME clock() * 1.0 / CLOCKS_PER_SEC
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

//#include <ext/pb_ds/detail/standard_policies.hpp>'
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;template <typename T> using ordered_set = tree <T, null_type, less< T >, rb_tree_tag,tree_order_statistics_node_update>;
namespace fastio {template <class T> ostream &operator<<(ostream &os, const vector<T> &container){for (auto &u : container)os << u << " ";return os;}template<class T1, class T2> ostream& operator << (ostream& os, const pair<T1, T2>& p) { return os << p.first << " " << p.second; }template <class T> ostream &operator<<(ostream &os, set<T> const& con) { for (auto &u : con) os << u << " "; return os; }void pr() {}template <typename T, typename... args> void pr(T x, args... tail) { cout << x << " "; pr(tail...);}}using namespace fastio;

const int N = 3e5 + 5;
const int MA = 1e6 + 1;

const int X[4] = {0, 0, 1, -1};
const int Y[4] = {-1, 1, 0, 0};

vector < int > g[N];
ll n, k;
vector < pair < pii , pii > >  q(N);
int x1, yy1, x2, y2;
int kk[4];

void update(pair < pii , pii > q, int len)
{
    x1 = q.fi.fi;
    x2 = q.se.fi;
    yy1 = q.fi.se;
    y2 = q.se.se;

    kk[0] = x1 % len;
    if (kk[0])
        kk[0] = len - kk[0];
    kk[0] = min(kk[0], x2 - x1 + 1);

    kk[1] = (x2 + 1) % len;
    kk[1] = min(kk[1], x2 - x1 + 1);

    kk[2] = yy1 % len;
    if (kk[2])
        kk[2] = len - kk[2];
    kk[2] = min(kk[2], y2 - yy1 + 1);

    kk[3] = (y2 + 1) % len;
    kk[3] = min(kk[3], y2 - yy1 + 1);
}


ll solve(int len)
{
    ll all = n * n;
    ll ans = 0;
    int llen = len * 2;

    vector < pair < pii , pii > >  z = q;

    for (int i = 0; i < n; ++i)
        if (i % llen < len)
            ans += (n / len / 2 + (n / len) % 2) * 1ll * len; else
            ans += (n / len / 2) * 1ll * len;
    for (int i = 0; i < k; ++i)
    {
        //kk[4]
        update(q[i], len);
//        cout<<ans<<endl;

        if (kk[2])
        {
            ll otv = 0;
            if (((x1 % llen < len) + (yy1 % llen < len)) % 2 == 0)
                otv -= kk[0]; else otv += kk[0];
            if (x1 / len != x2 / len || !kk[0])
            if (((x2 % llen < len) + (yy1 % llen < len)) % 2 == 0)
                otv -= kk[1]; else otv += kk[1];

            ll dis = x2 - x1 + 1 - kk[0] - kk[1];
            ll bx = dis / len / 2 + (dis / len) % 2;
            ll mx = dis / len / 2;

            if (((x1 % llen < len) + (yy1 % llen < len)) % 2)
               otv -= len * bx,
               otv += len * mx; else
               otv += len * bx,
               otv -= len * mx;
            ans += otv * kk[2];
            q[i].fi.se += kk[2];
        }

        if (q[i].fi.fi > q[i].se.fi || q[i].fi.se > q[i].se.se) continue;
        update(q[i], len);

//        cout<<kk[0]<<" "<<kk[1]<<" "<<kk[2]<<" "<<kk[3]<<endl;
        if (kk[0])
        {
            ll otv = 0;
            if (((x1 % llen < len) + (y2 % llen < len)) % 2 == 0)
                otv -= kk[3]; else otv += kk[3];
            ll dis = y2 - yy1 + 1 - kk[3];
            ll bx = dis / len / 2 + (dis / len) % 2;
            ll mx = dis / len / 2;
            if (((x1 % llen < len) + (yy1 % llen < len)) % 2)
               otv -= len * bx,
               otv += len * mx; else
               otv += len * bx,
               otv -= len * mx;
            ans += otv * kk[0];
            q[i].fi.fi += kk[0];
        }

        if (q[i].fi.fi > q[i].se.fi || q[i].fi.se > q[i].se.se) continue;
        update(q[i], len);

        if (kk[3])
        {
            ll otv = 0;
            if (((x2 % llen < len) + (y2 % llen < len)) % 2 == 0)
                otv -= kk[1]; else otv += kk[1];
            ll dis = x2 - x1 + 1 - kk[1];
            ll bx = dis / len / 2 + (dis / len) % 2;
            ll mx = dis / len / 2;
            if (((x1 % llen < len) + (y2 % llen < len)) % 2)
               otv -= len * bx,
               otv += len * mx; else
               otv += len * bx,
               otv -= len * mx;
            ans += otv * kk[3];
            q[i].se.se -= kk[3];
        }

        if (q[i].fi.fi > q[i].se.fi || q[i].fi.se > q[i].se.se) continue;
        update(q[i], len);
        if (kk[1])
        {
            ll otv = 0;
            ll dis = y2 - yy1 + 1;
            ll bx = dis / len / 2 + (dis / len) % 2;
            ll mx = dis / len / 2;

            if (((x2 % llen < len) + (yy1 % llen < len)) % 2)
               otv -= len * bx,
               otv += len * mx; else
               otv += len * bx,
               otv -= len * mx;
            ans += otv * kk[1];
            q[i].se.fi -= kk[1];
        }

        if (q[i].fi.fi > q[i].se.fi || q[i].fi.se > q[i].se.se) continue;
        update(q[i], len);

        //right
        ll dx = q[i].se.fi - q[i].fi.fi + 1;
        ll dy = q[i].se.se - q[i].fi.se + 1;
        ll by = dy / len / 2 + (dy / len) % 2;
        ll my = dy / len / 2;
        ll bx = dx / len / 2 + (dx / len) % 2;
        ll mx = dx / len / 2;
        ll alll = dx * dy;
        int nac = (q[i].fi.fi % llen < len) + (q[i].fi.se % llen < len);
//        cout<<len<<" "<<nac<<" "<<dx<<" "<<dy<<" "<<mx<<" "<<my<<" "<<bx<<" "<<by<<" "<<ans<<endl;

        if (nac % 2 == 0)
        {
            ll ch = (bx * by + mx * my) * 1ll * len * len;
            ans -= ch;
            ans += (alll - ch);
        } else
        {
            ll ch = (mx * by + bx * my) * 1ll * len * len;
            ans -= ch;
            ans += (alll - ch);
        }
    }
//    cout<<ans<<endl;
//    cout<<all<<endl;
//    cout<<endl;
    q = z;
    return min(ans, all - ans);
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    #ifdef Estb_probitie
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    cin >> n >> k;

    for (int i = 0; i < k; ++i)
    {
        int x1, x2, yy1, y2;
        cin >> x1 >> yy1 >> x2 >> y2;
        --x1, --x2, --yy1, --y2;
        q[i] = {{x1, yy1}, {x2, y2}};
    }
    ll ans = solve(1);
    for (int i = 2; i * i <= n; ++i)
    if (n % i == 0)
        {
            ans = min(ans, solve(i));
            ans = min(ans, solve(n / i));
        }

    cout << ans;

}

Compilation message

chessboard.cpp: In function 'long long int solve(int)':
chessboard.cpp:113:16: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
             if (x1 / len != x2 / len || !kk[0])
                ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 16760 KB Output is correct
2 Correct 30 ms 16796 KB Output is correct
3 Correct 26 ms 16836 KB Output is correct
4 Correct 26 ms 16764 KB Output is correct
5 Correct 17 ms 16760 KB Output is correct
6 Correct 33 ms 16800 KB Output is correct
7 Correct 28 ms 16800 KB Output is correct
8 Correct 23 ms 16800 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 18272 KB Output is correct
2 Correct 27 ms 17148 KB Output is correct
3 Correct 43 ms 17748 KB Output is correct
4 Correct 42 ms 17656 KB Output is correct
5 Correct 52 ms 18044 KB Output is correct
6 Correct 39 ms 17528 KB Output is correct
7 Correct 24 ms 16892 KB Output is correct
8 Correct 41 ms 17656 KB Output is correct
9 Correct 74 ms 18908 KB Output is correct
10 Correct 51 ms 17912 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16772 KB Output is correct
2 Correct 29 ms 16764 KB Output is correct
3 Correct 35 ms 16800 KB Output is correct
4 Correct 28 ms 16828 KB Output is correct
5 Correct 24 ms 16800 KB Output is correct
6 Correct 25 ms 16800 KB Output is correct
7 Correct 25 ms 16932 KB Output is correct
8 Correct 27 ms 16800 KB Output is correct
9 Correct 25 ms 16800 KB Output is correct
10 Correct 18 ms 16760 KB Output is correct
11 Correct 23 ms 16796 KB Output is correct
12 Correct 19 ms 16732 KB Output is correct
13 Correct 29 ms 16796 KB Output is correct
14 Correct 27 ms 16772 KB Output is correct
15 Correct 24 ms 16800 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 16772 KB Output is correct
2 Correct 29 ms 16764 KB Output is correct
3 Correct 35 ms 16800 KB Output is correct
4 Correct 28 ms 16828 KB Output is correct
5 Correct 24 ms 16800 KB Output is correct
6 Correct 25 ms 16800 KB Output is correct
7 Correct 25 ms 16932 KB Output is correct
8 Correct 27 ms 16800 KB Output is correct
9 Correct 25 ms 16800 KB Output is correct
10 Correct 18 ms 16760 KB Output is correct
11 Correct 23 ms 16796 KB Output is correct
12 Correct 19 ms 16732 KB Output is correct
13 Correct 29 ms 16796 KB Output is correct
14 Correct 27 ms 16772 KB Output is correct
15 Correct 24 ms 16800 KB Output is correct
16 Correct 41 ms 17272 KB Output is correct
17 Correct 60 ms 18228 KB Output is correct
18 Correct 84 ms 18444 KB Output is correct
19 Correct 241 ms 18208 KB Output is correct
20 Correct 262 ms 18440 KB Output is correct
21 Correct 57 ms 18040 KB Output is correct
22 Correct 38 ms 16796 KB Output is correct
23 Correct 67 ms 17436 KB Output is correct
24 Correct 79 ms 18212 KB Output is correct
25 Correct 35 ms 16928 KB Output is correct
26 Correct 58 ms 17696 KB Output is correct
27 Correct 80 ms 17944 KB Output is correct
28 Correct 88 ms 18416 KB Output is correct
29 Correct 34 ms 17328 KB Output is correct
30 Correct 24 ms 16796 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 18272 KB Output is correct
2 Correct 27 ms 17148 KB Output is correct
3 Correct 43 ms 17748 KB Output is correct
4 Correct 42 ms 17656 KB Output is correct
5 Correct 52 ms 18044 KB Output is correct
6 Correct 39 ms 17528 KB Output is correct
7 Correct 24 ms 16892 KB Output is correct
8 Correct 41 ms 17656 KB Output is correct
9 Correct 74 ms 18908 KB Output is correct
10 Correct 51 ms 17912 KB Output is correct
11 Correct 31 ms 16772 KB Output is correct
12 Correct 29 ms 16764 KB Output is correct
13 Correct 35 ms 16800 KB Output is correct
14 Correct 28 ms 16828 KB Output is correct
15 Correct 24 ms 16800 KB Output is correct
16 Correct 25 ms 16800 KB Output is correct
17 Correct 25 ms 16932 KB Output is correct
18 Correct 27 ms 16800 KB Output is correct
19 Correct 25 ms 16800 KB Output is correct
20 Correct 18 ms 16760 KB Output is correct
21 Correct 23 ms 16796 KB Output is correct
22 Correct 19 ms 16732 KB Output is correct
23 Correct 29 ms 16796 KB Output is correct
24 Correct 27 ms 16772 KB Output is correct
25 Correct 24 ms 16800 KB Output is correct
26 Correct 41 ms 17272 KB Output is correct
27 Correct 60 ms 18228 KB Output is correct
28 Correct 84 ms 18444 KB Output is correct
29 Correct 241 ms 18208 KB Output is correct
30 Correct 262 ms 18440 KB Output is correct
31 Correct 57 ms 18040 KB Output is correct
32 Correct 38 ms 16796 KB Output is correct
33 Correct 67 ms 17436 KB Output is correct
34 Correct 79 ms 18212 KB Output is correct
35 Correct 35 ms 16928 KB Output is correct
36 Correct 58 ms 17696 KB Output is correct
37 Correct 80 ms 17944 KB Output is correct
38 Correct 88 ms 18416 KB Output is correct
39 Correct 34 ms 17328 KB Output is correct
40 Correct 24 ms 16796 KB Output is correct
41 Correct 219 ms 18852 KB Output is correct
42 Correct 89 ms 19064 KB Output is correct
43 Correct 136 ms 18848 KB Output is correct
44 Correct 112 ms 19008 KB Output is correct
45 Correct 73 ms 19188 KB Output is correct
46 Correct 240 ms 19040 KB Output is correct
47 Correct 69 ms 18776 KB Output is correct
48 Correct 111 ms 18936 KB Output is correct
49 Correct 83 ms 18808 KB Output is correct
50 Correct 947 ms 18976 KB Output is correct
51 Correct 984 ms 19100 KB Output is correct
52 Correct 948 ms 18940 KB Output is correct
53 Correct 975 ms 19136 KB Output is correct
54 Correct 908 ms 18936 KB Output is correct
55 Correct 1000 ms 19192 KB Output is correct
56 Correct 906 ms 18936 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 16760 KB Output is correct
2 Correct 30 ms 16796 KB Output is correct
3 Correct 26 ms 16836 KB Output is correct
4 Correct 26 ms 16764 KB Output is correct
5 Correct 17 ms 16760 KB Output is correct
6 Correct 33 ms 16800 KB Output is correct
7 Correct 28 ms 16800 KB Output is correct
8 Correct 23 ms 16800 KB Output is correct
9 Correct 56 ms 18272 KB Output is correct
10 Correct 27 ms 17148 KB Output is correct
11 Correct 43 ms 17748 KB Output is correct
12 Correct 42 ms 17656 KB Output is correct
13 Correct 52 ms 18044 KB Output is correct
14 Correct 39 ms 17528 KB Output is correct
15 Correct 24 ms 16892 KB Output is correct
16 Correct 41 ms 17656 KB Output is correct
17 Correct 74 ms 18908 KB Output is correct
18 Correct 51 ms 17912 KB Output is correct
19 Correct 31 ms 16772 KB Output is correct
20 Correct 29 ms 16764 KB Output is correct
21 Correct 35 ms 16800 KB Output is correct
22 Correct 28 ms 16828 KB Output is correct
23 Correct 24 ms 16800 KB Output is correct
24 Correct 25 ms 16800 KB Output is correct
25 Correct 25 ms 16932 KB Output is correct
26 Correct 27 ms 16800 KB Output is correct
27 Correct 25 ms 16800 KB Output is correct
28 Correct 18 ms 16760 KB Output is correct
29 Correct 23 ms 16796 KB Output is correct
30 Correct 19 ms 16732 KB Output is correct
31 Correct 29 ms 16796 KB Output is correct
32 Correct 27 ms 16772 KB Output is correct
33 Correct 24 ms 16800 KB Output is correct
34 Correct 41 ms 17272 KB Output is correct
35 Correct 60 ms 18228 KB Output is correct
36 Correct 84 ms 18444 KB Output is correct
37 Correct 241 ms 18208 KB Output is correct
38 Correct 262 ms 18440 KB Output is correct
39 Correct 57 ms 18040 KB Output is correct
40 Correct 38 ms 16796 KB Output is correct
41 Correct 67 ms 17436 KB Output is correct
42 Correct 79 ms 18212 KB Output is correct
43 Correct 35 ms 16928 KB Output is correct
44 Correct 58 ms 17696 KB Output is correct
45 Correct 80 ms 17944 KB Output is correct
46 Correct 88 ms 18416 KB Output is correct
47 Correct 34 ms 17328 KB Output is correct
48 Correct 24 ms 16796 KB Output is correct
49 Correct 219 ms 18852 KB Output is correct
50 Correct 89 ms 19064 KB Output is correct
51 Correct 136 ms 18848 KB Output is correct
52 Correct 112 ms 19008 KB Output is correct
53 Correct 73 ms 19188 KB Output is correct
54 Correct 240 ms 19040 KB Output is correct
55 Correct 69 ms 18776 KB Output is correct
56 Correct 111 ms 18936 KB Output is correct
57 Correct 83 ms 18808 KB Output is correct
58 Correct 947 ms 18976 KB Output is correct
59 Correct 984 ms 19100 KB Output is correct
60 Correct 948 ms 18940 KB Output is correct
61 Correct 975 ms 19136 KB Output is correct
62 Correct 908 ms 18936 KB Output is correct
63 Correct 1000 ms 19192 KB Output is correct
64 Correct 906 ms 18936 KB Output is correct
65 Correct 23 ms 16800 KB Output is correct
66 Correct 23 ms 16832 KB Output is correct
67 Incorrect 1143 ms 19076 KB Output isn't correct
68 Halted 0 ms 0 KB -