oj.uz

Submission #747089

# Submission time Handle Problem Language Result Execution time Memory
747089 2023-05-23T15:36:03 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 455 ms 4696 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((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 = (x1[i] - 1) / d + 1;
            int cy1 = (y1[i] - 1) / d + 1;
            int cx2 = (x2[i] - 1) / d + 1;
            int cy2 = (y2[i] - 1) / d + 1;

            if(cx1 == cx2 && cy1 == cy2)
            {
                int tt = (cy2 - cy1 + 1) * (cx2 - cx1 + 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 * d1, s1, s2);
                    add(cx1 + 1, cx2 + 2, d * d2, s1, s2);
                }
            }*/
        }

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

        d2 -= (d * d * (nli * nli + nlp * nlp));
        d1 = 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 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 3520 KB Output is correct
2 Correct 17 ms 1140 KB Output is correct
3 Correct 54 ms 2384 KB Output is correct
4 Correct 40 ms 2520 KB Output is correct
5 Correct 60 ms 3276 KB Output is correct
6 Correct 45 ms 2124 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 39 ms 2140 KB Output is correct
9 Correct 106 ms 4404 KB Output is correct
10 Correct 67 ms 2964 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 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 2 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 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 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 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 2 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 26 ms 1536 KB Output is correct
17 Correct 71 ms 4164 KB Output is correct
18 Correct 89 ms 4696 KB Output is correct
19 Correct 127 ms 4260 KB Output is correct
20 Correct 157 ms 4660 KB Output is correct
21 Correct 69 ms 4164 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 43 ms 2252 KB Output is correct
24 Correct 79 ms 4384 KB Output is correct
25 Correct 13 ms 728 KB Output is correct
26 Correct 52 ms 2984 KB Output is correct
27 Correct 67 ms 3500 KB Output is correct
28 Correct 92 ms 4468 KB Output is correct
29 Correct 30 ms 1832 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 97 ms 3520 KB Output is correct
2 Correct 17 ms 1140 KB Output is correct
3 Correct 54 ms 2384 KB Output is correct
4 Correct 40 ms 2520 KB Output is correct
5 Correct 60 ms 3276 KB Output is correct
6 Correct 45 ms 2124 KB Output is correct
7 Correct 9 ms 724 KB Output is correct
8 Correct 39 ms 2140 KB Output is correct
9 Correct 106 ms 4404 KB Output is correct
10 Correct 67 ms 2964 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 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 2 ms 340 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 26 ms 1536 KB Output is correct
27 Correct 71 ms 4164 KB Output is correct
28 Correct 89 ms 4696 KB Output is correct
29 Correct 127 ms 4260 KB Output is correct
30 Correct 157 ms 4660 KB Output is correct
31 Correct 69 ms 4164 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 43 ms 2252 KB Output is correct
34 Correct 79 ms 4384 KB Output is correct
35 Correct 13 ms 728 KB Output is correct
36 Correct 52 ms 2984 KB Output is correct
37 Correct 67 ms 3500 KB Output is correct
38 Correct 92 ms 4468 KB Output is correct
39 Correct 30 ms 1832 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 136 ms 4152 KB Output is correct
42 Correct 108 ms 4428 KB Output is correct
43 Correct 115 ms 4204 KB Output is correct
44 Correct 106 ms 4432 KB Output is correct
45 Correct 112 ms 4680 KB Output is correct
46 Correct 173 ms 4596 KB Output is correct
47 Correct 98 ms 4180 KB Output is correct
48 Correct 103 ms 4276 KB Output is correct
49 Correct 110 ms 4256 KB Output is correct
50 Correct 371 ms 4252 KB Output is correct
51 Correct 411 ms 4468 KB Output is correct
52 Correct 378 ms 4404 KB Output is correct
53 Correct 416 ms 4204 KB Output is correct
54 Correct 356 ms 3856 KB Output is correct
55 Correct 430 ms 3820 KB Output is correct
56 Correct 353 ms 2996 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 320 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 320 KB Output is correct
9 Correct 97 ms 3520 KB Output is correct
10 Correct 17 ms 1140 KB Output is correct
11 Correct 54 ms 2384 KB Output is correct
12 Correct 40 ms 2520 KB Output is correct
13 Correct 60 ms 3276 KB Output is correct
14 Correct 45 ms 2124 KB Output is correct
15 Correct 9 ms 724 KB Output is correct
16 Correct 39 ms 2140 KB Output is correct
17 Correct 106 ms 4404 KB Output is correct
18 Correct 67 ms 2964 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 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 2 ms 340 KB Output is correct
30 Correct 1 ms 320 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 26 ms 1536 KB Output is correct
35 Correct 71 ms 4164 KB Output is correct
36 Correct 89 ms 4696 KB Output is correct
37 Correct 127 ms 4260 KB Output is correct
38 Correct 157 ms 4660 KB Output is correct
39 Correct 69 ms 4164 KB Output is correct
40 Correct 1 ms 320 KB Output is correct
41 Correct 43 ms 2252 KB Output is correct
42 Correct 79 ms 4384 KB Output is correct
43 Correct 13 ms 728 KB Output is correct
44 Correct 52 ms 2984 KB Output is correct
45 Correct 67 ms 3500 KB Output is correct
46 Correct 92 ms 4468 KB Output is correct
47 Correct 30 ms 1832 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 136 ms 4152 KB Output is correct
50 Correct 108 ms 4428 KB Output is correct
51 Correct 115 ms 4204 KB Output is correct
52 Correct 106 ms 4432 KB Output is correct
53 Correct 112 ms 4680 KB Output is correct
54 Correct 173 ms 4596 KB Output is correct
55 Correct 98 ms 4180 KB Output is correct
56 Correct 103 ms 4276 KB Output is correct
57 Correct 110 ms 4256 KB Output is correct
58 Correct 371 ms 4252 KB Output is correct
59 Correct 411 ms 4468 KB Output is correct
60 Correct 378 ms 4404 KB Output is correct
61 Correct 416 ms 4204 KB Output is correct
62 Correct 356 ms 3856 KB Output is correct
63 Correct 430 ms 3820 KB Output is correct
64 Correct 353 ms 2996 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Incorrect 455 ms 3296 KB Output isn't correct
68 Halted 0 ms 0 KB -