oj.uz

Submission #47086

# Submission time Handle Problem Language Result Execution time Memory
47086 2018-04-27T10:49:24 Z SpaimaCarpatilor Cultivation (JOI17_cultivation) C++17
80 / 100
 2000 ms 4184 KB 
#include<bits/stdc++.h>

using namespace std;

int N, R, C, x[309], y[309];
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 ());
    }
}

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 ();
    events.clear ();
    clearDeque ();
    for (int i=1; i<=N; i++)
    {
        events.push_back ({x[i], -y[i]});
        events.push_back ({x[i] + updown + 1, y[i]});
    }
    sort (events.begin (), events.end ()), nr = 1;
    pos[1] = -(1LL << 60), stat[1][0] = INF, stat[1][1] = INF, stat[1][2] = -1;
    for (int ii=0; ii<events.size (); ii++)
    {
        int jj = ii;
        while (jj < events.size () && events[jj].first == events[ii].first)
        {
            if (events[jj].second < 0) ds::add (-events[jj].second);
            else ds::del (events[jj].second);
            jj ++;
        }
        jj --;
        ///[ii, jj]
        nr ++, pos[nr] = events[ii].first;
        stat[nr][0] = ds::getA ();
        stat[nr][1] = ds::getB ();
        stat[nr][2] = ds::maxDif () - 1;
        ///
        ii = jj;
    }
    ///we want [i, j] so that pos[j + 1] - pos[i - 1] - 1 >= updown
    ///and max (max (stat[k][0]) + max (stat[k][1]), max (stat[k][2])) is minimal for i<=k<=j
    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;
    for (int i=1; i<=nr; i++)
    {
        if (pos[i] - 1 <= updown) relevantShifts.push_back (pos[i] - 1);
        if (pos[i] - R >= 0 && pos[i] - R <= updown) relevantShifts.push_back (pos[i] - R);
    }
    relevantShifts.push_back (updown);
    sort (relevantShifts.begin (), relevantShifts.end ());
    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;
    }
}

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

scanf ("%d %d\n", &R, &C);
scanf ("%d", &N);
for (int i=1; i<=N; i++)
    scanf ("%d %d", &x[i], &y[i]);
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);
for (auto ab : sab)
    solve (ab);
printf ("%lld\n", ans);
return 0;
}

Compilation message

cultivation.cpp: In function 'void solve(int)':
cultivation.cpp:128:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii=0; ii<events.size (); ii++)
                    ~~^~~~~~~~~~~~~~~
cultivation.cpp:131:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while (jj < events.size () && events[jj].first == events[ii].first)
                ~~~^~~~~~~~~~~~~~~~
cultivation.cpp: In function 'int main()':
cultivation.cpp:178:7: 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:179:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d", &N);
 ~~~~~~^~~~~~~~~~
cultivation.cpp:181:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf ("%d %d", &x[i], &y[i]);
     ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 480 KB Output is correct
10 Correct 2 ms 480 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 700 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 480 KB Output is correct
10 Correct 2 ms 480 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 4 ms 700 KB Output is correct
19 Correct 3 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 4 ms 700 KB Output is correct
22 Correct 11 ms 720 KB Output is correct
23 Correct 3 ms 720 KB Output is correct
24 Correct 14 ms 720 KB Output is correct
25 Correct 14 ms 720 KB Output is correct
26 Correct 28 ms 720 KB Output is correct
27 Correct 20 ms 720 KB Output is correct
28 Correct 13 ms 720 KB Output is correct
29 Correct 19 ms 720 KB Output is correct
30 Correct 25 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 25 ms 720 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 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 480 KB Output is correct
10 Correct 2 ms 480 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 4 ms 700 KB Output is correct
19 Correct 3 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 4 ms 700 KB Output is correct
22 Correct 11 ms 720 KB Output is correct
23 Correct 3 ms 720 KB Output is correct
24 Correct 14 ms 720 KB Output is correct
25 Correct 14 ms 720 KB Output is correct
26 Correct 28 ms 720 KB Output is correct
27 Correct 20 ms 720 KB Output is correct
28 Correct 13 ms 720 KB Output is correct
29 Correct 19 ms 720 KB Output is correct
30 Correct 25 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 25 ms 720 KB Output is correct
33 Correct 4 ms 720 KB Output is correct
34 Correct 24 ms 720 KB Output is correct
35 Correct 34 ms 720 KB Output is correct
36 Correct 41 ms 720 KB Output is correct
37 Correct 35 ms 720 KB Output is correct
38 Correct 40 ms 720 KB Output is correct
39 Correct 38 ms 720 KB Output is correct
40 Correct 40 ms 720 KB Output is correct
41 Correct 26 ms 720 KB Output is correct
42 Correct 26 ms 720 KB Output is correct
43 Correct 46 ms 720 KB Output is correct
44 Correct 33 ms 720 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 720 KB Output is correct
2 Correct 13 ms 804 KB Output is correct
3 Correct 13 ms 804 KB Output is correct
4 Correct 14 ms 804 KB Output is correct
5 Correct 21 ms 804 KB Output is correct
6 Correct 5 ms 804 KB Output is correct
7 Correct 3 ms 804 KB Output is correct
8 Correct 13 ms 804 KB Output is correct
9 Correct 8 ms 804 KB Output is correct
10 Correct 14 ms 804 KB Output is correct
11 Correct 14 ms 804 KB Output is correct
12 Correct 16 ms 804 KB Output is correct
13 Correct 4 ms 804 KB Output is correct
14 Correct 7 ms 804 KB Output is correct
15 Correct 5 ms 804 KB Output is correct
16 Correct 13 ms 804 KB Output is correct
17 Correct 13 ms 804 KB Output is correct
18 Correct 10 ms 804 KB Output is correct
19 Correct 14 ms 804 KB Output is correct
20 Correct 12 ms 804 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 720 KB Output is correct
2 Correct 13 ms 804 KB Output is correct
3 Correct 13 ms 804 KB Output is correct
4 Correct 14 ms 804 KB Output is correct
5 Correct 21 ms 804 KB Output is correct
6 Correct 5 ms 804 KB Output is correct
7 Correct 3 ms 804 KB Output is correct
8 Correct 13 ms 804 KB Output is correct
9 Correct 8 ms 804 KB Output is correct
10 Correct 14 ms 804 KB Output is correct
11 Correct 14 ms 804 KB Output is correct
12 Correct 16 ms 804 KB Output is correct
13 Correct 4 ms 804 KB Output is correct
14 Correct 7 ms 804 KB Output is correct
15 Correct 5 ms 804 KB Output is correct
16 Correct 13 ms 804 KB Output is correct
17 Correct 13 ms 804 KB Output is correct
18 Correct 10 ms 804 KB Output is correct
19 Correct 14 ms 804 KB Output is correct
20 Correct 12 ms 804 KB Output is correct
21 Correct 1025 ms 1156 KB Output is correct
22 Correct 1795 ms 1596 KB Output is correct
23 Correct 1806 ms 1596 KB Output is correct
24 Correct 1685 ms 1596 KB Output is correct
25 Correct 1773 ms 1596 KB Output is correct
26 Correct 490 ms 1596 KB Output is correct
27 Correct 941 ms 1596 KB Output is correct
28 Correct 1733 ms 1688 KB Output is correct
29 Correct 1857 ms 1688 KB Output is correct
30 Correct 1781 ms 1724 KB Output is correct
31 Correct 1824 ms 1724 KB Output is correct
32 Correct 1657 ms 1724 KB Output is correct
33 Correct 748 ms 1724 KB Output is correct
34 Correct 1651 ms 1740 KB Output is correct
35 Correct 1439 ms 1740 KB Output is correct
36 Correct 1815 ms 1740 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 428 KB Output is correct
5 Correct 2 ms 428 KB Output is correct
6 Correct 2 ms 432 KB Output is correct
7 Correct 2 ms 476 KB Output is correct
8 Correct 2 ms 480 KB Output is correct
9 Correct 2 ms 480 KB Output is correct
10 Correct 2 ms 480 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 632 KB Output is correct
14 Correct 2 ms 632 KB Output is correct
15 Correct 2 ms 632 KB Output is correct
16 Correct 2 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 4 ms 700 KB Output is correct
19 Correct 3 ms 700 KB Output is correct
20 Correct 2 ms 700 KB Output is correct
21 Correct 4 ms 700 KB Output is correct
22 Correct 11 ms 720 KB Output is correct
23 Correct 3 ms 720 KB Output is correct
24 Correct 14 ms 720 KB Output is correct
25 Correct 14 ms 720 KB Output is correct
26 Correct 28 ms 720 KB Output is correct
27 Correct 20 ms 720 KB Output is correct
28 Correct 13 ms 720 KB Output is correct
29 Correct 19 ms 720 KB Output is correct
30 Correct 25 ms 720 KB Output is correct
31 Correct 21 ms 720 KB Output is correct
32 Correct 25 ms 720 KB Output is correct
33 Correct 4 ms 720 KB Output is correct
34 Correct 24 ms 720 KB Output is correct
35 Correct 34 ms 720 KB Output is correct
36 Correct 41 ms 720 KB Output is correct
37 Correct 35 ms 720 KB Output is correct
38 Correct 40 ms 720 KB Output is correct
39 Correct 38 ms 720 KB Output is correct
40 Correct 40 ms 720 KB Output is correct
41 Correct 26 ms 720 KB Output is correct
42 Correct 26 ms 720 KB Output is correct
43 Correct 46 ms 720 KB Output is correct
44 Correct 33 ms 720 KB Output is correct
45 Correct 5 ms 720 KB Output is correct
46 Correct 13 ms 804 KB Output is correct
47 Correct 13 ms 804 KB Output is correct
48 Correct 14 ms 804 KB Output is correct
49 Correct 21 ms 804 KB Output is correct
50 Correct 5 ms 804 KB Output is correct
51 Correct 3 ms 804 KB Output is correct
52 Correct 13 ms 804 KB Output is correct
53 Correct 8 ms 804 KB Output is correct
54 Correct 14 ms 804 KB Output is correct
55 Correct 14 ms 804 KB Output is correct
56 Correct 16 ms 804 KB Output is correct
57 Correct 4 ms 804 KB Output is correct
58 Correct 7 ms 804 KB Output is correct
59 Correct 5 ms 804 KB Output is correct
60 Correct 13 ms 804 KB Output is correct
61 Correct 13 ms 804 KB Output is correct
62 Correct 10 ms 804 KB Output is correct
63 Correct 14 ms 804 KB Output is correct
64 Correct 12 ms 804 KB Output is correct
65 Correct 1025 ms 1156 KB Output is correct
66 Correct 1795 ms 1596 KB Output is correct
67 Correct 1806 ms 1596 KB Output is correct
68 Correct 1685 ms 1596 KB Output is correct
69 Correct 1773 ms 1596 KB Output is correct
70 Correct 490 ms 1596 KB Output is correct
71 Correct 941 ms 1596 KB Output is correct
72 Correct 1733 ms 1688 KB Output is correct
73 Correct 1857 ms 1688 KB Output is correct
74 Correct 1781 ms 1724 KB Output is correct
75 Correct 1824 ms 1724 KB Output is correct
76 Correct 1657 ms 1724 KB Output is correct
77 Correct 748 ms 1724 KB Output is correct
78 Correct 1651 ms 1740 KB Output is correct
79 Correct 1439 ms 1740 KB Output is correct
80 Correct 1815 ms 1740 KB Output is correct
81 Execution timed out 2086 ms 4184 KB Time limit exceeded
82 Halted 0 ms 0 KB -