oj.uz

답안 #154284

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154284 2019-09-20T09:32:13 Z dandrozavr Chessboard (IZhO18_chessboard) C++14
70 / 100
 1152 ms 19232 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 ((1 + (yy1 % llen < len)) % 2 == 0)
               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);

        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 == 0)
               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 == 0)
               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);
//        cout<<kk[0]<<" "<<kk[1]<<" "<<kk[2]<<" "<<kk[3]<<endl;
        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 == 0)
               otv -= len * bx,
               otv += len * mx; else
               otv += len * bx,
               otv -= len * mx;
//            cout<<otv<<endl;
            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 19 ms 16760 KB Output is correct
2 Correct 30 ms 16796 KB Output is correct
3 Correct 25 ms 16800 KB Output is correct
4 Correct 25 ms 16800 KB Output is correct
5 Correct 18 ms 16760 KB Output is correct
6 Correct 34 ms 16928 KB Output is correct
7 Correct 23 ms 16800 KB Output is correct
8 Correct 24 ms 16796 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 18272 KB Output is correct
2 Correct 28 ms 17144 KB Output is correct
3 Correct 42 ms 17780 KB Output is correct
4 Correct 43 ms 17656 KB Output is correct
5 Correct 50 ms 18012 KB Output is correct
6 Correct 42 ms 17656 KB Output is correct
7 Correct 23 ms 17020 KB Output is correct
8 Correct 38 ms 17532 KB Output is correct
9 Correct 70 ms 18908 KB Output is correct
10 Correct 47 ms 18040 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16800 KB Output is correct
2 Correct 28 ms 16764 KB Output is correct
3 Correct 30 ms 16844 KB Output is correct
4 Correct 28 ms 16800 KB Output is correct
5 Correct 23 ms 16796 KB Output is correct
6 Correct 26 ms 16800 KB Output is correct
7 Correct 23 ms 16800 KB Output is correct
8 Correct 26 ms 16796 KB Output is correct
9 Correct 23 ms 16800 KB Output is correct
10 Correct 18 ms 16760 KB Output is correct
11 Correct 24 ms 16800 KB Output is correct
12 Correct 18 ms 16760 KB Output is correct
13 Correct 28 ms 16888 KB Output is correct
14 Correct 32 ms 16796 KB Output is correct
15 Correct 24 ms 16800 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 16800 KB Output is correct
2 Correct 28 ms 16764 KB Output is correct
3 Correct 30 ms 16844 KB Output is correct
4 Correct 28 ms 16800 KB Output is correct
5 Correct 23 ms 16796 KB Output is correct
6 Correct 26 ms 16800 KB Output is correct
7 Correct 23 ms 16800 KB Output is correct
8 Correct 26 ms 16796 KB Output is correct
9 Correct 23 ms 16800 KB Output is correct
10 Correct 18 ms 16760 KB Output is correct
11 Correct 24 ms 16800 KB Output is correct
12 Correct 18 ms 16760 KB Output is correct
13 Correct 28 ms 16888 KB Output is correct
14 Correct 32 ms 16796 KB Output is correct
15 Correct 24 ms 16800 KB Output is correct
16 Correct 41 ms 17348 KB Output is correct
17 Correct 62 ms 18152 KB Output is correct
18 Correct 84 ms 18464 KB Output is correct
19 Correct 242 ms 18296 KB Output is correct
20 Correct 274 ms 18460 KB Output is correct
21 Correct 66 ms 18172 KB Output is correct
22 Correct 50 ms 16800 KB Output is correct
23 Correct 67 ms 17528 KB Output is correct
24 Correct 84 ms 18296 KB Output is correct
25 Correct 42 ms 16924 KB Output is correct
26 Correct 59 ms 17704 KB Output is correct
27 Correct 76 ms 17920 KB Output is correct
28 Correct 85 ms 18336 KB Output is correct
29 Correct 35 ms 17400 KB Output is correct
30 Correct 25 ms 16800 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 18272 KB Output is correct
2 Correct 28 ms 17144 KB Output is correct
3 Correct 42 ms 17780 KB Output is correct
4 Correct 43 ms 17656 KB Output is correct
5 Correct 50 ms 18012 KB Output is correct
6 Correct 42 ms 17656 KB Output is correct
7 Correct 23 ms 17020 KB Output is correct
8 Correct 38 ms 17532 KB Output is correct
9 Correct 70 ms 18908 KB Output is correct
10 Correct 47 ms 18040 KB Output is correct
11 Correct 28 ms 16800 KB Output is correct
12 Correct 28 ms 16764 KB Output is correct
13 Correct 30 ms 16844 KB Output is correct
14 Correct 28 ms 16800 KB Output is correct
15 Correct 23 ms 16796 KB Output is correct
16 Correct 26 ms 16800 KB Output is correct
17 Correct 23 ms 16800 KB Output is correct
18 Correct 26 ms 16796 KB Output is correct
19 Correct 23 ms 16800 KB Output is correct
20 Correct 18 ms 16760 KB Output is correct
21 Correct 24 ms 16800 KB Output is correct
22 Correct 18 ms 16760 KB Output is correct
23 Correct 28 ms 16888 KB Output is correct
24 Correct 32 ms 16796 KB Output is correct
25 Correct 24 ms 16800 KB Output is correct
26 Correct 41 ms 17348 KB Output is correct
27 Correct 62 ms 18152 KB Output is correct
28 Correct 84 ms 18464 KB Output is correct
29 Correct 242 ms 18296 KB Output is correct
30 Correct 274 ms 18460 KB Output is correct
31 Correct 66 ms 18172 KB Output is correct
32 Correct 50 ms 16800 KB Output is correct
33 Correct 67 ms 17528 KB Output is correct
34 Correct 84 ms 18296 KB Output is correct
35 Correct 42 ms 16924 KB Output is correct
36 Correct 59 ms 17704 KB Output is correct
37 Correct 76 ms 17920 KB Output is correct
38 Correct 85 ms 18336 KB Output is correct
39 Correct 35 ms 17400 KB Output is correct
40 Correct 25 ms 16800 KB Output is correct
41 Correct 210 ms 18848 KB Output is correct
42 Correct 87 ms 19104 KB Output is correct
43 Correct 132 ms 18852 KB Output is correct
44 Correct 88 ms 18976 KB Output is correct
45 Correct 75 ms 19192 KB Output is correct
46 Correct 239 ms 19104 KB Output is correct
47 Correct 67 ms 18808 KB Output is correct
48 Correct 122 ms 18908 KB Output is correct
49 Correct 81 ms 18808 KB Output is correct
50 Correct 982 ms 18972 KB Output is correct
51 Correct 977 ms 19104 KB Output is correct
52 Correct 1000 ms 18904 KB Output is correct
53 Correct 1016 ms 19104 KB Output is correct
54 Correct 916 ms 19064 KB Output is correct
55 Correct 1020 ms 19232 KB Output is correct
56 Correct 915 ms 18848 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 16760 KB Output is correct
2 Correct 30 ms 16796 KB Output is correct
3 Correct 25 ms 16800 KB Output is correct
4 Correct 25 ms 16800 KB Output is correct
5 Correct 18 ms 16760 KB Output is correct
6 Correct 34 ms 16928 KB Output is correct
7 Correct 23 ms 16800 KB Output is correct
8 Correct 24 ms 16796 KB Output is correct
9 Correct 56 ms 18272 KB Output is correct
10 Correct 28 ms 17144 KB Output is correct
11 Correct 42 ms 17780 KB Output is correct
12 Correct 43 ms 17656 KB Output is correct
13 Correct 50 ms 18012 KB Output is correct
14 Correct 42 ms 17656 KB Output is correct
15 Correct 23 ms 17020 KB Output is correct
16 Correct 38 ms 17532 KB Output is correct
17 Correct 70 ms 18908 KB Output is correct
18 Correct 47 ms 18040 KB Output is correct
19 Correct 28 ms 16800 KB Output is correct
20 Correct 28 ms 16764 KB Output is correct
21 Correct 30 ms 16844 KB Output is correct
22 Correct 28 ms 16800 KB Output is correct
23 Correct 23 ms 16796 KB Output is correct
24 Correct 26 ms 16800 KB Output is correct
25 Correct 23 ms 16800 KB Output is correct
26 Correct 26 ms 16796 KB Output is correct
27 Correct 23 ms 16800 KB Output is correct
28 Correct 18 ms 16760 KB Output is correct
29 Correct 24 ms 16800 KB Output is correct
30 Correct 18 ms 16760 KB Output is correct
31 Correct 28 ms 16888 KB Output is correct
32 Correct 32 ms 16796 KB Output is correct
33 Correct 24 ms 16800 KB Output is correct
34 Correct 41 ms 17348 KB Output is correct
35 Correct 62 ms 18152 KB Output is correct
36 Correct 84 ms 18464 KB Output is correct
37 Correct 242 ms 18296 KB Output is correct
38 Correct 274 ms 18460 KB Output is correct
39 Correct 66 ms 18172 KB Output is correct
40 Correct 50 ms 16800 KB Output is correct
41 Correct 67 ms 17528 KB Output is correct
42 Correct 84 ms 18296 KB Output is correct
43 Correct 42 ms 16924 KB Output is correct
44 Correct 59 ms 17704 KB Output is correct
45 Correct 76 ms 17920 KB Output is correct
46 Correct 85 ms 18336 KB Output is correct
47 Correct 35 ms 17400 KB Output is correct
48 Correct 25 ms 16800 KB Output is correct
49 Correct 210 ms 18848 KB Output is correct
50 Correct 87 ms 19104 KB Output is correct
51 Correct 132 ms 18852 KB Output is correct
52 Correct 88 ms 18976 KB Output is correct
53 Correct 75 ms 19192 KB Output is correct
54 Correct 239 ms 19104 KB Output is correct
55 Correct 67 ms 18808 KB Output is correct
56 Correct 122 ms 18908 KB Output is correct
57 Correct 81 ms 18808 KB Output is correct
58 Correct 982 ms 18972 KB Output is correct
59 Correct 977 ms 19104 KB Output is correct
60 Correct 1000 ms 18904 KB Output is correct
61 Correct 1016 ms 19104 KB Output is correct
62 Correct 916 ms 19064 KB Output is correct
63 Correct 1020 ms 19232 KB Output is correct
64 Correct 915 ms 18848 KB Output is correct
65 Correct 24 ms 16796 KB Output is correct
66 Correct 23 ms 16804 KB Output is correct
67 Incorrect 1152 ms 19076 KB Output isn't correct
68 Halted 0 ms 0 KB -