oj.uz

Submission #93170

# Submission time Handle Problem Language Result Execution time Memory
93170 2019-01-06T16:35:04 Z SamAnd Chessboard (IZhO18_chessboard) C++11
47 / 100
 2000 ms 2040 KB 
#include <iostream>
#include <cstdio>
using namespace std;
#define m_p make_pair
const int N = 100005;
struct ban
{
    int x, y;
    ban(){}
    ban(int x, int y)
    {
        this->x = x;
        this->y = y;
    }
};

int n;

int m;
pair<ban, ban> a[N];

bool vv;
bool sevv(int x, int y, int t)
{
    x = x / t;
    y = y / t;
    if ((x + y) % 2 == 0)
    {
        if (vv)
            return true;
        else
            return false;
    }
    else
    {
        if (vv)
            return false;
        else
            return true;
    }
}

long long sev(const pair<ban, ban>& a, int t)
{
    int x1 = a.first.x;
    int y1 = a.first.y;
    int x2 = a.second.x;
    int y2 = a.second.y;

    int xm1 = (x1 / t + 1) * t;
    if (x1 % t == 0)
        xm1 = x1;
    int xm2 = (x2 / t) * t - 1;
    if (x2 % t == t - 1)
        xm2 = x2;
    int ym1 = (y1 / t + 1) * t;
    if (y1 % t == 0)
        ym1 = y1;
    int ym2 = (y2 / t) * t - 1;
    if (y2 % t == t - 1)
        ym2 = y2;

    long long ans = 0;

    // y1; ym1 - 1
    // x1; xm1 - 1
    long long xx = 0;
    if (sevv(x1, y1, t))
        xx += (xm1 - x1);
    // xm1; xm2
    if (!sevv(xm1, y1, t))
        xx += ((((xm2 - xm1 + 1) / t) / 2) * t);
    else
        xx += ((((xm2 - xm1 + 1) / t) - (((xm2 - xm1 + 1) / t) / 2)) * t);
    // xm2 + 1; x2
    if (sevv(xm2 + 1, y1, t))
        xx += (x2 - xm2);
    if (xm1 - xm2 == t + 1)
    {
        xx = 0;
        if (sevv(x1, y1, t))
            xx = (x2 - x1 + 1);
    }
    ans += ((ym1 - y1) * xx);

    // ym1; ym2
    // x1; xm1 - 1
    xx = 0;
    if (sevv(x1, ym1, t))
        xx += (xm1 - x1);
    // xm1; xm2
    if (!sevv(xm1, ym1, t))
        xx += ((((xm2 - xm1 + 1) / t) / 2) * t);
    else
        xx += ((((xm2 - xm1 + 1) / t) - (((xm2 - xm1 + 1) / t) / 2)) * t);
    // xm2 + 1; x2
    if (sevv(xm2 + 1, ym1, t))
        xx += (x2 - xm2);
    if (xm1 - xm2 == t + 1)
    {
        xx = 0;
        if (sevv(x1, ym1, t))
            xx = (x2 - x1 + 1);
    }
    ans += ((((ym2 - ym1 + 1) / t) / 2) * ((x2 - x1 + 1) - xx) * t);
    ans += ((((ym2 - ym1 + 1) / t) - (((ym2 - ym1 + 1) / t) / 2)) * xx * t);

    // ym2 + 1; y2
    // x1; xm1 - 1
    xx = 0;
    if (sevv(x1, ym2 + 1, t))
        xx += (xm1 - x1);
    // xm1; xm2
    if (!sevv(xm1, ym2 + 1, t))
        xx += ((((xm2 - xm1 + 1) / t) / 2) * t);
    else
        xx += ((((xm2 - xm1 + 1) / t) - (((xm2 - xm1 + 1) / t) / 2)) * t);
    // xm2 + 1; x2
    if (sevv(xm2 + 1, ym2 + 1, t))
        xx += (x2 - xm2);
    if (xm1 - xm2 == t + 1)
    {
        xx = 0;
        if (sevv(x1, ym2 + 1, t))
            xx = (x2 - x1 + 1);
    }
    ans += ((y2 - ym2) * xx);

    if (ym1 - ym2 == t + 1)
    {
        ans = 0;
        xx = 0;
        if (sevv(x1, y1, t))
            xx += (xm1 - x1);
        // xm1; xm2
        if (!sevv(xm1, y1, t))
            xx += ((((xm2 - xm1 + 1) / t) / 2) * t);
        else
            xx += ((((xm2 - xm1 + 1) / t) - (((xm2 - xm1 + 1) / t) / 2)) * t);
        // xm2 + 1; x2
        if (sevv(xm2 + 1, y1, t))
            xx += (x2 - xm2);
        if (xm1 - xm2 == t + 1)
        {
            xx = 0;
            if (sevv(x1, y1, t))
                xx = (x2 - x1 + 1);
        }
        ans += (xx * (y2 - y1 + 1));
    }

    return ans;
}

long long spi(const pair<ban, ban>& a, int t)
{
    int x1 = a.first.x;
    int y1 = a.first.y;
    int x2 = a.second.x;
    int y2 = a.second.y;
    return 1LL * (x2 - x1 + 1) * (y2 - y1 + 1) - sev(a, t);
}

long long ans;
void stg(int t)
{
    vv = true;
    long long yans = 0;
    long long g = 0;
    for (int i = 0; i < m; ++i)
    {
        yans += (spi(a[i], t));
        g += (sev(a[i], t));
    }
    yans += (sev(m_p(ban(0, 0), ban(n - 1, n - 1)), t) - g);
    ans = min(ans, yans);
    vv = false;
    yans = 0;
    g = 0;
    for (int i = 0; i < m; ++i)
    {
        yans += (spi(a[i], t));
        g += (sev(a[i], t));
    }
    yans += (sev(m_p(ban(0, 0), ban(n - 1, n - 1)), t) - g);
    ans = min(ans, yans);
}

int b[8][8];
int main()
{
    /*vv = true;
    for (int i = 0; i < 6; ++i)
    {
        for (int j = 0; j < 6; ++j)
        {
            if (sevv(i, j, 1))
                b[i][j] = 1;
        }
    }
    for (int x1 = 0; x1 < 6; ++x1)
    {
        for (int x2 = x1; x2 < 6; ++x2)
        {
            for (int y1 = 0; y1 < 6; ++y1)
            {
                for (int y2 = y1; y2 < 6; ++y2)
                {
                    cout << x1 << ' ' << x2 << ' ' << y1 << ' ' << y2 << endl;
                    if (x1 == 4 && x2 == 4 && y1 == 0 && y2 == 4)
                        cout << "";
                    int ans1 = sev(m_p(ban(x1, y1), ban(x2, y2)), 1);
                    int ans2 = 0;
                    for (int i = x1; i <= x2; ++i)
                    {
                        for (int j = y1; j <= y2; ++j)
                        {
                            ans2 += b[i][j];
                        }
                    }
                    if (ans1 != ans2)
                        cout << "asdfdafjklshdfkjhaskjldfhakjl" << endl;
                }
            }
        }
    }*/
    //freopen("input2.txt", "r", stdin);
    scanf("%d%d", &n, &m);
    for (int i = 0; i < m; ++i)
    {
        scanf("%d%d%d%d", &a[i].first.x, &a[i].first.y, &a[i].second.x, &a[i].second.y);
        --a[i].first.x;
        --a[i].first.y;
        --a[i].second.x;
        --a[i].second.y;
    }
    ans = 1LL * n * n;
    for (int i = 1; i * i <= n; ++i)
    {
        if (n % i == 0)
        {
            if (i != n)
                stg(i);
            if (n / i != n)
                stg(n / i);
        }
    }
    cout << ans << endl;
    return 0;
}

Compilation message

chessboard.cpp: In function 'int main()':
chessboard.cpp:228:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~
chessboard.cpp:231:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d%d", &a[i].first.x, &a[i].first.y, &a[i].second.x, &a[i].second.y);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1364 KB Output is correct
2 Correct 18 ms 632 KB Output is correct
3 Correct 26 ms 1016 KB Output is correct
4 Correct 28 ms 1196 KB Output is correct
5 Correct 35 ms 1276 KB Output is correct
6 Correct 22 ms 1012 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 23 ms 988 KB Output is correct
9 Correct 55 ms 1788 KB Output is correct
10 Correct 32 ms 1368 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 380 KB Output is correct
15 Correct 3 ms 292 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 364 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 380 KB Output is correct
15 Correct 3 ms 292 KB Output is correct
16 Correct 32 ms 764 KB Output is correct
17 Correct 47 ms 1656 KB Output is correct
18 Correct 111 ms 1984 KB Output is correct
19 Correct 732 ms 1816 KB Output is correct
20 Correct 784 ms 2012 KB Output is correct
21 Correct 46 ms 1656 KB Output is correct
22 Correct 4 ms 256 KB Output is correct
23 Correct 95 ms 1060 KB Output is correct
24 Correct 102 ms 1940 KB Output is correct
25 Correct 21 ms 504 KB Output is correct
26 Correct 64 ms 1272 KB Output is correct
27 Correct 114 ms 1508 KB Output is correct
28 Correct 107 ms 1916 KB Output is correct
29 Correct 21 ms 996 KB Output is correct
30 Correct 5 ms 376 KB Output is correct

Subtask #5
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 1364 KB Output is correct
2 Correct 18 ms 632 KB Output is correct
3 Correct 26 ms 1016 KB Output is correct
4 Correct 28 ms 1196 KB Output is correct
5 Correct 35 ms 1276 KB Output is correct
6 Correct 22 ms 1012 KB Output is correct
7 Correct 6 ms 504 KB Output is correct
8 Correct 23 ms 988 KB Output is correct
9 Correct 55 ms 1788 KB Output is correct
10 Correct 32 ms 1368 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 364 KB Output is correct
17 Correct 3 ms 348 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 4 ms 380 KB Output is correct
25 Correct 3 ms 292 KB Output is correct
26 Correct 32 ms 764 KB Output is correct
27 Correct 47 ms 1656 KB Output is correct
28 Correct 111 ms 1984 KB Output is correct
29 Correct 732 ms 1816 KB Output is correct
30 Correct 784 ms 2012 KB Output is correct
31 Correct 46 ms 1656 KB Output is correct
32 Correct 4 ms 256 KB Output is correct
33 Correct 95 ms 1060 KB Output is correct
34 Correct 102 ms 1940 KB Output is correct
35 Correct 21 ms 504 KB Output is correct
36 Correct 64 ms 1272 KB Output is correct
37 Correct 114 ms 1508 KB Output is correct
38 Correct 107 ms 1916 KB Output is correct
39 Correct 21 ms 996 KB Output is correct
40 Correct 5 ms 376 KB Output is correct
41 Correct 558 ms 1784 KB Output is correct
42 Correct 112 ms 1912 KB Output is correct
43 Correct 285 ms 1816 KB Output is correct
44 Correct 111 ms 1912 KB Output is correct
45 Correct 62 ms 2040 KB Output is correct
46 Correct 632 ms 1932 KB Output is correct
47 Correct 54 ms 1784 KB Output is correct
48 Correct 199 ms 1784 KB Output is correct
49 Correct 101 ms 1784 KB Output is correct
50 Execution timed out 2060 ms 1924 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 39 ms 1364 KB Output is correct
10 Correct 18 ms 632 KB Output is correct
11 Correct 26 ms 1016 KB Output is correct
12 Correct 28 ms 1196 KB Output is correct
13 Correct 35 ms 1276 KB Output is correct
14 Correct 22 ms 1012 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 23 ms 988 KB Output is correct
17 Correct 55 ms 1788 KB Output is correct
18 Correct 32 ms 1368 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 364 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 256 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 4 ms 380 KB Output is correct
33 Correct 3 ms 292 KB Output is correct
34 Correct 32 ms 764 KB Output is correct
35 Correct 47 ms 1656 KB Output is correct
36 Correct 111 ms 1984 KB Output is correct
37 Correct 732 ms 1816 KB Output is correct
38 Correct 784 ms 2012 KB Output is correct
39 Correct 46 ms 1656 KB Output is correct
40 Correct 4 ms 256 KB Output is correct
41 Correct 95 ms 1060 KB Output is correct
42 Correct 102 ms 1940 KB Output is correct
43 Correct 21 ms 504 KB Output is correct
44 Correct 64 ms 1272 KB Output is correct
45 Correct 114 ms 1508 KB Output is correct
46 Correct 107 ms 1916 KB Output is correct
47 Correct 21 ms 996 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Correct 558 ms 1784 KB Output is correct
50 Correct 112 ms 1912 KB Output is correct
51 Correct 285 ms 1816 KB Output is correct
52 Correct 111 ms 1912 KB Output is correct
53 Correct 62 ms 2040 KB Output is correct
54 Correct 632 ms 1932 KB Output is correct
55 Correct 54 ms 1784 KB Output is correct
56 Correct 199 ms 1784 KB Output is correct
57 Correct 101 ms 1784 KB Output is correct
58 Execution timed out 2060 ms 1924 KB Time limit exceeded
59 Halted 0 ms 0 KB -