oj.uz

Submission #93135

# Submission time Handle Problem Language Result Execution time Memory
93135 2019-01-06T15:03:25 Z SamAnd Chessboard (IZhO18_chessboard) C++17
70 / 100
 2000 ms 5860 KB 
#include <iostream>
#include <cstdio>
using namespace std;
#define m_p make_pair
const int N = 100005;
struct ban
{
    long long x, y;
    ban(){}
    ban(long long x, long long y)
    {
        this->x = x;
        this->y = y;
    }
};

long long n;

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

bool vv;
bool sevv(long long x, long long y, long long 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, long long t)
{
    long long x1 = a.first.x;
    long long y1 = a.first.y;
    long long x2 = a.second.x;
    long long y2 = a.second.y;
    if (x1 == x2 && y1 == y2)
        return sevv(x1, y1, t);
    long long xm1 = (x1 / t + 1) * t;
    if (x1 % t == 0)
        xm1 = x1;
    long long xm2 = (x2 / t) * t - 1;
    if (x2 % t == t - 1)
        xm2 = x2;
    long long ym1 = (y1 / t + 1) * t;
    if (y1 % t == 0)
        ym1 = y1;
    long long ym2 = (y2 / t) * t - 1;
    if (y2 % t == t - 1)
        ym2 = y2;

    long long ans = 0;
    long long xx = 0;

    if (xm1 - xm2 == t + 1)
    {
        if (sevv(x1, y1, t))
            xx = (x2 - x1 + 1);
        goto kovx;
    }
    // x1; xm1 - 1
    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);

    kovx:

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

    kovy:

    return ans;
}

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

long long ans;
void stg(long long 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 main()
{
    //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 = 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:146:25: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
     scanf("%d%d", &n, &m);
                   ~~    ^
chessboard.cpp:149:87: warning: format '%d' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
         scanf("%d%d%d%d", &a[i].first.x, &a[i].first.y, &a[i].second.x, &a[i].second.y);
                           ~~~~~~~~~~~~~                                               ^
chessboard.cpp:149:87: warning: format '%d' expects argument of type 'int*', but argument 3 has type 'long long int*' [-Wformat=]
chessboard.cpp:149:87: warning: format '%d' expects argument of type 'int*', but argument 4 has type 'long long int*' [-Wformat=]
chessboard.cpp:149:87: warning: format '%d' expects argument of type 'int*', but argument 5 has type 'long long int*' [-Wformat=]
chessboard.cpp:146: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:149: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 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 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 34 ms 2296 KB Output is correct
2 Correct 10 ms 764 KB Output is correct
3 Correct 22 ms 1528 KB Output is correct
4 Correct 24 ms 1704 KB Output is correct
5 Correct 30 ms 2044 KB Output is correct
6 Correct 20 ms 1532 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 20 ms 1592 KB Output is correct
9 Correct 49 ms 3340 KB Output is correct
10 Correct 28 ms 2040 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 252 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 252 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 21 ms 1272 KB Output is correct
17 Correct 40 ms 3124 KB Output is correct
18 Correct 70 ms 3580 KB Output is correct
19 Correct 321 ms 3192 KB Output is correct
20 Correct 355 ms 3572 KB Output is correct
21 Correct 39 ms 2936 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 51 ms 1784 KB Output is correct
24 Correct 112 ms 3264 KB Output is correct
25 Correct 12 ms 760 KB Output is correct
26 Correct 42 ms 2168 KB Output is correct
27 Correct 65 ms 2552 KB Output is correct
28 Correct 68 ms 3420 KB Output is correct
29 Correct 17 ms 1528 KB Output is correct
30 Correct 4 ms 376 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 2296 KB Output is correct
2 Correct 10 ms 764 KB Output is correct
3 Correct 22 ms 1528 KB Output is correct
4 Correct 24 ms 1704 KB Output is correct
5 Correct 30 ms 2044 KB Output is correct
6 Correct 20 ms 1532 KB Output is correct
7 Correct 6 ms 632 KB Output is correct
8 Correct 20 ms 1592 KB Output is correct
9 Correct 49 ms 3340 KB Output is correct
10 Correct 28 ms 2040 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 252 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 3 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 21 ms 1272 KB Output is correct
27 Correct 40 ms 3124 KB Output is correct
28 Correct 70 ms 3580 KB Output is correct
29 Correct 321 ms 3192 KB Output is correct
30 Correct 355 ms 3572 KB Output is correct
31 Correct 39 ms 2936 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 51 ms 1784 KB Output is correct
34 Correct 112 ms 3264 KB Output is correct
35 Correct 12 ms 760 KB Output is correct
36 Correct 42 ms 2168 KB Output is correct
37 Correct 65 ms 2552 KB Output is correct
38 Correct 68 ms 3420 KB Output is correct
39 Correct 17 ms 1528 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 269 ms 3072 KB Output is correct
42 Correct 74 ms 3452 KB Output is correct
43 Correct 145 ms 3192 KB Output is correct
44 Correct 74 ms 3448 KB Output is correct
45 Correct 54 ms 3580 KB Output is correct
46 Correct 296 ms 3448 KB Output is correct
47 Correct 48 ms 3192 KB Output is correct
48 Correct 113 ms 3192 KB Output is correct
49 Correct 67 ms 3108 KB Output is correct
50 Correct 1439 ms 3436 KB Output is correct
51 Correct 1526 ms 5752 KB Output is correct
52 Correct 1420 ms 5320 KB Output is correct
53 Correct 1571 ms 5652 KB Output is correct
54 Correct 1405 ms 5292 KB Output is correct
55 Correct 1575 ms 5860 KB Output is correct
56 Correct 1338 ms 5112 KB Output is correct

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 252 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 34 ms 2296 KB Output is correct
10 Correct 10 ms 764 KB Output is correct
11 Correct 22 ms 1528 KB Output is correct
12 Correct 24 ms 1704 KB Output is correct
13 Correct 30 ms 2044 KB Output is correct
14 Correct 20 ms 1532 KB Output is correct
15 Correct 6 ms 632 KB Output is correct
16 Correct 20 ms 1592 KB Output is correct
17 Correct 49 ms 3340 KB Output is correct
18 Correct 28 ms 2040 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 3 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 252 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 252 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 3 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 21 ms 1272 KB Output is correct
35 Correct 40 ms 3124 KB Output is correct
36 Correct 70 ms 3580 KB Output is correct
37 Correct 321 ms 3192 KB Output is correct
38 Correct 355 ms 3572 KB Output is correct
39 Correct 39 ms 2936 KB Output is correct
40 Correct 3 ms 376 KB Output is correct
41 Correct 51 ms 1784 KB Output is correct
42 Correct 112 ms 3264 KB Output is correct
43 Correct 12 ms 760 KB Output is correct
44 Correct 42 ms 2168 KB Output is correct
45 Correct 65 ms 2552 KB Output is correct
46 Correct 68 ms 3420 KB Output is correct
47 Correct 17 ms 1528 KB Output is correct
48 Correct 4 ms 376 KB Output is correct
49 Correct 269 ms 3072 KB Output is correct
50 Correct 74 ms 3452 KB Output is correct
51 Correct 145 ms 3192 KB Output is correct
52 Correct 74 ms 3448 KB Output is correct
53 Correct 54 ms 3580 KB Output is correct
54 Correct 296 ms 3448 KB Output is correct
55 Correct 48 ms 3192 KB Output is correct
56 Correct 113 ms 3192 KB Output is correct
57 Correct 67 ms 3108 KB Output is correct
58 Correct 1439 ms 3436 KB Output is correct
59 Correct 1526 ms 5752 KB Output is correct
60 Correct 1420 ms 5320 KB Output is correct
61 Correct 1571 ms 5652 KB Output is correct
62 Correct 1405 ms 5292 KB Output is correct
63 Correct 1575 ms 5860 KB Output is correct
64 Correct 1338 ms 5112 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 256 KB Output is correct
67 Execution timed out 2063 ms 5496 KB Time limit exceeded
68 Halted 0 ms 0 KB -