oj.uz

Submission #747104

# Submission time Handle Problem Language Result Execution time Memory
747104 2023-05-23T15:54:55 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 418 ms 3472 KB 
#include <iostream>
#include <vector>
#define int long long

using namespace std;

int a[1005][1005];
int spw[1005][1005], spb[1005][1005];
int x1[100005], x2[100005], y1[100005], y2[100005];

void add(int x, int y, int val, int &s1, int &s2)
{
    if((int)(x + y) % 2 == 0)
        s1 += val;
    else
        s2 += val;
    return;
}

signed main()
{
    int s1 = 0, s2 = 0;
    int n, k;
    cin>>n>>k;

    vector<int> divs;
    for(int i = 1; i * i <= n; i++)
        if(n % i == 0)
        {
            divs.push_back(i);
            if(i * i != n && i != 1)
                divs.push_back(n / i);
        }

    for(int i = 1; i <= k; i++)
        cin>>x1[i]>>y1[i]>>x2[i]>>y2[i];

    int minn = n * n;
    for(auto d : divs)
    {
        int s1 = 0, s2 = 0;
        for(int i = 1; i <= k; i++)
        {
            int cx1 = (int)(x1[i] - 1) / d + 1;
            int cy1 = (int)(y1[i] - 1) / d + 1;
            int cx2 = (int)(x2[i] - 1) / d + 1;
            int cy2 = (int)(y2[i] - 1) / d + 1;

            if(cx1 == cx2 && cy1 == cy2)
            {
                int tt = (x2[i] - x1[i] + 1) * (y2[i] - y1[i] + 1);
                add(cx1, cy1, tt, s1, s2);
            }
            else if(cx1 == cx2 && cy1 != cy2)
            {
                /// colt stanga
                int tt = ((d * cy1) - y1[i] + 1) * (x2[i] - x1[i] + 1);
                add(cx1, cy1, tt, s1, s2);
                /// colt dreapta
                    tt = (y2[i] - d * (cy2 - 1)) * (x2[i] - x1[i] + 1);
                add(cx2, cy2, tt, s1, s2);
                /// mijloc
                if(cy2 - cy1 - 1 >= 1)
                {
                    int tt = d * (x2[i] - x1[i] + 1);
                    int np = cy2 - cy1 - 1;
                    int nri = np / 2, nrp = np / 2;
                    if(np % 2 == 1)
                        nri++;
                    add(cx1, cy1 + 1, tt * nri, s1, s2);
                    add(cx1, cy1 + 2, tt * nrp, s1, s2);
                }
            }
            else if(cx1 != cx2 && cy1 == cy2)
            {
                /// colt sus
                int tt = ((d * cx1) - x1[i] + 1) * (y2[i] - y1[i] + 1);
                add(cx1, cy1, tt, s1, s2);
                /// colt jos
                    tt = (x2[i] - d * (cx2 - 1)) * (y2[i] - y1[i] + 1);
                add(cx2, cy2, tt, s1, s2);
                /// mijloc
                if(cx2 - cx1 - 1 >= 1)
                {
                    int tt = d * (y2[i] - y1[i] + 1);
                    int np = cx2 - cx1 - 1;
                    int nri = np / 2, nrp = np / 2;
                    if(np % 2 == 1)
                        nri++;
                    add(cx1 + 1, cy1, tt * nri, s1, s2);
                    add(cx1 + 2, cy1, tt * nrp, s1, s2);
                }
            }
            else
            {
                /// colt st sus
                int tt = (d * cx1 - x1[i] + 1) * (d * cy1 - y1[i] + 1);
                add(cx1, cy1, tt, s1, s2);
                /// colt dr sus
                    tt = (d * cx1 - x1[i] + 1) * (y2[i] - d * (cy2 - 1));
                add(cx1, cy2, tt, s1, s2);
                /// colt st jos
                    tt = (x2[i] - d * (cx2 - 1)) * (d * cy1 - y1[i] + 1);
                add(cx2, cy1, tt, s1, s2);
                /// colt dr jos
                    tt = (x2[i] - d * (cx2 - 1)) * (y2[i] - d * (cy2 - 1));
                add(cx2, cy2, tt, s1, s2);
                /// marg sus si jos
                /*if(cy2 - cy1 - 1 >= 1)
                {
                    tt = (d * cx1 - x1[i] + 1) * d;
                    int np = cy2 - cy1 - 1;
                    int nri = np / 2, nrp = np / 2;
                    if(np % 2 == 1)
                        nri++;
                    add(cx1, cy1 + 1, tt * nri, s1, s2);
                    add(cx1, cy1 + 2, tt * nrp, s1, s2);
                    tt = (x2[i] - d * (cx2 - 1)) * d;
                    add(cx2, cy1 + 1, tt * nri, s1, s2);
                    add(cx2, cy1 + 2, tt * nrp, s1, s2);
                }
                /// marg st si dr
                if(cx2 - cx1 - 1 >= 1)
                {
                    tt = (d * cy1 - y1[i] + 1) * d;
                    int np = cx2 - cx1 - 1;
                    int nri = np / 2, nrp = np / 2;
                    if(np % 2 == 1)
                        nri++;
                    add(cx1 + 1, cy1, tt * nri, s1, s2);
                    add(cx1 + 2, cy1, tt * nrp, s1, s2);
                    tt = (y2[i] - d * (cy2 - 1)) * d;
                    add(cx1 + 1, cy2, tt * nri, s1, s2);
                    add(cx1 + 2, cy2, tt * nrp, s1, s2);
                }

                /// mijloc
                if((cx2 - cx1 - 1) * (cy2 - cy1 - 1) >= 1)
                {
                    int nrp = (cx2 - cx1 - 1) * (cy2 - cy1 - 1);
                    int d1 = nrp / 2, d2 = nrp / 2;
                    if(nrp % 2 == 1)
                        d1++;
                    add(cx1 + 1, cx2 + 1, d * d * d1, s1, s2);
                    add(cx1 + 1, cx2 + 2, d * d * d2, s1, s2);
                }*/
            }
        }

        int d1 = (int)n * n, d2 = (int)n * n;
        int nli = (int)n / d / 2, nlp = (int)n / d / 2;
        if((n / d) % 2 == 1) nli++;

        d2 -= (int)(d * d * (nli * nli + nlp * nlp));
        d1 = (int)n * n - d2;
        int ans = min(d1 - s1 + s2, d2 - s2 + s1);
        minn = min(minn, ans);
    }

    cout<<minn<<'\n';

    return 0;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:22:9: warning: unused variable 's1' [-Wunused-variable]
   22 |     int s1 = 0, s2 = 0;
      |         ^~
chessboard.cpp:22:17: warning: unused variable 's2' [-Wunused-variable]
   22 |     int s1 = 0, s2 = 0;
      |                 ^~

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 2260 KB Output is correct
2 Correct 24 ms 748 KB Output is correct
3 Correct 46 ms 1476 KB Output is correct
4 Correct 46 ms 1684 KB Output is correct
5 Correct 57 ms 1924 KB Output is correct
6 Correct 39 ms 1488 KB Output is correct
7 Correct 9 ms 468 KB Output is correct
8 Correct 38 ms 1420 KB Output is correct
9 Correct 99 ms 3060 KB Output is correct
10 Correct 54 ms 1872 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 26 ms 1100 KB Output is correct
17 Correct 72 ms 2832 KB Output is correct
18 Correct 87 ms 3400 KB Output is correct
19 Correct 123 ms 3012 KB Output is correct
20 Correct 135 ms 3344 KB Output is correct
21 Correct 79 ms 2896 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 41 ms 1636 KB Output is correct
24 Correct 76 ms 3020 KB Output is correct
25 Correct 8 ms 596 KB Output is correct
26 Correct 49 ms 1984 KB Output is correct
27 Correct 68 ms 2360 KB Output is correct
28 Correct 79 ms 3292 KB Output is correct
29 Correct 27 ms 1248 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 2260 KB Output is correct
2 Correct 24 ms 748 KB Output is correct
3 Correct 46 ms 1476 KB Output is correct
4 Correct 46 ms 1684 KB Output is correct
5 Correct 57 ms 1924 KB Output is correct
6 Correct 39 ms 1488 KB Output is correct
7 Correct 9 ms 468 KB Output is correct
8 Correct 38 ms 1420 KB Output is correct
9 Correct 99 ms 3060 KB Output is correct
10 Correct 54 ms 1872 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 26 ms 1100 KB Output is correct
27 Correct 72 ms 2832 KB Output is correct
28 Correct 87 ms 3400 KB Output is correct
29 Correct 123 ms 3012 KB Output is correct
30 Correct 135 ms 3344 KB Output is correct
31 Correct 79 ms 2896 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 41 ms 1636 KB Output is correct
34 Correct 76 ms 3020 KB Output is correct
35 Correct 8 ms 596 KB Output is correct
36 Correct 49 ms 1984 KB Output is correct
37 Correct 68 ms 2360 KB Output is correct
38 Correct 79 ms 3292 KB Output is correct
39 Correct 27 ms 1248 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 129 ms 2892 KB Output is correct
42 Correct 108 ms 3340 KB Output is correct
43 Correct 110 ms 2836 KB Output is correct
44 Correct 103 ms 3140 KB Output is correct
45 Correct 106 ms 3284 KB Output is correct
46 Correct 146 ms 3208 KB Output is correct
47 Correct 91 ms 2872 KB Output is correct
48 Correct 106 ms 2912 KB Output is correct
49 Correct 92 ms 2860 KB Output is correct
50 Correct 359 ms 3168 KB Output is correct
51 Correct 376 ms 3336 KB Output is correct
52 Correct 363 ms 3144 KB Output is correct
53 Correct 404 ms 3308 KB Output is correct
54 Correct 379 ms 3084 KB Output is correct
55 Correct 394 ms 3472 KB Output is correct
56 Correct 355 ms 3004 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 81 ms 2260 KB Output is correct
10 Correct 24 ms 748 KB Output is correct
11 Correct 46 ms 1476 KB Output is correct
12 Correct 46 ms 1684 KB Output is correct
13 Correct 57 ms 1924 KB Output is correct
14 Correct 39 ms 1488 KB Output is correct
15 Correct 9 ms 468 KB Output is correct
16 Correct 38 ms 1420 KB Output is correct
17 Correct 99 ms 3060 KB Output is correct
18 Correct 54 ms 1872 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 26 ms 1100 KB Output is correct
35 Correct 72 ms 2832 KB Output is correct
36 Correct 87 ms 3400 KB Output is correct
37 Correct 123 ms 3012 KB Output is correct
38 Correct 135 ms 3344 KB Output is correct
39 Correct 79 ms 2896 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 41 ms 1636 KB Output is correct
42 Correct 76 ms 3020 KB Output is correct
43 Correct 8 ms 596 KB Output is correct
44 Correct 49 ms 1984 KB Output is correct
45 Correct 68 ms 2360 KB Output is correct
46 Correct 79 ms 3292 KB Output is correct
47 Correct 27 ms 1248 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 129 ms 2892 KB Output is correct
50 Correct 108 ms 3340 KB Output is correct
51 Correct 110 ms 2836 KB Output is correct
52 Correct 103 ms 3140 KB Output is correct
53 Correct 106 ms 3284 KB Output is correct
54 Correct 146 ms 3208 KB Output is correct
55 Correct 91 ms 2872 KB Output is correct
56 Correct 106 ms 2912 KB Output is correct
57 Correct 92 ms 2860 KB Output is correct
58 Correct 359 ms 3168 KB Output is correct
59 Correct 376 ms 3336 KB Output is correct
60 Correct 363 ms 3144 KB Output is correct
61 Correct 404 ms 3308 KB Output is correct
62 Correct 379 ms 3084 KB Output is correct
63 Correct 394 ms 3472 KB Output is correct
64 Correct 355 ms 3004 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 418 ms 3228 KB Output is correct
68 Correct 414 ms 3220 KB Output is correct
69 Correct 356 ms 2844 KB Output is correct
70 Correct 397 ms 3104 KB Output is correct
71 Correct 400 ms 3164 KB Output is correct
72 Incorrect 413 ms 3024 KB Output isn't correct
73 Halted 0 ms 0 KB -