oj.uz

Submission #747100

# Submission time Handle Problem Language Result Execution time Memory
747100 2023-05-23T15:50:38 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 450 ms 3944 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 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2504 KB Output is correct
2 Correct 18 ms 972 KB Output is correct
3 Correct 43 ms 1744 KB Output is correct
4 Correct 41 ms 1992 KB Output is correct
5 Correct 65 ms 2164 KB Output is correct
6 Correct 40 ms 1584 KB Output is correct
7 Correct 9 ms 716 KB Output is correct
8 Correct 38 ms 1616 KB Output is correct
9 Correct 94 ms 3620 KB Output is correct
10 Correct 54 ms 2104 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 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 300 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 2 ms 340 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 2 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 300 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 324 KB Output is correct
14 Correct 2 ms 328 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 34 ms 1384 KB Output is correct
17 Correct 75 ms 3304 KB Output is correct
18 Correct 88 ms 3856 KB Output is correct
19 Correct 137 ms 3576 KB Output is correct
20 Correct 161 ms 3932 KB Output is correct
21 Correct 75 ms 3188 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 46 ms 1892 KB Output is correct
24 Correct 86 ms 3612 KB Output is correct
25 Correct 9 ms 724 KB Output is correct
26 Correct 61 ms 2288 KB Output is correct
27 Correct 68 ms 2684 KB Output is correct
28 Correct 88 ms 3716 KB Output is correct
29 Correct 39 ms 1504 KB Output is correct
30 Correct 4 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 2504 KB Output is correct
2 Correct 18 ms 972 KB Output is correct
3 Correct 43 ms 1744 KB Output is correct
4 Correct 41 ms 1992 KB Output is correct
5 Correct 65 ms 2164 KB Output is correct
6 Correct 40 ms 1584 KB Output is correct
7 Correct 9 ms 716 KB Output is correct
8 Correct 38 ms 1616 KB Output is correct
9 Correct 94 ms 3620 KB Output is correct
10 Correct 54 ms 2104 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 2 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 300 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 324 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 34 ms 1384 KB Output is correct
27 Correct 75 ms 3304 KB Output is correct
28 Correct 88 ms 3856 KB Output is correct
29 Correct 137 ms 3576 KB Output is correct
30 Correct 161 ms 3932 KB Output is correct
31 Correct 75 ms 3188 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 46 ms 1892 KB Output is correct
34 Correct 86 ms 3612 KB Output is correct
35 Correct 9 ms 724 KB Output is correct
36 Correct 61 ms 2288 KB Output is correct
37 Correct 68 ms 2684 KB Output is correct
38 Correct 88 ms 3716 KB Output is correct
39 Correct 39 ms 1504 KB Output is correct
40 Correct 4 ms 340 KB Output is correct
41 Correct 142 ms 3408 KB Output is correct
42 Correct 114 ms 3752 KB Output is correct
43 Correct 117 ms 3364 KB Output is correct
44 Correct 101 ms 3636 KB Output is correct
45 Correct 125 ms 3816 KB Output is correct
46 Correct 154 ms 3712 KB Output is correct
47 Correct 95 ms 3400 KB Output is correct
48 Correct 117 ms 3464 KB Output is correct
49 Correct 119 ms 3336 KB Output is correct
50 Correct 374 ms 3656 KB Output is correct
51 Correct 415 ms 3848 KB Output is correct
52 Correct 366 ms 3736 KB Output is correct
53 Correct 432 ms 3824 KB Output is correct
54 Correct 365 ms 3604 KB Output is correct
55 Correct 424 ms 3944 KB Output is correct
56 Correct 364 ms 3388 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 83 ms 2504 KB Output is correct
10 Correct 18 ms 972 KB Output is correct
11 Correct 43 ms 1744 KB Output is correct
12 Correct 41 ms 1992 KB Output is correct
13 Correct 65 ms 2164 KB Output is correct
14 Correct 40 ms 1584 KB Output is correct
15 Correct 9 ms 716 KB Output is correct
16 Correct 38 ms 1616 KB Output is correct
17 Correct 94 ms 3620 KB Output is correct
18 Correct 54 ms 2104 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 2 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 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 324 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 34 ms 1384 KB Output is correct
35 Correct 75 ms 3304 KB Output is correct
36 Correct 88 ms 3856 KB Output is correct
37 Correct 137 ms 3576 KB Output is correct
38 Correct 161 ms 3932 KB Output is correct
39 Correct 75 ms 3188 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 46 ms 1892 KB Output is correct
42 Correct 86 ms 3612 KB Output is correct
43 Correct 9 ms 724 KB Output is correct
44 Correct 61 ms 2288 KB Output is correct
45 Correct 68 ms 2684 KB Output is correct
46 Correct 88 ms 3716 KB Output is correct
47 Correct 39 ms 1504 KB Output is correct
48 Correct 4 ms 340 KB Output is correct
49 Correct 142 ms 3408 KB Output is correct
50 Correct 114 ms 3752 KB Output is correct
51 Correct 117 ms 3364 KB Output is correct
52 Correct 101 ms 3636 KB Output is correct
53 Correct 125 ms 3816 KB Output is correct
54 Correct 154 ms 3712 KB Output is correct
55 Correct 95 ms 3400 KB Output is correct
56 Correct 117 ms 3464 KB Output is correct
57 Correct 119 ms 3336 KB Output is correct
58 Correct 374 ms 3656 KB Output is correct
59 Correct 415 ms 3848 KB Output is correct
60 Correct 366 ms 3736 KB Output is correct
61 Correct 432 ms 3824 KB Output is correct
62 Correct 365 ms 3604 KB Output is correct
63 Correct 424 ms 3944 KB Output is correct
64 Correct 364 ms 3388 KB Output is correct
65 Correct 1 ms 340 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 423 ms 3620 KB Output is correct
68 Correct 441 ms 3408 KB Output is correct
69 Correct 388 ms 3100 KB Output is correct
70 Correct 442 ms 3360 KB Output is correct
71 Correct 450 ms 3336 KB Output is correct
72 Correct 406 ms 3272 KB Output is correct
73 Correct 409 ms 3224 KB Output is correct
74 Correct 435 ms 3412 KB Output is correct
75 Incorrect 415 ms 3304 KB Output isn't correct
76 Halted 0 ms 0 KB -