oj.uz

답안 #447648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447648 2021-07-27T08:21:35 Z Haruto810198 Cultivation (JOI17_cultivation) C++17
30 / 100
 2000 ms 584 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define double long double

#define FOR(i,l,r,d) for(int i=(l);i<=(r);i+=(d))
#define szof(x) ((int)(x).size())

#define vi vector<int>
#define pii pair<int,int>

#define F first
#define S second

#define pb push_back
#define eb emplace_back
#define mkp make_pair

const int INF = 2147483647;
const int LNF = 1e18;
const int MOD = 1000000007;
const int mod = 998244353;
const double eps = 1e-12;

//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")

const int MAX = 310;

int n;
int R, C;
pii pt[MAX];

int res;

int check(int dxl, int dxr){

    //cerr<<"check("<<dxl<<", "<<dxr<<") : "<<endl;

    multiset<int> st;
    vector<vi> ev;
    /// insert : time,  1, pos
    /// erase  : time, -1, pos

    vector<vi> seg; /// minL, minR, minSum, L, R

    FOR(i, 1, n, 1){
        ev.pb({pt[i].F - dxl, 1, pt[i].S});
        ev.pb({pt[i].F + dxr + 1, -1, pt[i].S});
    }

    sort(ev.begin(), ev.end());

    int pv_time = -LNF;
    int minL = LNF, minR = LNF;
    multiset<int> sums;

    for(auto E : ev){

        int Time = E[0];
        int type = E[1];
        int pos = E[2];

        if(pv_time < Time){
            if(!sums.empty()){
                seg.pb({minL, minR, *prev(sums.end()), pv_time, Time - 1});
            }
            else{
                seg.pb({minL, minR, 0, pv_time, Time - 1});
            }
        }

        pv_time = Time;

        if(type == 1){

            st.insert(pos);

            auto it = st.find(pos);
            auto pit = prev(it);
            auto nit = next(it);

            if(it != st.begin() and it != prev(st.end()) ){
                sums.erase( sums.find(*nit - *pit - 1) );
                sums.insert(*nit - *it - 1);
                sums.insert(*it - *pit - 1);
            }
            else if(it == st.begin() and it != prev(st.end()) ){
                sums.insert(*nit - *it - 1);
            }
            else if(it != st.begin() and it == prev(st.end()) ){
                sums.insert(*it - *pit - 1);
            }

        }
        else{

            auto it = st.find(pos);
            auto pit = prev(it);
            auto nit = next(it);

            if(it != st.begin() and it != prev(st.end()) ){
                sums.insert(*nit - *pit - 1);
                sums.erase( sums.find(*nit - *it - 1) );
                sums.erase( sums.find(*it - *pit - 1) );
            }
            else if(it == st.begin() and it != prev(st.end()) ){
                sums.erase( sums.find(*nit - *it - 1) );
            }
            else if(it != st.begin() and it == prev(st.end()) ){
                sums.erase( sums.find(*it - *pit - 1) );
            }

            st.erase(it);

        }

        if(st.empty()){
            minL = LNF;
            minR = LNF;
        }
        else{
            minL = *st.begin() - 1;
            minR = C - *prev(st.end());
        }

        /*
        cerr<<"st : ";
        for(int i : st){
            cerr<<i<<" ";
        }
        cerr<<endl;

        cerr<<"sums : ";
        for(int i : sums){
            cerr<<i<<" ";
        }
        cerr<<endl;
        */

    }

    int retL = 0, retR = 0, retSum = 0;

    //cerr<<"seg : "<<endl;

    bool AC = 0;

    for(auto I : seg){

        if(I[3] > R or I[4] < 1){
            continue;
        }

        /*
        cerr<<"{";
        for(auto i : I){
            cerr<<i<<", ";
        }
        cerr<<"}"<<endl;
        */

        retL = max(retL, I[0]);
        retR = max(retR, I[1]);
        retSum = max(retSum, I[2]);

        if(I[4] >= R){
            AC = 1;
        }

    }

    retSum = max(retSum, retL + retR);

    if(AC == 0){
        retSum = LNF;
    }

    //cerr<<dxl + dxr + retSum<<endl;

    return dxl + dxr + retSum;

}

signed main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin>>R>>C;
    cin>>n;
    FOR(i, 1, n, 1){
        cin>>pt[i].F>>pt[i].S;
    }

    res = LNF;

    FOR(dxl, 0, R, 1){
        FOR(dxr, 0, R, 1){
            res = min(res, check(dxl, dxr));
        }
    }

    cout<<res<<'\n';

    return 0;

}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 4 ms 204 KB Output is correct
18 Correct 44 ms 332 KB Output is correct
19 Correct 32 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 80 ms 312 KB Output is correct
22 Correct 222 ms 332 KB Output is correct
23 Correct 52 ms 304 KB Output is correct
24 Correct 382 ms 352 KB Output is correct
25 Correct 273 ms 336 KB Output is correct
26 Correct 580 ms 404 KB Output is correct
27 Correct 568 ms 332 KB Output is correct
28 Correct 350 ms 488 KB Output is correct
29 Correct 519 ms 524 KB Output is correct
30 Correct 588 ms 436 KB Output is correct
31 Correct 578 ms 396 KB Output is correct
32 Correct 574 ms 396 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 4 ms 204 KB Output is correct
18 Correct 44 ms 332 KB Output is correct
19 Correct 32 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 80 ms 312 KB Output is correct
22 Correct 222 ms 332 KB Output is correct
23 Correct 52 ms 304 KB Output is correct
24 Correct 382 ms 352 KB Output is correct
25 Correct 273 ms 336 KB Output is correct
26 Correct 580 ms 404 KB Output is correct
27 Correct 568 ms 332 KB Output is correct
28 Correct 350 ms 488 KB Output is correct
29 Correct 519 ms 524 KB Output is correct
30 Correct 588 ms 436 KB Output is correct
31 Correct 578 ms 396 KB Output is correct
32 Correct 574 ms 396 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 433 ms 520 KB Output is correct
35 Correct 626 ms 332 KB Output is correct
36 Correct 621 ms 388 KB Output is correct
37 Correct 482 ms 584 KB Output is correct
38 Correct 616 ms 516 KB Output is correct
39 Correct 622 ms 516 KB Output is correct
40 Correct 630 ms 456 KB Output is correct
41 Correct 508 ms 396 KB Output is correct
42 Correct 559 ms 392 KB Output is correct
43 Correct 594 ms 452 KB Output is correct
44 Correct 617 ms 452 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2061 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 4 ms 204 KB Output is correct
18 Correct 44 ms 332 KB Output is correct
19 Correct 32 ms 204 KB Output is correct
20 Correct 2 ms 204 KB Output is correct
21 Correct 80 ms 312 KB Output is correct
22 Correct 222 ms 332 KB Output is correct
23 Correct 52 ms 304 KB Output is correct
24 Correct 382 ms 352 KB Output is correct
25 Correct 273 ms 336 KB Output is correct
26 Correct 580 ms 404 KB Output is correct
27 Correct 568 ms 332 KB Output is correct
28 Correct 350 ms 488 KB Output is correct
29 Correct 519 ms 524 KB Output is correct
30 Correct 588 ms 436 KB Output is correct
31 Correct 578 ms 396 KB Output is correct
32 Correct 574 ms 396 KB Output is correct
33 Correct 3 ms 332 KB Output is correct
34 Correct 433 ms 520 KB Output is correct
35 Correct 626 ms 332 KB Output is correct
36 Correct 621 ms 388 KB Output is correct
37 Correct 482 ms 584 KB Output is correct
38 Correct 616 ms 516 KB Output is correct
39 Correct 622 ms 516 KB Output is correct
40 Correct 630 ms 456 KB Output is correct
41 Correct 508 ms 396 KB Output is correct
42 Correct 559 ms 392 KB Output is correct
43 Correct 594 ms 452 KB Output is correct
44 Correct 617 ms 452 KB Output is correct
45 Execution timed out 2061 ms 204 KB Time limit exceeded
46 Halted 0 ms 0 KB -