oj.uz

답안 #93143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93143 2019-01-06T15:13:27 Z SamAnd Chessboard (IZhO18_chessboard) C++17
70 / 100
 1327 ms 2008 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;
    /*if (x1 == x2 && y1 == y2)
        return sevv(x1, y1, t);*/
    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;
    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, 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 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 = 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: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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 1272 KB Output is correct
2 Correct 11 ms 552 KB Output is correct
3 Correct 23 ms 1092 KB Output is correct
4 Correct 50 ms 1016 KB Output is correct
5 Correct 31 ms 1148 KB Output is correct
6 Correct 20 ms 888 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 20 ms 888 KB Output is correct
9 Correct 50 ms 1728 KB Output is correct
10 Correct 29 ms 1144 KB Output is correct

Subtask #3
15.0 / 15.0

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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 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 380 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 22 ms 836 KB Output is correct
17 Correct 42 ms 1656 KB Output is correct
18 Correct 72 ms 1912 KB Output is correct
19 Correct 296 ms 1748 KB Output is correct
20 Correct 336 ms 1912 KB Output is correct
21 Correct 41 ms 1528 KB Output is correct
22 Correct 3 ms 252 KB Output is correct
23 Correct 52 ms 1016 KB Output is correct
24 Correct 65 ms 1784 KB Output is correct
25 Correct 11 ms 376 KB Output is correct
26 Correct 41 ms 1144 KB Output is correct
27 Correct 69 ms 1400 KB Output is correct
28 Correct 74 ms 1784 KB Output is correct
29 Correct 17 ms 880 KB Output is correct
30 Correct 4 ms 376 KB Output is correct

Subtask #5
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 1272 KB Output is correct
2 Correct 11 ms 552 KB Output is correct
3 Correct 23 ms 1092 KB Output is correct
4 Correct 50 ms 1016 KB Output is correct
5 Correct 31 ms 1148 KB Output is correct
6 Correct 20 ms 888 KB Output is correct
7 Correct 6 ms 376 KB Output is correct
8 Correct 20 ms 888 KB Output is correct
9 Correct 50 ms 1728 KB Output is correct
10 Correct 29 ms 1144 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 256 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 380 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 22 ms 836 KB Output is correct
27 Correct 42 ms 1656 KB Output is correct
28 Correct 72 ms 1912 KB Output is correct
29 Correct 296 ms 1748 KB Output is correct
30 Correct 336 ms 1912 KB Output is correct
31 Correct 41 ms 1528 KB Output is correct
32 Correct 3 ms 252 KB Output is correct
33 Correct 52 ms 1016 KB Output is correct
34 Correct 65 ms 1784 KB Output is correct
35 Correct 11 ms 376 KB Output is correct
36 Correct 41 ms 1144 KB Output is correct
37 Correct 69 ms 1400 KB Output is correct
38 Correct 74 ms 1784 KB Output is correct
39 Correct 17 ms 880 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 229 ms 1528 KB Output is correct
42 Correct 71 ms 1808 KB Output is correct
43 Correct 135 ms 1656 KB Output is correct
44 Correct 76 ms 1660 KB Output is correct
45 Correct 57 ms 2008 KB Output is correct
46 Correct 254 ms 1812 KB Output is correct
47 Correct 49 ms 1656 KB Output is correct
48 Correct 101 ms 1656 KB Output is correct
49 Correct 64 ms 1656 KB Output is correct
50 Correct 1160 ms 1820 KB Output is correct
51 Correct 1190 ms 1872 KB Output is correct
52 Correct 1190 ms 1784 KB Output is correct
53 Correct 1196 ms 1784 KB Output is correct
54 Correct 1094 ms 1756 KB Output is correct
55 Correct 1233 ms 1920 KB Output is correct
56 Correct 1055 ms 1784 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 35 ms 1272 KB Output is correct
10 Correct 11 ms 552 KB Output is correct
11 Correct 23 ms 1092 KB Output is correct
12 Correct 50 ms 1016 KB Output is correct
13 Correct 31 ms 1148 KB Output is correct
14 Correct 20 ms 888 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 20 ms 888 KB Output is correct
17 Correct 50 ms 1728 KB Output is correct
18 Correct 29 ms 1144 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 3 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 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 380 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 22 ms 836 KB Output is correct
35 Correct 42 ms 1656 KB Output is correct
36 Correct 72 ms 1912 KB Output is correct
37 Correct 296 ms 1748 KB Output is correct
38 Correct 336 ms 1912 KB Output is correct
39 Correct 41 ms 1528 KB Output is correct
40 Correct 3 ms 252 KB Output is correct
41 Correct 52 ms 1016 KB Output is correct
42 Correct 65 ms 1784 KB Output is correct
43 Correct 11 ms 376 KB Output is correct
44 Correct 41 ms 1144 KB Output is correct
45 Correct 69 ms 1400 KB Output is correct
46 Correct 74 ms 1784 KB Output is correct
47 Correct 17 ms 880 KB Output is correct
48 Correct 4 ms 376 KB Output is correct
49 Correct 229 ms 1528 KB Output is correct
50 Correct 71 ms 1808 KB Output is correct
51 Correct 135 ms 1656 KB Output is correct
52 Correct 76 ms 1660 KB Output is correct
53 Correct 57 ms 2008 KB Output is correct
54 Correct 254 ms 1812 KB Output is correct
55 Correct 49 ms 1656 KB Output is correct
56 Correct 101 ms 1656 KB Output is correct
57 Correct 64 ms 1656 KB Output is correct
58 Correct 1160 ms 1820 KB Output is correct
59 Correct 1190 ms 1872 KB Output is correct
60 Correct 1190 ms 1784 KB Output is correct
61 Correct 1196 ms 1784 KB Output is correct
62 Correct 1094 ms 1756 KB Output is correct
63 Correct 1233 ms 1920 KB Output is correct
64 Correct 1055 ms 1784 KB Output is correct
65 Correct 2 ms 256 KB Output is correct
66 Correct 2 ms 380 KB Output is correct
67 Incorrect 1327 ms 1824 KB Output isn't correct
68 Halted 0 ms 0 KB -