oj.uz

Submission #47044

# Submission time Handle Problem Language Result Execution time Memory
47044 2018-04-26T19:23:56 Z SpaimaCarpatilor Cultivation (JOI17_cultivation) C++17
30 / 100
 498 ms 1000 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 ());
    }
}

vector < pair < int, int > > events;
void solve (int up, int down)
{
    int minA = 0, minB = 0, minAB = 0;
    ds::init ();
    events.clear ();
    for (int i=1; i<=N; i++)
    {
        int lx = max (1, x[i] - up), dx = min (R, x[i] + down);
        events.push_back ({lx, -y[i]});
        if (dx + 1 <= R)
            events.push_back ({dx + 1, y[i]});
    }
    sort (events.begin (), events.end ());
    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]
        minA = max (minA, ds::getA ());
        minB = max (minB, ds::getB ());
        minAB = max (minAB, ds::maxDif () - 1);
        ///
        ii = jj;
    }
//    printf ("(%d, %d) -> (%d, %d, %d)\n", up, down, minA, minB, minAB);
    long long curr = (long long) max (minA + minB, minAB) + up + down;
    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)
        solve (a, b);
for (auto ab : sab)
    solve (ab / 2, ab - ab / 2);
printf ("%lld\n", ans);
return 0;
}

Compilation message

cultivation.cpp: In function 'void solve(int, int)':
cultivation.cpp:94:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int ii=0; ii<events.size (); ii++)
                    ~~^~~~~~~~~~~~~~~
cultivation.cpp:97: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:122: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:123:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 scanf ("%d", &N);
 ~~~~~~^~~~~~~~~~
cultivation.cpp:125: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 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 2 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 2 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 3 ms 656 KB Output is correct
18 Correct 15 ms 692 KB Output is correct
19 Correct 8 ms 692 KB Output is correct
20 Correct 2 ms 692 KB Output is correct
21 Correct 23 ms 708 KB Output is correct
22 Correct 70 ms 712 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 127 ms 848 KB Output is correct
25 Correct 87 ms 848 KB Output is correct
26 Correct 195 ms 972 KB Output is correct
27 Correct 194 ms 972 KB Output is correct
28 Correct 120 ms 972 KB Output is correct
29 Correct 176 ms 972 KB Output is correct
30 Correct 197 ms 972 KB Output is correct
31 Correct 205 ms 972 KB Output is correct
32 Correct 204 ms 972 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 2 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 3 ms 656 KB Output is correct
18 Correct 15 ms 692 KB Output is correct
19 Correct 8 ms 692 KB Output is correct
20 Correct 2 ms 692 KB Output is correct
21 Correct 23 ms 708 KB Output is correct
22 Correct 70 ms 712 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 127 ms 848 KB Output is correct
25 Correct 87 ms 848 KB Output is correct
26 Correct 195 ms 972 KB Output is correct
27 Correct 194 ms 972 KB Output is correct
28 Correct 120 ms 972 KB Output is correct
29 Correct 176 ms 972 KB Output is correct
30 Correct 197 ms 972 KB Output is correct
31 Correct 205 ms 972 KB Output is correct
32 Correct 204 ms 972 KB Output is correct
33 Correct 3 ms 972 KB Output is correct
34 Correct 319 ms 972 KB Output is correct
35 Correct 388 ms 972 KB Output is correct
36 Correct 468 ms 972 KB Output is correct
37 Correct 373 ms 1000 KB Output is correct
38 Correct 482 ms 1000 KB Output is correct
39 Correct 498 ms 1000 KB Output is correct
40 Correct 467 ms 1000 KB Output is correct
41 Correct 131 ms 1000 KB Output is correct
42 Correct 286 ms 1000 KB Output is correct
43 Correct 460 ms 1000 KB Output is correct
44 Correct 337 ms 1000 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1000 KB Output is correct
2 Correct 10 ms 1000 KB Output is correct
3 Correct 11 ms 1000 KB Output is correct
4 Correct 11 ms 1000 KB Output is correct
5 Correct 11 ms 1000 KB Output is correct
6 Incorrect 7 ms 1000 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1000 KB Output is correct
2 Correct 10 ms 1000 KB Output is correct
3 Correct 11 ms 1000 KB Output is correct
4 Correct 11 ms 1000 KB Output is correct
5 Correct 11 ms 1000 KB Output is correct
6 Incorrect 7 ms 1000 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 2 ms 564 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 2 ms 656 KB Output is correct
13 Correct 2 ms 656 KB Output is correct
14 Correct 2 ms 656 KB Output is correct
15 Correct 2 ms 656 KB Output is correct
16 Correct 2 ms 656 KB Output is correct
17 Correct 3 ms 656 KB Output is correct
18 Correct 15 ms 692 KB Output is correct
19 Correct 8 ms 692 KB Output is correct
20 Correct 2 ms 692 KB Output is correct
21 Correct 23 ms 708 KB Output is correct
22 Correct 70 ms 712 KB Output is correct
23 Correct 4 ms 716 KB Output is correct
24 Correct 127 ms 848 KB Output is correct
25 Correct 87 ms 848 KB Output is correct
26 Correct 195 ms 972 KB Output is correct
27 Correct 194 ms 972 KB Output is correct
28 Correct 120 ms 972 KB Output is correct
29 Correct 176 ms 972 KB Output is correct
30 Correct 197 ms 972 KB Output is correct
31 Correct 205 ms 972 KB Output is correct
32 Correct 204 ms 972 KB Output is correct
33 Correct 3 ms 972 KB Output is correct
34 Correct 319 ms 972 KB Output is correct
35 Correct 388 ms 972 KB Output is correct
36 Correct 468 ms 972 KB Output is correct
37 Correct 373 ms 1000 KB Output is correct
38 Correct 482 ms 1000 KB Output is correct
39 Correct 498 ms 1000 KB Output is correct
40 Correct 467 ms 1000 KB Output is correct
41 Correct 131 ms 1000 KB Output is correct
42 Correct 286 ms 1000 KB Output is correct
43 Correct 460 ms 1000 KB Output is correct
44 Correct 337 ms 1000 KB Output is correct
45 Correct 4 ms 1000 KB Output is correct
46 Correct 10 ms 1000 KB Output is correct
47 Correct 11 ms 1000 KB Output is correct
48 Correct 11 ms 1000 KB Output is correct
49 Correct 11 ms 1000 KB Output is correct
50 Incorrect 7 ms 1000 KB Output isn't correct
51 Halted 0 ms 0 KB -