oj.uz

답안 #93130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
93130 2019-01-06T14:53:35 Z SamAnd Chessboard (IZhO18_chessboard) C++17
47 / 100
 2000 ms 5752 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 == 0 && y1 == 1 && x2 == 0 && y2 == 1 && t == 3)
        cout << "";
    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);
    cin >> n >> m;
    for (int i = 0; i < m; ++i)
    {
        cin >> 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 (long long 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;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 2268 KB Output is correct
2 Correct 25 ms 888 KB Output is correct
3 Correct 61 ms 1528 KB Output is correct
4 Correct 62 ms 1756 KB Output is correct
5 Correct 84 ms 1996 KB Output is correct
6 Correct 54 ms 1488 KB Output is correct
7 Correct 12 ms 632 KB Output is correct
8 Correct 55 ms 1532 KB Output is correct
9 Correct 135 ms 3092 KB Output is correct
10 Correct 77 ms 1940 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 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 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 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 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 376 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 3 ms 376 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 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 4 ms 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 50 ms 1144 KB Output is correct
17 Correct 105 ms 3004 KB Output is correct
18 Correct 171 ms 3448 KB Output is correct
19 Correct 656 ms 3192 KB Output is correct
20 Correct 753 ms 3488 KB Output is correct
21 Correct 99 ms 2936 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 119 ms 1784 KB Output is correct
24 Correct 153 ms 3192 KB Output is correct
25 Correct 24 ms 632 KB Output is correct
26 Correct 188 ms 2044 KB Output is correct
27 Correct 161 ms 2396 KB Output is correct
28 Correct 172 ms 3348 KB Output is correct
29 Correct 43 ms 1400 KB Output is correct
30 Correct 7 ms 376 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 2268 KB Output is correct
2 Correct 25 ms 888 KB Output is correct
3 Correct 61 ms 1528 KB Output is correct
4 Correct 62 ms 1756 KB Output is correct
5 Correct 84 ms 1996 KB Output is correct
6 Correct 54 ms 1488 KB Output is correct
7 Correct 12 ms 632 KB Output is correct
8 Correct 55 ms 1532 KB Output is correct
9 Correct 135 ms 3092 KB Output is correct
10 Correct 77 ms 1940 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 376 KB Output is correct
14 Correct 4 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 3 ms 376 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 3 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 4 ms 376 KB Output is correct
24 Correct 4 ms 376 KB Output is correct
25 Correct 3 ms 376 KB Output is correct
26 Correct 50 ms 1144 KB Output is correct
27 Correct 105 ms 3004 KB Output is correct
28 Correct 171 ms 3448 KB Output is correct
29 Correct 656 ms 3192 KB Output is correct
30 Correct 753 ms 3488 KB Output is correct
31 Correct 99 ms 2936 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 119 ms 1784 KB Output is correct
34 Correct 153 ms 3192 KB Output is correct
35 Correct 24 ms 632 KB Output is correct
36 Correct 188 ms 2044 KB Output is correct
37 Correct 161 ms 2396 KB Output is correct
38 Correct 172 ms 3348 KB Output is correct
39 Correct 43 ms 1400 KB Output is correct
40 Correct 7 ms 376 KB Output is correct
41 Correct 534 ms 2956 KB Output is correct
42 Correct 182 ms 5496 KB Output is correct
43 Correct 322 ms 4984 KB Output is correct
44 Correct 190 ms 5496 KB Output is correct
45 Correct 153 ms 5752 KB Output is correct
46 Correct 596 ms 5516 KB Output is correct
47 Correct 131 ms 4988 KB Output is correct
48 Correct 242 ms 5112 KB Output is correct
49 Correct 169 ms 4984 KB Output is correct
50 Execution timed out 2054 ms 5332 KB Time limit exceeded
51 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 348 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 376 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 96 ms 2268 KB Output is correct
10 Correct 25 ms 888 KB Output is correct
11 Correct 61 ms 1528 KB Output is correct
12 Correct 62 ms 1756 KB Output is correct
13 Correct 84 ms 1996 KB Output is correct
14 Correct 54 ms 1488 KB Output is correct
15 Correct 12 ms 632 KB Output is correct
16 Correct 55 ms 1532 KB Output is correct
17 Correct 135 ms 3092 KB Output is correct
18 Correct 77 ms 1940 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 376 KB Output is correct
22 Correct 4 ms 376 KB Output is correct
23 Correct 3 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 3 ms 376 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 3 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 4 ms 376 KB Output is correct
32 Correct 4 ms 376 KB Output is correct
33 Correct 3 ms 376 KB Output is correct
34 Correct 50 ms 1144 KB Output is correct
35 Correct 105 ms 3004 KB Output is correct
36 Correct 171 ms 3448 KB Output is correct
37 Correct 656 ms 3192 KB Output is correct
38 Correct 753 ms 3488 KB Output is correct
39 Correct 99 ms 2936 KB Output is correct
40 Correct 4 ms 376 KB Output is correct
41 Correct 119 ms 1784 KB Output is correct
42 Correct 153 ms 3192 KB Output is correct
43 Correct 24 ms 632 KB Output is correct
44 Correct 188 ms 2044 KB Output is correct
45 Correct 161 ms 2396 KB Output is correct
46 Correct 172 ms 3348 KB Output is correct
47 Correct 43 ms 1400 KB Output is correct
48 Correct 7 ms 376 KB Output is correct
49 Correct 534 ms 2956 KB Output is correct
50 Correct 182 ms 5496 KB Output is correct
51 Correct 322 ms 4984 KB Output is correct
52 Correct 190 ms 5496 KB Output is correct
53 Correct 153 ms 5752 KB Output is correct
54 Correct 596 ms 5516 KB Output is correct
55 Correct 131 ms 4988 KB Output is correct
56 Correct 242 ms 5112 KB Output is correct
57 Correct 169 ms 4984 KB Output is correct
58 Execution timed out 2054 ms 5332 KB Time limit exceeded
59 Halted 0 ms 0 KB -