oj.uz

Submission #343350

# Submission time Handle Problem Language Result Execution time Memory
343350 2021-01-03T17:59:14 Z Sprdalo Chessboard (IZhO18_chessboard) C++17
100 / 100
 635 ms 2668 KB 
#include <bits/stdc++.h>

using namespace std;

#define int ll
typedef unsigned long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
typedef vector<pl> vpl;

void no(){
    cout << "-1\n";
    exit(0);
}

vi d, b;
void calc(int x1, int x2, int y1, int y2, int ind){
    int t = d[ind], y = 0, Y = 0;

    if (y1/t == y2/t){
        if (y1%(2*t)<t)
            y = y2-y1+1;
        Y = y2-y1+1-y;
    } else {
        bool k1 = 0;
        if (y1%(2*t)<t){
            k1 = 1;
            y = t-(y1%t);
        }

        bool k2 = 0;
        if (y2%(2*t)<t){
            k2 = 1;
            y += (y2%t)+1;
        }

        y += t * ((y2/t - y1/t - 1) / 2);
        if (!k1 && !k2)
            y += t;

        Y = y2-y1+1-y;
    }

    int x = 0, X = 0;
    if (x1/t == x2/t){
        if (x1 % (2*t) < t)
            x = x2-x1+1;
        X = x2-x1+1-x;
    } else {
        bool k1 = 0;
        if (x1%(2*t)<t){
            k1 = 1;
            x = t-x1%t;
        }

        bool k2 = 0;
        if (x2%(2*t)<t){
            k2 = 1;
            x += x2%t+1;
        }

        x += t * ((x2/t - x1/t - 1) / 2);
        if (!k1 && !k2)
            x += t;

        X = x2-x1+1-x;
    }

    //cout << x << ' ' << y << ' ' << X << ' ' << Y << '\n';

    b[ind] += x * y + X*Y;
}

signed main()
{
    ios_base::sync_with_stdio(false); 
    cin.tie(nullptr); 
    cout.tie(nullptr); 
    cerr.tie(nullptr);    

    int n, k;
    cin >> n >> k;

    for (int i = 1; i < n; ++i){
        if (n % i == 0){
            d.push_back(i);
        }
    }

    int len = d.size(), s = 0;
    b = vi(len);
    for (int i = 0; i < k; ++i){
        int x1,y1,x2,y2;
        cin >> x1>>y1>>x2>>y2;

        --x1;
        --y1;
        --x2;
        --y2;
        s += (x2-x1+1) * (y2-y1+1);

        for (int j = 0; j < len; ++j)
        calc(x1,x2,y1,y2,j);
    }

    int sol = n*n;
    for (int i = 0; i < len; ++i){
        //cout << b[i] << ' ';
        int t = d[i],c;
        
        if (n % (2*t) == 0)
            c = (n*n)/2;
        else
            c = ((n-t)*(n-t))/2 + n*t;

        int res = s-b[i] + c-b[i];
        //cout << c << ' ';
        sol = min(sol, res);

        b[i] = s-b[i];

        c = n*n-c;

        res = s+c - 2 * b[i];
        //cout << c << endl;
        //cout << res << '\n';
        sol = min(sol, res);
    }

    cout << sol << '\n';
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 392 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 16 ms 364 KB Output is correct
4 Correct 18 ms 364 KB Output is correct
5 Correct 22 ms 364 KB Output is correct
6 Correct 14 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 14 ms 364 KB Output is correct
9 Correct 35 ms 364 KB Output is correct
10 Correct 20 ms 364 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 12 ms 364 KB Output is correct
17 Correct 28 ms 364 KB Output is correct
18 Correct 41 ms 364 KB Output is correct
19 Correct 129 ms 492 KB Output is correct
20 Correct 139 ms 364 KB Output is correct
21 Correct 27 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 25 ms 364 KB Output is correct
24 Correct 38 ms 492 KB Output is correct
25 Correct 5 ms 364 KB Output is correct
26 Correct 24 ms 364 KB Output is correct
27 Correct 34 ms 364 KB Output is correct
28 Correct 39 ms 364 KB Output is correct
29 Correct 11 ms 364 KB Output is correct
30 Correct 2 ms 364 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 392 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 16 ms 364 KB Output is correct
4 Correct 18 ms 364 KB Output is correct
5 Correct 22 ms 364 KB Output is correct
6 Correct 14 ms 364 KB Output is correct
7 Correct 3 ms 364 KB Output is correct
8 Correct 14 ms 364 KB Output is correct
9 Correct 35 ms 364 KB Output is correct
10 Correct 20 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 0 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 12 ms 364 KB Output is correct
27 Correct 28 ms 364 KB Output is correct
28 Correct 41 ms 364 KB Output is correct
29 Correct 129 ms 492 KB Output is correct
30 Correct 139 ms 364 KB Output is correct
31 Correct 27 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 25 ms 364 KB Output is correct
34 Correct 38 ms 492 KB Output is correct
35 Correct 5 ms 364 KB Output is correct
36 Correct 24 ms 364 KB Output is correct
37 Correct 34 ms 364 KB Output is correct
38 Correct 39 ms 364 KB Output is correct
39 Correct 11 ms 364 KB Output is correct
40 Correct 2 ms 364 KB Output is correct
41 Correct 115 ms 492 KB Output is correct
42 Correct 45 ms 364 KB Output is correct
43 Correct 73 ms 364 KB Output is correct
44 Correct 44 ms 364 KB Output is correct
45 Correct 39 ms 364 KB Output is correct
46 Correct 133 ms 364 KB Output is correct
47 Correct 34 ms 364 KB Output is correct
48 Correct 58 ms 364 KB Output is correct
49 Correct 41 ms 380 KB Output is correct
50 Correct 554 ms 492 KB Output is correct
51 Correct 590 ms 396 KB Output is correct
52 Correct 543 ms 364 KB Output is correct
53 Correct 584 ms 364 KB Output is correct
54 Correct 539 ms 492 KB Output is correct
55 Correct 608 ms 396 KB Output is correct
56 Correct 531 ms 364 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 ms 364 KB Output is correct
9 Correct 26 ms 392 KB Output is correct
10 Correct 7 ms 364 KB Output is correct
11 Correct 16 ms 364 KB Output is correct
12 Correct 18 ms 364 KB Output is correct
13 Correct 22 ms 364 KB Output is correct
14 Correct 14 ms 364 KB Output is correct
15 Correct 3 ms 364 KB Output is correct
16 Correct 14 ms 364 KB Output is correct
17 Correct 35 ms 364 KB Output is correct
18 Correct 20 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 0 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 12 ms 364 KB Output is correct
35 Correct 28 ms 364 KB Output is correct
36 Correct 41 ms 364 KB Output is correct
37 Correct 129 ms 492 KB Output is correct
38 Correct 139 ms 364 KB Output is correct
39 Correct 27 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 25 ms 364 KB Output is correct
42 Correct 38 ms 492 KB Output is correct
43 Correct 5 ms 364 KB Output is correct
44 Correct 24 ms 364 KB Output is correct
45 Correct 34 ms 364 KB Output is correct
46 Correct 39 ms 364 KB Output is correct
47 Correct 11 ms 364 KB Output is correct
48 Correct 2 ms 364 KB Output is correct
49 Correct 115 ms 492 KB Output is correct
50 Correct 45 ms 364 KB Output is correct
51 Correct 73 ms 364 KB Output is correct
52 Correct 44 ms 364 KB Output is correct
53 Correct 39 ms 364 KB Output is correct
54 Correct 133 ms 364 KB Output is correct
55 Correct 34 ms 364 KB Output is correct
56 Correct 58 ms 364 KB Output is correct
57 Correct 41 ms 380 KB Output is correct
58 Correct 554 ms 492 KB Output is correct
59 Correct 590 ms 396 KB Output is correct
60 Correct 543 ms 364 KB Output is correct
61 Correct 584 ms 364 KB Output is correct
62 Correct 539 ms 492 KB Output is correct
63 Correct 608 ms 396 KB Output is correct
64 Correct 531 ms 364 KB Output is correct
65 Correct 0 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 595 ms 396 KB Output is correct
68 Correct 592 ms 748 KB Output is correct
69 Correct 516 ms 748 KB Output is correct
70 Correct 572 ms 748 KB Output is correct
71 Correct 565 ms 748 KB Output is correct
72 Correct 556 ms 748 KB Output is correct
73 Correct 544 ms 876 KB Output is correct
74 Correct 581 ms 748 KB Output is correct
75 Correct 565 ms 876 KB Output is correct
76 Correct 602 ms 840 KB Output is correct
77 Correct 109 ms 876 KB Output is correct
78 Correct 47 ms 748 KB Output is correct
79 Correct 77 ms 748 KB Output is correct
80 Correct 81 ms 876 KB Output is correct
81 Correct 75 ms 1132 KB Output is correct
82 Correct 66 ms 1644 KB Output is correct
83 Correct 53 ms 748 KB Output is correct
84 Correct 365 ms 2668 KB Output is correct
85 Correct 620 ms 1516 KB Output is correct
86 Correct 2 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 635 ms 2412 KB Output is correct
89 Correct 123 ms 748 KB Output is correct
90 Correct 1 ms 364 KB Output is correct