oj.uz

답안 #747102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747102 2023-05-23T15:52:36 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 504 ms 4388 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 312 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 264 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 2728 KB Output is correct
2 Correct 17 ms 1180 KB Output is correct
3 Correct 45 ms 1936 KB Output is correct
4 Correct 48 ms 2368 KB Output is correct
5 Correct 78 ms 2448 KB Output is correct
6 Correct 42 ms 1788 KB Output is correct
7 Correct 13 ms 724 KB Output is correct
8 Correct 45 ms 1880 KB Output is correct
9 Correct 92 ms 3852 KB Output is correct
10 Correct 56 ms 2312 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 324 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 324 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 324 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 324 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 25 ms 1548 KB Output is correct
17 Correct 72 ms 3380 KB Output is correct
18 Correct 84 ms 4100 KB Output is correct
19 Correct 130 ms 3532 KB Output is correct
20 Correct 140 ms 4024 KB Output is correct
21 Correct 71 ms 3356 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 45 ms 2148 KB Output is correct
24 Correct 93 ms 3628 KB Output is correct
25 Correct 9 ms 628 KB Output is correct
26 Correct 56 ms 2592 KB Output is correct
27 Correct 66 ms 2892 KB Output is correct
28 Correct 90 ms 3896 KB Output is correct
29 Correct 31 ms 1808 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 2728 KB Output is correct
2 Correct 17 ms 1180 KB Output is correct
3 Correct 45 ms 1936 KB Output is correct
4 Correct 48 ms 2368 KB Output is correct
5 Correct 78 ms 2448 KB Output is correct
6 Correct 42 ms 1788 KB Output is correct
7 Correct 13 ms 724 KB Output is correct
8 Correct 45 ms 1880 KB Output is correct
9 Correct 92 ms 3852 KB Output is correct
10 Correct 56 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 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 324 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 324 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 2 ms 340 KB Output is correct
26 Correct 25 ms 1548 KB Output is correct
27 Correct 72 ms 3380 KB Output is correct
28 Correct 84 ms 4100 KB Output is correct
29 Correct 130 ms 3532 KB Output is correct
30 Correct 140 ms 4024 KB Output is correct
31 Correct 71 ms 3356 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 45 ms 2148 KB Output is correct
34 Correct 93 ms 3628 KB Output is correct
35 Correct 9 ms 628 KB Output is correct
36 Correct 56 ms 2592 KB Output is correct
37 Correct 66 ms 2892 KB Output is correct
38 Correct 90 ms 3896 KB Output is correct
39 Correct 31 ms 1808 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 142 ms 3680 KB Output is correct
42 Correct 104 ms 3956 KB Output is correct
43 Correct 109 ms 3660 KB Output is correct
44 Correct 131 ms 3936 KB Output is correct
45 Correct 161 ms 4060 KB Output is correct
46 Correct 217 ms 3956 KB Output is correct
47 Correct 99 ms 3692 KB Output is correct
48 Correct 116 ms 3836 KB Output is correct
49 Correct 105 ms 3692 KB Output is correct
50 Correct 399 ms 3920 KB Output is correct
51 Correct 408 ms 4104 KB Output is correct
52 Correct 400 ms 3900 KB Output is correct
53 Correct 425 ms 4076 KB Output is correct
54 Correct 365 ms 3852 KB Output is correct
55 Correct 440 ms 4192 KB Output is correct
56 Correct 396 ms 3832 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 312 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 264 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 70 ms 2728 KB Output is correct
10 Correct 17 ms 1180 KB Output is correct
11 Correct 45 ms 1936 KB Output is correct
12 Correct 48 ms 2368 KB Output is correct
13 Correct 78 ms 2448 KB Output is correct
14 Correct 42 ms 1788 KB Output is correct
15 Correct 13 ms 724 KB Output is correct
16 Correct 45 ms 1880 KB Output is correct
17 Correct 92 ms 3852 KB Output is correct
18 Correct 56 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 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 324 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 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 2 ms 340 KB Output is correct
34 Correct 25 ms 1548 KB Output is correct
35 Correct 72 ms 3380 KB Output is correct
36 Correct 84 ms 4100 KB Output is correct
37 Correct 130 ms 3532 KB Output is correct
38 Correct 140 ms 4024 KB Output is correct
39 Correct 71 ms 3356 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 45 ms 2148 KB Output is correct
42 Correct 93 ms 3628 KB Output is correct
43 Correct 9 ms 628 KB Output is correct
44 Correct 56 ms 2592 KB Output is correct
45 Correct 66 ms 2892 KB Output is correct
46 Correct 90 ms 3896 KB Output is correct
47 Correct 31 ms 1808 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 142 ms 3680 KB Output is correct
50 Correct 104 ms 3956 KB Output is correct
51 Correct 109 ms 3660 KB Output is correct
52 Correct 131 ms 3936 KB Output is correct
53 Correct 161 ms 4060 KB Output is correct
54 Correct 217 ms 3956 KB Output is correct
55 Correct 99 ms 3692 KB Output is correct
56 Correct 116 ms 3836 KB Output is correct
57 Correct 105 ms 3692 KB Output is correct
58 Correct 399 ms 3920 KB Output is correct
59 Correct 408 ms 4104 KB Output is correct
60 Correct 400 ms 3900 KB Output is correct
61 Correct 425 ms 4076 KB Output is correct
62 Correct 365 ms 3852 KB Output is correct
63 Correct 440 ms 4192 KB Output is correct
64 Correct 396 ms 3832 KB Output is correct
65 Correct 1 ms 312 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 502 ms 4388 KB Output is correct
68 Correct 431 ms 4252 KB Output is correct
69 Correct 378 ms 3748 KB Output is correct
70 Correct 423 ms 4372 KB Output is correct
71 Correct 435 ms 4228 KB Output is correct
72 Correct 420 ms 4168 KB Output is correct
73 Correct 410 ms 4120 KB Output is correct
74 Correct 504 ms 4360 KB Output is correct
75 Incorrect 414 ms 4308 KB Output isn't correct
76 Halted 0 ms 0 KB -