답안 #47091 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47091	2018-04-27T11:22:51 Z	SpaimaCarpatilor	Cultivation (JOI17_cultivation)	C++17	80 / 100	2000 ms	6520 KB

cultivation

#include<bits/stdc++.h>

using namespace std;

int N, R, C, x[309], y[309], precalc[309][309][3];
const int INF = 1e9 + 100;
long long ans = 1LL << 60;
set < int > sa, sb, sab;

namespace ds {
    multiset < int > xs, dx;

    void init ()
    {
        xs.clear (), dx.clear ();
    }

    void delDif (int x)
    {
        dx.erase (dx.find (x));
    }

    void add (int x)
    {
        if (xs.find (x) != xs.end ()) xs.insert (x);
        else
        {
            xs.insert (x);
            auto it1 = xs.lower_bound (x), it2 = xs.upper_bound (x);
            if (it1 != xs.begin () && it2 != xs.end ())
                it1 --,
                delDif ((*it2) - (*it1)),
                it1 ++;
            if (it1 != xs.begin ())
                it1 --,
                dx.insert (x - (*it1));
            if (it2 != xs.end ())
                dx.insert ((*it2) - x);
        }
    }

    void del (int x)
    {
        if (xs.count (x) >= 2) xs.erase (xs.find (x));
        else
        {
            auto it1 = xs.lower_bound (x), it2 = xs.upper_bound (x);
            if (it1 != xs.begin () && it2 != xs.end ())
                it1 --,
                dx.insert ((*it2) - (*it1)),
                it1 ++;
            if (it1 != xs.begin ())
                it1 --,
                delDif (x - (*it1));
            if (it2 != xs.end ())
                delDif ((*it2) - x);
            xs.erase (x);
        }
    }

    int maxDif ()
    {
        if (dx.empty ()) return 0;
        return *(dx.rbegin ());
    }

    int getA ()
    {
        if (xs.empty ()) return INF;
        return (*xs.begin ()) - 1;
    }

    int getB ()
    {
        if (xs.empty ()) return INF;
        return C - (*xs.rbegin ());
    }

    void store (int &a, int &b, int &df)
    {
        a = getA ();
        b = getB ();
        df = maxDif () - 1;
    }
};

long long pos[1209];
int nr, stat[1209][3];
vector < pair < long long, int > > events;
deque < int > dq[3];

void clearDeque ()
{
    for (int i=0; i<3; i++)
        while (!dq[i].empty ())
            dq[i].pop_back ();
}

void add (int pos)
{
    for (int i=0; i<3; i++)
    {
        while (!dq[i].empty () && stat[dq[i].back ()][i] <= stat[pos][i])
            dq[i].pop_back ();
        dq[i].push_back (pos);
    }
}

void del (int pos)
{
    for (int i=0; i<3; i++)
        while (!dq[i].empty () && dq[i].front () <= pos)
            dq[i].pop_front ();
}

int getSum ()
{
    if (dq[0].empty ()) return 2 * INF;
    int minA = stat[dq[0].front ()][0], minB = stat[dq[1].front ()][1], minAB = stat[dq[2].front ()][2];
    return max (minA + minB, minAB);
}

void solve (int updown)
{
    ds::init ();
    clearDeque ();
    vector < long long > relevantXs, relevantX1, relevantX2;
    for (int i=1; i<=N; i++)
        relevantX1.push_back (x[i]),
        relevantX2.push_back (x[i] + updown + 1);
    relevantXs.resize (relevantX1.size () + relevantX2.size ());
    merge (relevantX1.begin (), relevantX1.end (), relevantX2.begin (), relevantX2.end (), relevantXs.begin ());

    nr = 1, pos[1] = -(1LL << 60), stat[1][0] = INF, stat[1][1] = INF, stat[1][2] = -1;
    int l = 1, r = 0;
    for (auto t : relevantXs)
    {
        while (r < N && x[r + 1] <= t)
            r ++;
        while (x[l] + updown < t && l <= N)
            l ++;
        nr ++, pos[nr] = t;
        stat[nr][0] = precalc[l][r][0];
        stat[nr][1] = precalc[l][r][1];
        stat[nr][2] = precalc[l][r][2];
    }
    pos[nr + 1] = 1LL << 60;
/*    printf ("%d ->\n", updown);
    for (int i=1; i<=nr; i++)
        printf ("%7lld %7d %7d %7d\n", pos[i], stat[i][0], stat[i][1], stat[i][2]);*/
    vector < long long > relevantShifts, relevantS1, relevantS2;
    for (int i=1; i<=nr; i++)
    {
        if (pos[i] - 1 <= updown) relevantS1.push_back (pos[i] - 1);
        if (pos[i] - R >= 0 && pos[i] - R <= updown) relevantS2.push_back (pos[i] - R);
    }
    relevantShifts.resize (relevantS1.size () + relevantS2.size ());
    merge (relevantS1.begin (), relevantS1.end (), relevantS2.begin (), relevantS2.end (), relevantShifts.begin ());
    relevantShifts.push_back (updown);
    int j = 1, i = 1;
    for (auto shift : relevantShifts)
    {
        while (j <= nr && pos[j] <= R + shift)
            add (j), j++;
        while (pos[i + 1] - 1 < 1 + shift)
            del (i), i ++;
        long long curr = (long long) updown + getSum ();
        if (curr < ans)
            ans = curr;
    }
}

void readAndSort ()
{
    pair < int, int > point[309];
    scanf ("%d %d\n", &R, &C);
    scanf ("%d", &N);
    for (int i=1; i<=N; i++)
        scanf ("%d %d", &point[i].first, &point[i].second);
    sort (point + 1, point + N + 1);
    for (int i=1; i<=N; i++)
        x[i] = point[i].first, y[i] = point[i].second;
}

void doPrecalc ()
{
    for (int i=1; i<=N + 1; i++)
    {
        ds::init ();
        ds::store (precalc[i][i - 1][0], precalc[i][i - 1][1], precalc[i][i - 1][2]);
        for (int j=i; j<=N; j++)
            ds::add (y[j]),
            ds::store (precalc[i][j][0], precalc[i][j][1], precalc[i][j][2]);
    }
}

int main ()
{
//freopen ("input", "r", stdin);
//freopen ("output", "w", stdout);

readAndSort ();
doPrecalc ();
for (int i=1; i<=N; i++)
    sa.insert (x[i] - 1), sb.insert (R - x[i]);
for (int i=1; i<=N; i++)
    for (int j=i + 1; j<=N; j++)
    if (x[i] != x[j])
    {
        int val = x[i] - x[j];
        if (val < 0) val = -val;
        sab.insert (val - 1);
    }
for (auto a : sa)
    for (auto b : sb)
        sab.insert (a + b);
int steps = 0;
vector < int > vsab;
for (auto ab : sab)
    vsab.push_back (ab);
random_shuffle (vsab.begin (), vsab.end ());
for (auto ab : vsab)
{
    if (ans >= ab)
        solve (ab), steps ++;
    if (steps == 70000)
        break;
}
//printf ("%d\n", steps);
printf ("%lld\n", ans);
return 0;
}

Compilation message

cultivation.cpp: In function 'void readAndSort()':
cultivation.cpp:176:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d\n", &R, &C);
     ~~~~~~^~~~~~~~~~~~~~~~~~~
cultivation.cpp:177:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d", &N);
     ~~~~~~^~~~~~~~~~
cultivation.cpp:179:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf ("%d %d", &point[i].first, &point[i].second);
         ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.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	408 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	460 KB	Output is correct
7	Correct	2 ms	460 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	552 KB	Output is correct
11	Correct	2 ms	552 KB	Output is correct
12	Correct	2 ms	552 KB	Output is correct
13	Correct	2 ms	672 KB	Output is correct
14	Correct	2 ms	672 KB	Output is correct
15	Correct	2 ms	672 KB	Output is correct
16	Correct	2 ms	672 KB	Output is correct

Subtask #2
10.0 / 10.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	408 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	460 KB	Output is correct
7	Correct	2 ms	460 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	552 KB	Output is correct
11	Correct	2 ms	552 KB	Output is correct
12	Correct	2 ms	552 KB	Output is correct
13	Correct	2 ms	672 KB	Output is correct
14	Correct	2 ms	672 KB	Output is correct
15	Correct	2 ms	672 KB	Output is correct
16	Correct	2 ms	672 KB	Output is correct
17	Correct	2 ms	672 KB	Output is correct
18	Correct	3 ms	816 KB	Output is correct
19	Correct	2 ms	816 KB	Output is correct
20	Correct	2 ms	816 KB	Output is correct
21	Correct	3 ms	816 KB	Output is correct
22	Correct	5 ms	944 KB	Output is correct
23	Correct	3 ms	944 KB	Output is correct
24	Correct	8 ms	1328 KB	Output is correct
25	Correct	6 ms	1328 KB	Output is correct
26	Correct	14 ms	1632 KB	Output is correct
27	Correct	14 ms	1712 KB	Output is correct
28	Correct	8 ms	1712 KB	Output is correct
29	Correct	16 ms	1712 KB	Output is correct
30	Correct	15 ms	1712 KB	Output is correct
31	Correct	14 ms	1836 KB	Output is correct
32	Correct	14 ms	1836 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	408 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	460 KB	Output is correct
7	Correct	2 ms	460 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	552 KB	Output is correct
11	Correct	2 ms	552 KB	Output is correct
12	Correct	2 ms	552 KB	Output is correct
13	Correct	2 ms	672 KB	Output is correct
14	Correct	2 ms	672 KB	Output is correct
15	Correct	2 ms	672 KB	Output is correct
16	Correct	2 ms	672 KB	Output is correct
17	Correct	2 ms	672 KB	Output is correct
18	Correct	3 ms	816 KB	Output is correct
19	Correct	2 ms	816 KB	Output is correct
20	Correct	2 ms	816 KB	Output is correct
21	Correct	3 ms	816 KB	Output is correct
22	Correct	5 ms	944 KB	Output is correct
23	Correct	3 ms	944 KB	Output is correct
24	Correct	8 ms	1328 KB	Output is correct
25	Correct	6 ms	1328 KB	Output is correct
26	Correct	14 ms	1632 KB	Output is correct
27	Correct	14 ms	1712 KB	Output is correct
28	Correct	8 ms	1712 KB	Output is correct
29	Correct	16 ms	1712 KB	Output is correct
30	Correct	15 ms	1712 KB	Output is correct
31	Correct	14 ms	1836 KB	Output is correct
32	Correct	14 ms	1836 KB	Output is correct
33	Correct	22 ms	1836 KB	Output is correct
34	Correct	18 ms	1836 KB	Output is correct
35	Correct	30 ms	1836 KB	Output is correct
36	Correct	34 ms	1836 KB	Output is correct
37	Correct	34 ms	1836 KB	Output is correct
38	Correct	34 ms	1836 KB	Output is correct
39	Correct	34 ms	1836 KB	Output is correct
40	Correct	34 ms	1900 KB	Output is correct
41	Correct	24 ms	1900 KB	Output is correct
42	Correct	24 ms	1900 KB	Output is correct
43	Correct	33 ms	1900 KB	Output is correct
44	Correct	27 ms	1900 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1900 KB	Output is correct
2	Correct	6 ms	1900 KB	Output is correct
3	Correct	4 ms	1900 KB	Output is correct
4	Correct	6 ms	1900 KB	Output is correct
5	Correct	6 ms	1900 KB	Output is correct
6	Correct	3 ms	1900 KB	Output is correct
7	Correct	2 ms	1900 KB	Output is correct
8	Correct	6 ms	1900 KB	Output is correct
9	Correct	4 ms	1900 KB	Output is correct
10	Correct	6 ms	1900 KB	Output is correct
11	Correct	5 ms	1900 KB	Output is correct
12	Correct	4 ms	1900 KB	Output is correct
13	Correct	7 ms	1900 KB	Output is correct
14	Correct	4 ms	1900 KB	Output is correct
15	Correct	3 ms	1900 KB	Output is correct
16	Correct	5 ms	1900 KB	Output is correct
17	Correct	5 ms	1900 KB	Output is correct
18	Correct	5 ms	1900 KB	Output is correct
19	Correct	5 ms	1900 KB	Output is correct
20	Correct	7 ms	1900 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	1900 KB	Output is correct
2	Correct	6 ms	1900 KB	Output is correct
3	Correct	4 ms	1900 KB	Output is correct
4	Correct	6 ms	1900 KB	Output is correct
5	Correct	6 ms	1900 KB	Output is correct
6	Correct	3 ms	1900 KB	Output is correct
7	Correct	2 ms	1900 KB	Output is correct
8	Correct	6 ms	1900 KB	Output is correct
9	Correct	4 ms	1900 KB	Output is correct
10	Correct	6 ms	1900 KB	Output is correct
11	Correct	5 ms	1900 KB	Output is correct
12	Correct	4 ms	1900 KB	Output is correct
13	Correct	7 ms	1900 KB	Output is correct
14	Correct	4 ms	1900 KB	Output is correct
15	Correct	3 ms	1900 KB	Output is correct
16	Correct	5 ms	1900 KB	Output is correct
17	Correct	5 ms	1900 KB	Output is correct
18	Correct	5 ms	1900 KB	Output is correct
19	Correct	5 ms	1900 KB	Output is correct
20	Correct	7 ms	1900 KB	Output is correct
21	Correct	28 ms	1900 KB	Output is correct
22	Correct	88 ms	1916 KB	Output is correct
23	Correct	215 ms	1916 KB	Output is correct
24	Correct	212 ms	1916 KB	Output is correct
25	Correct	87 ms	1916 KB	Output is correct
26	Correct	58 ms	1916 KB	Output is correct
27	Correct	243 ms	1916 KB	Output is correct
28	Correct	76 ms	1916 KB	Output is correct
29	Correct	53 ms	1916 KB	Output is correct
30	Correct	111 ms	1916 KB	Output is correct
31	Correct	73 ms	1916 KB	Output is correct
32	Correct	80 ms	1916 KB	Output is correct
33	Correct	212 ms	1916 KB	Output is correct
34	Correct	183 ms	1916 KB	Output is correct
35	Correct	199 ms	1916 KB	Output is correct
36	Correct	91 ms	1916 KB	Output is correct

Subtask #6
0 / 20.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	408 KB	Output is correct
4	Correct	2 ms	460 KB	Output is correct
5	Correct	2 ms	460 KB	Output is correct
6	Correct	2 ms	460 KB	Output is correct
7	Correct	2 ms	460 KB	Output is correct
8	Correct	2 ms	552 KB	Output is correct
9	Correct	2 ms	552 KB	Output is correct
10	Correct	2 ms	552 KB	Output is correct
11	Correct	2 ms	552 KB	Output is correct
12	Correct	2 ms	552 KB	Output is correct
13	Correct	2 ms	672 KB	Output is correct
14	Correct	2 ms	672 KB	Output is correct
15	Correct	2 ms	672 KB	Output is correct
16	Correct	2 ms	672 KB	Output is correct
17	Correct	2 ms	672 KB	Output is correct
18	Correct	3 ms	816 KB	Output is correct
19	Correct	2 ms	816 KB	Output is correct
20	Correct	2 ms	816 KB	Output is correct
21	Correct	3 ms	816 KB	Output is correct
22	Correct	5 ms	944 KB	Output is correct
23	Correct	3 ms	944 KB	Output is correct
24	Correct	8 ms	1328 KB	Output is correct
25	Correct	6 ms	1328 KB	Output is correct
26	Correct	14 ms	1632 KB	Output is correct
27	Correct	14 ms	1712 KB	Output is correct
28	Correct	8 ms	1712 KB	Output is correct
29	Correct	16 ms	1712 KB	Output is correct
30	Correct	15 ms	1712 KB	Output is correct
31	Correct	14 ms	1836 KB	Output is correct
32	Correct	14 ms	1836 KB	Output is correct
33	Correct	22 ms	1836 KB	Output is correct
34	Correct	18 ms	1836 KB	Output is correct
35	Correct	30 ms	1836 KB	Output is correct
36	Correct	34 ms	1836 KB	Output is correct
37	Correct	34 ms	1836 KB	Output is correct
38	Correct	34 ms	1836 KB	Output is correct
39	Correct	34 ms	1836 KB	Output is correct
40	Correct	34 ms	1900 KB	Output is correct
41	Correct	24 ms	1900 KB	Output is correct
42	Correct	24 ms	1900 KB	Output is correct
43	Correct	33 ms	1900 KB	Output is correct
44	Correct	27 ms	1900 KB	Output is correct
45	Correct	3 ms	1900 KB	Output is correct
46	Correct	6 ms	1900 KB	Output is correct
47	Correct	4 ms	1900 KB	Output is correct
48	Correct	6 ms	1900 KB	Output is correct
49	Correct	6 ms	1900 KB	Output is correct
50	Correct	3 ms	1900 KB	Output is correct
51	Correct	2 ms	1900 KB	Output is correct
52	Correct	6 ms	1900 KB	Output is correct
53	Correct	4 ms	1900 KB	Output is correct
54	Correct	6 ms	1900 KB	Output is correct
55	Correct	5 ms	1900 KB	Output is correct
56	Correct	4 ms	1900 KB	Output is correct
57	Correct	7 ms	1900 KB	Output is correct
58	Correct	4 ms	1900 KB	Output is correct
59	Correct	3 ms	1900 KB	Output is correct
60	Correct	5 ms	1900 KB	Output is correct
61	Correct	5 ms	1900 KB	Output is correct
62	Correct	5 ms	1900 KB	Output is correct
63	Correct	5 ms	1900 KB	Output is correct
64	Correct	7 ms	1900 KB	Output is correct
65	Correct	28 ms	1900 KB	Output is correct
66	Correct	88 ms	1916 KB	Output is correct
67	Correct	215 ms	1916 KB	Output is correct
68	Correct	212 ms	1916 KB	Output is correct
69	Correct	87 ms	1916 KB	Output is correct
70	Correct	58 ms	1916 KB	Output is correct
71	Correct	243 ms	1916 KB	Output is correct
72	Correct	76 ms	1916 KB	Output is correct
73	Correct	53 ms	1916 KB	Output is correct
74	Correct	111 ms	1916 KB	Output is correct
75	Correct	73 ms	1916 KB	Output is correct
76	Correct	80 ms	1916 KB	Output is correct
77	Correct	212 ms	1916 KB	Output is correct
78	Correct	183 ms	1916 KB	Output is correct
79	Correct	199 ms	1916 KB	Output is correct
80	Correct	91 ms	1916 KB	Output is correct
81	Correct	587 ms	5488 KB	Output is correct
82	Correct	548 ms	5496 KB	Output is correct
83	Correct	441 ms	5628 KB	Output is correct
84	Execution timed out	2079 ms	6520 KB	Time limit exceeded
85	Halted	0 ms	0 KB	-

답안 #47091

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 30.0 / 30.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
30.0 / 30.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 20.0