oj.uz

답안 #747113

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747113 2023-05-23T16:05:37 Z heeheeheehaaw Chessboard (IZhO18_chessboard) C++17
70 / 100
 449 ms 3428 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, 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 2168 KB Output is correct
2 Correct 17 ms 792 KB Output is correct
3 Correct 46 ms 1572 KB Output is correct
4 Correct 41 ms 1744 KB Output is correct
5 Correct 57 ms 1904 KB Output is correct
6 Correct 37 ms 1284 KB Output is correct
7 Correct 8 ms 468 KB Output is correct
8 Correct 37 ms 1328 KB Output is correct
9 Correct 93 ms 3016 KB Output is correct
10 Correct 62 ms 1852 KB Output is correct

Subtask #3
15.0 / 15.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 23 ms 1068 KB Output is correct
17 Correct 66 ms 2916 KB Output is correct
18 Correct 85 ms 3328 KB Output is correct
19 Correct 132 ms 3012 KB Output is correct
20 Correct 151 ms 3404 KB Output is correct
21 Correct 68 ms 2804 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 42 ms 1648 KB Output is correct
24 Correct 78 ms 3064 KB Output is correct
25 Correct 9 ms 492 KB Output is correct
26 Correct 47 ms 1996 KB Output is correct
27 Correct 63 ms 2312 KB Output is correct
28 Correct 83 ms 3232 KB Output is correct
29 Correct 29 ms 1348 KB Output is correct
30 Correct 3 ms 340 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 64 ms 2168 KB Output is correct
2 Correct 17 ms 792 KB Output is correct
3 Correct 46 ms 1572 KB Output is correct
4 Correct 41 ms 1744 KB Output is correct
5 Correct 57 ms 1904 KB Output is correct
6 Correct 37 ms 1284 KB Output is correct
7 Correct 8 ms 468 KB Output is correct
8 Correct 37 ms 1328 KB Output is correct
9 Correct 93 ms 3016 KB Output is correct
10 Correct 62 ms 1852 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 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 23 ms 1068 KB Output is correct
27 Correct 66 ms 2916 KB Output is correct
28 Correct 85 ms 3328 KB Output is correct
29 Correct 132 ms 3012 KB Output is correct
30 Correct 151 ms 3404 KB Output is correct
31 Correct 68 ms 2804 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 42 ms 1648 KB Output is correct
34 Correct 78 ms 3064 KB Output is correct
35 Correct 9 ms 492 KB Output is correct
36 Correct 47 ms 1996 KB Output is correct
37 Correct 63 ms 2312 KB Output is correct
38 Correct 83 ms 3232 KB Output is correct
39 Correct 29 ms 1348 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 133 ms 2888 KB Output is correct
42 Correct 104 ms 3204 KB Output is correct
43 Correct 106 ms 2904 KB Output is correct
44 Correct 101 ms 3156 KB Output is correct
45 Correct 104 ms 3320 KB Output is correct
46 Correct 147 ms 3172 KB Output is correct
47 Correct 91 ms 2928 KB Output is correct
48 Correct 101 ms 3024 KB Output is correct
49 Correct 111 ms 2904 KB Output is correct
50 Correct 365 ms 3180 KB Output is correct
51 Correct 365 ms 3336 KB Output is correct
52 Correct 353 ms 3132 KB Output is correct
53 Correct 369 ms 3292 KB Output is correct
54 Correct 369 ms 3164 KB Output is correct
55 Correct 389 ms 3428 KB Output is correct
56 Correct 336 ms 3000 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 64 ms 2168 KB Output is correct
10 Correct 17 ms 792 KB Output is correct
11 Correct 46 ms 1572 KB Output is correct
12 Correct 41 ms 1744 KB Output is correct
13 Correct 57 ms 1904 KB Output is correct
14 Correct 37 ms 1284 KB Output is correct
15 Correct 8 ms 468 KB Output is correct
16 Correct 37 ms 1328 KB Output is correct
17 Correct 93 ms 3016 KB Output is correct
18 Correct 62 ms 1852 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 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 23 ms 1068 KB Output is correct
35 Correct 66 ms 2916 KB Output is correct
36 Correct 85 ms 3328 KB Output is correct
37 Correct 132 ms 3012 KB Output is correct
38 Correct 151 ms 3404 KB Output is correct
39 Correct 68 ms 2804 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 42 ms 1648 KB Output is correct
42 Correct 78 ms 3064 KB Output is correct
43 Correct 9 ms 492 KB Output is correct
44 Correct 47 ms 1996 KB Output is correct
45 Correct 63 ms 2312 KB Output is correct
46 Correct 83 ms 3232 KB Output is correct
47 Correct 29 ms 1348 KB Output is correct
48 Correct 3 ms 340 KB Output is correct
49 Correct 133 ms 2888 KB Output is correct
50 Correct 104 ms 3204 KB Output is correct
51 Correct 106 ms 2904 KB Output is correct
52 Correct 101 ms 3156 KB Output is correct
53 Correct 104 ms 3320 KB Output is correct
54 Correct 147 ms 3172 KB Output is correct
55 Correct 91 ms 2928 KB Output is correct
56 Correct 101 ms 3024 KB Output is correct
57 Correct 111 ms 2904 KB Output is correct
58 Correct 365 ms 3180 KB Output is correct
59 Correct 365 ms 3336 KB Output is correct
60 Correct 353 ms 3132 KB Output is correct
61 Correct 369 ms 3292 KB Output is correct
62 Correct 369 ms 3164 KB Output is correct
63 Correct 389 ms 3428 KB Output is correct
64 Correct 336 ms 3000 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 428 ms 3236 KB Output is correct
68 Correct 420 ms 3228 KB Output is correct
69 Correct 380 ms 2896 KB Output is correct
70 Correct 399 ms 3156 KB Output is correct
71 Correct 436 ms 3024 KB Output is correct
72 Correct 434 ms 3016 KB Output is correct
73 Correct 402 ms 2972 KB Output is correct
74 Correct 449 ms 3152 KB Output is correct
75 Incorrect 399 ms 3128 KB Output isn't correct
76 Halted 0 ms 0 KB -