답안 #801599

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
801599	2023-08-02T06:50:38 Z	반딧불(#10089)	Cultivation (JOI17_cultivation)	C++17	80 / 100	2000 ms	1484 KB

cultivation

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int INF = 2e9;

ll n, m; int k;
ll X[302], Y[302];
int rx[302], ry[302], sx, sy;
ll ans = LLONG_MAX;

struct Event{
    ll x, y, v;
    Event(){}
    Event(ll x, ll y, ll v): x(x), y(y), v(v){}
    bool operator<(const Event &r)const{
        if(x!=r.x) return x<r.x;
        return v > r.v;
    }
} vec[1002];

struct Interval{
    ll l, r; /// ���� ����
    ll ldist, rdist, mdist; /// �ּ� ����
    Interval(){}
    Interval(ll l, ll r, ll ldist, ll rdist, ll mdist): l(l), r(r), ldist(ldist), rdist(rdist), mdist(mdist){}
    bool operator<(const Interval &nxt)const{
        return l<nxt.l;
    }
};

vector<ll> vx, vy;
struct diffTree{
    int cnt[1024];
    ll lv[1024], rv[1024], diff[1024];

    inline void merge(int i){
        cnt[i] = cnt[i*2] + cnt[i*2+1];
        lv[i] = min(lv[i*2], lv[i*2+1]);
        rv[i] = max(rv[i*2], rv[i*2+1]);
        diff[i] = max({diff[i*2], diff[i*2+1], (cnt[i*2] && cnt[i*2+1]) ? (lv[i*2+1] - rv[i*2] - 1) : 0});
    }

    void init(int i, int l, int r){
        if(l==r){
            cnt[i] = 0;
            lv[i] = INF, rv[i] = 0, diff[i] = 0;
            return;
        }
        int m = (l+r)>>1;
        init(i*2, l, m);
        init(i*2+1, m+1, r);
        merge(i);
    }

    void update(int i, int l, int r, int x, int v){
        if(l==r){
            cnt[i] += v;
            if(!cnt[i]) lv[i] = INF, rv[i] = 0, diff[i] = 0;
            else lv[i] = rv[i] = vy[l-1], diff[i] = 0;
            return;
        }
        int m = (l+r)>>1;
        if(x<=m) update(i*2, l, m, x, v);
        else update(i*2+1, m+1, r, x, v);
        merge(i);
    }
} difftree;

void renumber(){
    vx = vector<ll> (X+1, X+k+1);
    vy = vector<ll> (Y+1, Y+k+1);
    sort(vx.begin(), vx.end());
    vx.erase(unique(vx.begin(), vx.end()), vx.end());
    sort(vy.begin(), vy.end());
    vy.erase(unique(vy.begin(), vy.end()), vy.end());
    sx = (int)vx.size(), sy = (int)vy.size();
    for(int i=1; i<=k; i++){
        rx[i] = lower_bound(vx.begin(), vx.end(), X[i]) - vx.begin() + 1;
        ry[i] = lower_bound(vy.begin(), vy.end(), Y[i]) - vy.begin() + 1;
    }
}

pair<ll, int> dqL[1002], dqR[1002], dqLen[1002];
int l1, l2, r1, r2, len1, len2;

Interval info[1002];
int infoCnt;

ll udlength[500002], udsize;

int main(){
    scanf("%lld %lld %d", &n, &m, &k);
//    n=m=1000000000, k=300;
    for(int i=1; i<=k; i++){
        scanf("%lld %lld", &X[i], &Y[i]);
//        X[i] = Y[i] = i*i+i+2;
    }
    renumber();

    udlength[udsize++] = n-1;
    for(int i=1; i<=k; i++){
        udlength[udsize++] = X[i] - 1;
        udlength[udsize++] = n - X[i];
        for(int j=1; j<=k; j++){
            if(X[i] < X[j]) udlength[udsize++] = X[j] - X[i] - 1;
            udlength[udsize++] = X[i] + n - X[j] - 1;
        }
    }
    sort(udlength, udlength+udsize);
    udsize = unique(udlength, udlength+udsize) - udlength;

    for(int ui=0; ui<udsize; ui++){ /// �� - �Ʒ� ����
        ll ud = udlength[ui];
        if(ud<0) continue;

        for(int i=1; i<=k; i++){
            vec[i*2-2] = Event(X[i], ry[i], 1);
            vec[i*2-1] = Event(X[i]+ud+1, ry[i], -1);
        }
        sort(vec, vec+k+k);

        infoCnt = 0;
        difftree.init(1, 1, sy);
        bool bad = 0;

        for(int s=0; s<k+k; s++){
            int e = s;
            while(e+1 < k+k && vec[e+1].x == vec[s].x) e++;
            if(e+1 == k+k) break;

            /// [s, e] ���� �������� ó��
            for(int i=s; i<=e; i++){
                if(vec[i].v == 1) difftree.update(1, 1, sy, vec[i].y, 1);
                else difftree.update(1, 1, sy, vec[i].y, -1);
            }

            /// ��� ������ �Ѿ
            if(difftree.cnt[1] == 0){
                bad = 1;
                break;
            }

            info[infoCnt++] = Interval(vec[s].x, vec[e+1].x-1, difftree.lv[1] - 1, m - difftree.rv[1], difftree.diff[1]);
            s = e;
        }
        if(bad || !infoCnt) continue;

        int j = 0;
        l1 = l2 = r1 = r2 = len1 = len2 = 0;
        dqL[l2++] = make_pair(info[0].ldist, 0);
        dqR[r2++] = make_pair(info[0].rdist, 0);
        dqLen[len2++] = make_pair(info[0].mdist, 0);

        for(int i=0; i<infoCnt; i++){
            if(l1!=l2 && dqL[l1].second < i) l1++;
            if(r1!=r2 && dqR[r1].second < i) r1++;
            if(len1!=len2 && dqLen[len1].second < i) len1++;
            while(j < infoCnt && info[j].r - info[i].l + 1 < n){
                j++;
                while(l1!=l2 && dqL[l2-1].first <= info[j].ldist) l2--;
                dqL[l2++] = make_pair(info[j].ldist, j);
                while(r1!=r2 && dqR[r2-1].first <= info[j].rdist) r2--;
                dqR[r2++] = make_pair(info[j].rdist, j);
                while(len1!=len2 && dqLen[len2-1].first <= info[j].mdist) len2--;
                dqLen[len2++] = make_pair(info[j].mdist, j);
            }
            if(j == infoCnt) break;
            ll minL = dqL[l1].first, minR = dqR[r1].first, len = dqLen[len1].first;
            ans = min(ans, ud + max(len, minL+minR));
        }
    }

    printf("%lld", ans);
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |     scanf("%lld %lld %d", &n, &m, &k);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
cultivation.cpp:97:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   97 |         scanf("%lld %lld", &X[i], &Y[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	336 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	468 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	724 KB	Output is correct
25	Correct	3 ms	596 KB	Output is correct
26	Correct	8 ms	1364 KB	Output is correct
27	Correct	9 ms	1364 KB	Output is correct
28	Correct	5 ms	724 KB	Output is correct
29	Correct	10 ms	1364 KB	Output is correct
30	Correct	10 ms	1368 KB	Output is correct
31	Correct	9 ms	1364 KB	Output is correct
32	Correct	9 ms	1424 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	336 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	468 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	724 KB	Output is correct
25	Correct	3 ms	596 KB	Output is correct
26	Correct	8 ms	1364 KB	Output is correct
27	Correct	9 ms	1364 KB	Output is correct
28	Correct	5 ms	724 KB	Output is correct
29	Correct	10 ms	1364 KB	Output is correct
30	Correct	10 ms	1368 KB	Output is correct
31	Correct	9 ms	1364 KB	Output is correct
32	Correct	9 ms	1424 KB	Output is correct
33	Correct	2 ms	1236 KB	Output is correct
34	Correct	10 ms	1364 KB	Output is correct
35	Correct	10 ms	1364 KB	Output is correct
36	Correct	11 ms	1372 KB	Output is correct
37	Correct	10 ms	1436 KB	Output is correct
38	Correct	11 ms	1440 KB	Output is correct
39	Correct	11 ms	1432 KB	Output is correct
40	Correct	11 ms	1436 KB	Output is correct
41	Correct	7 ms	1300 KB	Output is correct
42	Correct	8 ms	1236 KB	Output is correct
43	Correct	11 ms	1484 KB	Output is correct
44	Correct	10 ms	1436 KB	Output is correct

Subtask #4
30.0 / 30.0

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

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	3 ms	340 KB	Output is correct
3	Correct	3 ms	356 KB	Output is correct
4	Correct	3 ms	340 KB	Output is correct
5	Correct	3 ms	356 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	3 ms	340 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	3 ms	340 KB	Output is correct
11	Correct	3 ms	340 KB	Output is correct
12	Correct	3 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	3 ms	340 KB	Output is correct
17	Correct	3 ms	340 KB	Output is correct
18	Correct	2 ms	340 KB	Output is correct
19	Correct	4 ms	340 KB	Output is correct
20	Correct	3 ms	340 KB	Output is correct
21	Correct	129 ms	468 KB	Output is correct
22	Correct	214 ms	468 KB	Output is correct
23	Correct	208 ms	468 KB	Output is correct
24	Correct	165 ms	456 KB	Output is correct
25	Correct	212 ms	468 KB	Output is correct
26	Correct	81 ms	468 KB	Output is correct
27	Correct	208 ms	468 KB	Output is correct
28	Correct	214 ms	468 KB	Output is correct
29	Correct	203 ms	468 KB	Output is correct
30	Correct	209 ms	464 KB	Output is correct
31	Correct	210 ms	596 KB	Output is correct
32	Correct	203 ms	468 KB	Output is correct
33	Correct	209 ms	468 KB	Output is correct
34	Correct	212 ms	468 KB	Output is correct
35	Correct	230 ms	468 KB	Output is correct
36	Correct	216 ms	460 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	0 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	0 ms	340 KB	Output is correct
11	Correct	0 ms	340 KB	Output is correct
12	Correct	0 ms	340 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	0 ms	340 KB	Output is correct
17	Correct	0 ms	336 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	0 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	2 ms	468 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	5 ms	724 KB	Output is correct
25	Correct	3 ms	596 KB	Output is correct
26	Correct	8 ms	1364 KB	Output is correct
27	Correct	9 ms	1364 KB	Output is correct
28	Correct	5 ms	724 KB	Output is correct
29	Correct	10 ms	1364 KB	Output is correct
30	Correct	10 ms	1368 KB	Output is correct
31	Correct	9 ms	1364 KB	Output is correct
32	Correct	9 ms	1424 KB	Output is correct
33	Correct	2 ms	1236 KB	Output is correct
34	Correct	10 ms	1364 KB	Output is correct
35	Correct	10 ms	1364 KB	Output is correct
36	Correct	11 ms	1372 KB	Output is correct
37	Correct	10 ms	1436 KB	Output is correct
38	Correct	11 ms	1440 KB	Output is correct
39	Correct	11 ms	1432 KB	Output is correct
40	Correct	11 ms	1436 KB	Output is correct
41	Correct	7 ms	1300 KB	Output is correct
42	Correct	8 ms	1236 KB	Output is correct
43	Correct	11 ms	1484 KB	Output is correct
44	Correct	10 ms	1436 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	3 ms	340 KB	Output is correct
47	Correct	3 ms	356 KB	Output is correct
48	Correct	3 ms	340 KB	Output is correct
49	Correct	3 ms	356 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	3 ms	340 KB	Output is correct
53	Correct	2 ms	340 KB	Output is correct
54	Correct	3 ms	340 KB	Output is correct
55	Correct	3 ms	340 KB	Output is correct
56	Correct	3 ms	340 KB	Output is correct
57	Correct	1 ms	340 KB	Output is correct
58	Correct	2 ms	340 KB	Output is correct
59	Correct	1 ms	340 KB	Output is correct
60	Correct	3 ms	340 KB	Output is correct
61	Correct	3 ms	340 KB	Output is correct
62	Correct	2 ms	340 KB	Output is correct
63	Correct	4 ms	340 KB	Output is correct
64	Correct	3 ms	340 KB	Output is correct
65	Correct	129 ms	468 KB	Output is correct
66	Correct	214 ms	468 KB	Output is correct
67	Correct	208 ms	468 KB	Output is correct
68	Correct	165 ms	456 KB	Output is correct
69	Correct	212 ms	468 KB	Output is correct
70	Correct	81 ms	468 KB	Output is correct
71	Correct	208 ms	468 KB	Output is correct
72	Correct	214 ms	468 KB	Output is correct
73	Correct	203 ms	468 KB	Output is correct
74	Correct	209 ms	464 KB	Output is correct
75	Correct	210 ms	596 KB	Output is correct
76	Correct	203 ms	468 KB	Output is correct
77	Correct	209 ms	468 KB	Output is correct
78	Correct	212 ms	468 KB	Output is correct
79	Correct	230 ms	468 KB	Output is correct
80	Correct	216 ms	460 KB	Output is correct
81	Execution timed out	2056 ms	852 KB	Time limit exceeded
82	Halted	0 ms	0 KB	-

답안 #801599

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