oj.uz

Submission #747118

# Submission time Handle Problem Language Result Execution time Memory
747118 2023-05-23T16:09:34 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 479 ms 5756 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 = (int)(d * cx1 - x1[i] + 1) * (d * cy1 - y1[i] + 1);
                add(cx1, cy1, tt, s1, s2);
                /// colt dr sus
                    tt = (int)(d * cx1 - x1[i] + 1) * (y2[i] - d * (cy2 - 1));
                add(cx1, cy2, tt, s1, s2);
                /// colt st jos
                    tt = (int)(x2[i] - d * (cx2 - 1)) * (d * cy1 - y1[i] + 1);
                add(cx2, cy1, tt, s1, s2);
                /// colt dr jos
                    tt = (int)(x2[i] - d * (cx2 - 1)) * (y2[i] - d * (cy2 - 1));
                add(cx2, cy2, tt, s1, s2);
                /// marg sus si jos
                if((int)cy2 - cy1 - 1 >= 1)
                {
                    tt = (int)(d * cx1 - x1[i] + 1) * d;
                    int np = (int)cy2 - cy1 - 1;
                    int nri = (int)np / 2, nrp = np / 2;
                    if((int)np % 2 == 1)
                        nri = (int)nri + 1;
                    add(cx1, (int)cy1 + 1, (int)tt * nri, s1, s2);
                    add(cx1, (int)cy1 + 2, (int)tt * nrp, s1, s2);
                    tt = (int)(x2[i] - d * (cx2 - 1)) * d;
                    add(cx2, (int)cy1 + 1, (int)tt * nri, s1, s2);
                    add(cx2, (int)cy1 + 2, (int)tt * nrp, s1, s2);
                }
                /// marg st si dr
                if((int)cx2 - cx1 - 1 >= 1)
                {
                    tt = (int)(d * cy1 - y1[i] + 1) * d;
                    int np = (int)cx2 - cx1 - 1;
                    int nri = (int)np / 2, nrp = (int)np / 2;
                    if((int)np % 2 == 1)
                        nri = (int)nri + 1;
                    add((int)cx1 + 1, cy1, (int)tt * nri, s1, s2);
                    add((int)cx1 + 2, cy1, (int)tt * nrp, s1, s2);
                    tt = (int)(y2[i] - d * (cy2 - 1)) * d;
                    add((int)cx1 + 1, cy2, (int)tt * nri, s1, s2);
                    add((int)cx1 + 2, cy2, (int)tt * nrp, s1, s2);
                }

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

        int d1 = (int)n * n / d / d / 2, d2 = (int)n * n / d / d / 2;
        if((n * n / d / d) % 2 == 1) d1++;
        d2 = (int)n * n / d / d - d1;
        d1 = (int)d1 * d * d;
        d2 = (int)d2 * d * d;
        int ans = min((int)d1 - s1 + s2, (int)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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 312 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 70 ms 3004 KB Output is correct
2 Correct 20 ms 1156 KB Output is correct
3 Correct 46 ms 1868 KB Output is correct
4 Correct 41 ms 2048 KB Output is correct
5 Correct 57 ms 2520 KB Output is correct
6 Correct 46 ms 1868 KB Output is correct
7 Correct 8 ms 712 KB Output is correct
8 Correct 41 ms 1800 KB Output is correct
9 Correct 93 ms 4004 KB Output is correct
10 Correct 52 ms 2312 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 324 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 324 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 312 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 27 ms 1532 KB Output is correct
17 Correct 81 ms 3596 KB Output is correct
18 Correct 92 ms 4160 KB Output is correct
19 Correct 122 ms 3896 KB Output is correct
20 Correct 136 ms 4244 KB Output is correct
21 Correct 70 ms 3656 KB Output is correct
22 Correct 1 ms 316 KB Output is correct
23 Correct 49 ms 2324 KB Output is correct
24 Correct 93 ms 4020 KB Output is correct
25 Correct 10 ms 724 KB Output is correct
26 Correct 51 ms 2944 KB Output is correct
27 Correct 61 ms 3412 KB Output is correct
28 Correct 86 ms 4220 KB Output is correct
29 Correct 43 ms 1828 KB Output is correct
30 Correct 4 ms 452 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 3004 KB Output is correct
2 Correct 20 ms 1156 KB Output is correct
3 Correct 46 ms 1868 KB Output is correct
4 Correct 41 ms 2048 KB Output is correct
5 Correct 57 ms 2520 KB Output is correct
6 Correct 46 ms 1868 KB Output is correct
7 Correct 8 ms 712 KB Output is correct
8 Correct 41 ms 1800 KB Output is correct
9 Correct 93 ms 4004 KB Output is correct
10 Correct 52 ms 2312 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 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 324 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 312 KB Output is correct
21 Correct 1 ms 312 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 27 ms 1532 KB Output is correct
27 Correct 81 ms 3596 KB Output is correct
28 Correct 92 ms 4160 KB Output is correct
29 Correct 122 ms 3896 KB Output is correct
30 Correct 136 ms 4244 KB Output is correct
31 Correct 70 ms 3656 KB Output is correct
32 Correct 1 ms 316 KB Output is correct
33 Correct 49 ms 2324 KB Output is correct
34 Correct 93 ms 4020 KB Output is correct
35 Correct 10 ms 724 KB Output is correct
36 Correct 51 ms 2944 KB Output is correct
37 Correct 61 ms 3412 KB Output is correct
38 Correct 86 ms 4220 KB Output is correct
39 Correct 43 ms 1828 KB Output is correct
40 Correct 4 ms 452 KB Output is correct
41 Correct 134 ms 4000 KB Output is correct
42 Correct 115 ms 4808 KB Output is correct
43 Correct 142 ms 4244 KB Output is correct
44 Correct 111 ms 4664 KB Output is correct
45 Correct 109 ms 5016 KB Output is correct
46 Correct 143 ms 4788 KB Output is correct
47 Correct 102 ms 4372 KB Output is correct
48 Correct 117 ms 4512 KB Output is correct
49 Correct 102 ms 4268 KB Output is correct
50 Correct 396 ms 4672 KB Output is correct
51 Correct 431 ms 5012 KB Output is correct
52 Correct 416 ms 4636 KB Output is correct
53 Correct 441 ms 4960 KB Output is correct
54 Correct 385 ms 4832 KB Output is correct
55 Correct 432 ms 5756 KB Output is correct
56 Correct 395 ms 5064 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 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 70 ms 3004 KB Output is correct
10 Correct 20 ms 1156 KB Output is correct
11 Correct 46 ms 1868 KB Output is correct
12 Correct 41 ms 2048 KB Output is correct
13 Correct 57 ms 2520 KB Output is correct
14 Correct 46 ms 1868 KB Output is correct
15 Correct 8 ms 712 KB Output is correct
16 Correct 41 ms 1800 KB Output is correct
17 Correct 93 ms 4004 KB Output is correct
18 Correct 52 ms 2312 KB Output is correct
19 Correct 1 ms 340 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 324 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 312 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 2 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 27 ms 1532 KB Output is correct
35 Correct 81 ms 3596 KB Output is correct
36 Correct 92 ms 4160 KB Output is correct
37 Correct 122 ms 3896 KB Output is correct
38 Correct 136 ms 4244 KB Output is correct
39 Correct 70 ms 3656 KB Output is correct
40 Correct 1 ms 316 KB Output is correct
41 Correct 49 ms 2324 KB Output is correct
42 Correct 93 ms 4020 KB Output is correct
43 Correct 10 ms 724 KB Output is correct
44 Correct 51 ms 2944 KB Output is correct
45 Correct 61 ms 3412 KB Output is correct
46 Correct 86 ms 4220 KB Output is correct
47 Correct 43 ms 1828 KB Output is correct
48 Correct 4 ms 452 KB Output is correct
49 Correct 134 ms 4000 KB Output is correct
50 Correct 115 ms 4808 KB Output is correct
51 Correct 142 ms 4244 KB Output is correct
52 Correct 111 ms 4664 KB Output is correct
53 Correct 109 ms 5016 KB Output is correct
54 Correct 143 ms 4788 KB Output is correct
55 Correct 102 ms 4372 KB Output is correct
56 Correct 117 ms 4512 KB Output is correct
57 Correct 102 ms 4268 KB Output is correct
58 Correct 396 ms 4672 KB Output is correct
59 Correct 431 ms 5012 KB Output is correct
60 Correct 416 ms 4636 KB Output is correct
61 Correct 441 ms 4960 KB Output is correct
62 Correct 385 ms 4832 KB Output is correct
63 Correct 432 ms 5756 KB Output is correct
64 Correct 395 ms 5064 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 479 ms 5468 KB Output is correct
68 Correct 470 ms 5396 KB Output is correct
69 Correct 413 ms 4796 KB Output is correct
70 Correct 411 ms 5248 KB Output is correct
71 Correct 462 ms 5208 KB Output is correct
72 Correct 441 ms 5124 KB Output is correct
73 Correct 423 ms 5000 KB Output is correct
74 Correct 444 ms 5396 KB Output is correct
75 Incorrect 461 ms 5172 KB Output isn't correct
76 Halted 0 ms 0 KB -