oj.uz

답안 #447658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447658 2021-07-27T09:06:12 Z Haruto810198 Cultivation (JOI17_cultivation) C++17
15 / 100
 2000 ms 520 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 dxr){

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

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

    vector<vi> seg; /// Lpos, Rpos, minSum, [L, R]

    FOR(i, 1, n, 1){
        ev.pb({pt[i].F, 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 Ldis = LNF, Rdis = 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({Ldis, Rdis, *prev(sums.end()), pv_time, Time - 1});
            }
            else{
                seg.pb({Ldis, Rdis, 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()){
            Ldis = LNF;
            Rdis = LNF;
        }
        else{
            Ldis = *st.begin() - 1;
            Rdis = C - *prev(st.end());
        }

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

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

    }

    seg.pb({LNF, LNF, LNF, pv_time, LNF});

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

    for(auto I : seg){

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

    }
    */

    int ret = LNF;

    int lptr = 0, rptr = 0;
    multiset<int> Ls, Rs, Sums;

    Ls.insert(seg[0][0]);
    Rs.insert(seg[0][1]);
    Sums.insert(seg[0][2]);

    while(1){

        /// move rptr
        while( seg[rptr][4] - seg[lptr][3] < R - 1 ){
            rptr++;
            Ls.insert(seg[rptr][0]);
            Rs.insert(seg[rptr][1]);
            Sums.insert(seg[rptr][2]);

            //cerr<<"["<<seg[lptr][3]<<", "<<seg[rptr][4]<<"] "<<endl;
        }

        /// update ret
        //cerr<<"["<<lptr<<", "<<rptr<<"], ans = "<<max(*prev(Ls.end()) + *prev(Rs.end()), *prev(Sums.end()) )<<endl;
        ret = min(ret, max(*prev(Ls.end()) + *prev(Rs.end()), *prev(Sums.end()) ) );

        /// move lptr
        Ls.erase( Ls.find(seg[lptr][0]) );
        Rs.erase( Rs.find(seg[lptr][1]) );
        Sums.erase( Sums.find(seg[lptr][2]) );
        lptr++;

        if(seg[lptr][3] > 1 + dxr){
            break;
        }

    }

    return dxr + ret;

}

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(dxr, 0, R, 1){
        res = min(res, check(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 1 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 1 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 1 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 0 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 1 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 1 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 1 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 0 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 1 ms 204 KB Output is correct
18 Correct 4 ms 328 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 6 ms 332 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 10 ms 364 KB Output is correct
25 Correct 8 ms 332 KB Output is correct
26 Correct 15 ms 388 KB Output is correct
27 Correct 17 ms 520 KB Output is correct
28 Correct 10 ms 360 KB Output is correct
29 Correct 14 ms 332 KB Output is correct
30 Correct 16 ms 332 KB Output is correct
31 Correct 15 ms 392 KB Output is correct
32 Correct 16 ms 332 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 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 1 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 1 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 0 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 1 ms 204 KB Output is correct
18 Correct 4 ms 328 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 6 ms 332 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 10 ms 364 KB Output is correct
25 Correct 8 ms 332 KB Output is correct
26 Correct 15 ms 388 KB Output is correct
27 Correct 17 ms 520 KB Output is correct
28 Correct 10 ms 360 KB Output is correct
29 Correct 14 ms 332 KB Output is correct
30 Correct 16 ms 332 KB Output is correct
31 Correct 15 ms 392 KB Output is correct
32 Correct 16 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Incorrect 11 ms 388 KB Output isn't correct
35 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2075 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 1 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 1 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 1 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 0 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 1 ms 204 KB Output is correct
18 Correct 4 ms 328 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 3 ms 332 KB Output is correct
22 Correct 6 ms 332 KB Output is correct
23 Correct 2 ms 204 KB Output is correct
24 Correct 10 ms 364 KB Output is correct
25 Correct 8 ms 332 KB Output is correct
26 Correct 15 ms 388 KB Output is correct
27 Correct 17 ms 520 KB Output is correct
28 Correct 10 ms 360 KB Output is correct
29 Correct 14 ms 332 KB Output is correct
30 Correct 16 ms 332 KB Output is correct
31 Correct 15 ms 392 KB Output is correct
32 Correct 16 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Incorrect 11 ms 388 KB Output isn't correct
35 Halted 0 ms 0 KB -