oj.uz

답안 #1071168

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1071168 2024-08-23T05:34:36 Z ttamx Cultivation (JOI17_cultivation) C++17
30 / 100
 2000 ms 1496 KB 
#include<bits/stdc++.h>

using namespace std;

const int N=305;
const int INF=2e9;

int n;
int r,c;
int x[N],y[N];
vector<int> pos;

int calc(int xl,int xr){
    vector<int> xs;
    for(int i=0;i<n;i++){
        xs.emplace_back(max(1,x[i]-xl));
        xs.emplace_back(min(r,x[i]+xr)+1);
    }
    xs.emplace_back(1);
    xs.emplace_back(r+1);
    sort(xs.begin(),xs.end());
    xs.erase(unique(xs.begin(),xs.end()),xs.end());
    int xn=xs.size();
    vector<vector<pair<int,int>>> event(xn);
    for(int i=0;i<n;i++){
        int xi=lower_bound(xs.begin(),xs.end(),max(1,x[i]-xl))-xs.begin();
        int xj=lower_bound(xs.begin(),xs.end(),min(r,x[i]+xr)+1)-xs.begin();
        event[xi].emplace_back(y[i],1);
        event[xj].emplace_back(y[i],0);
    }
    event.pop_back();
    int mxa=0,mxb=0,sum=0;
    multiset<int> pts,dif;
    for(auto &e:event){
        for(auto [x,t]:e){
            if(t){
                auto it=pts.emplace(x);
                if(next(it)!=pts.end()&&it!=pts.begin()){
                    dif.erase(dif.find(*next(it)-*prev(it)));
                }
                if(next(it)!=pts.end()){
                    dif.emplace(*next(it)-*it);
                }
                if(it!=pts.begin()){
                    dif.emplace(*it-*prev(it));
                }
            }else{
                auto it=pts.find(x);
                assert(it!=pts.end());
                if(next(it)!=pts.end()){
                    dif.erase(dif.find(*next(it)-*it));
                }
                if(it!=pts.begin()){
                    dif.erase(dif.find(*it-*prev(it)));
                }
                if(next(it)!=pts.end()&&it!=pts.begin()){
                    dif.emplace(*next(it)-*prev(it));
                }
                pts.erase(it);
            }
        }
        if(pts.empty())return INF;
        mxa=max(mxa,*pts.begin()-1);
        mxb=max(mxb,c-*pts.rbegin());
        if(!dif.empty()){
            sum=max(sum,*dif.rbegin()-1);
        }
    }
    return min((long long)INF,(long long)xl+xr+max(sum,mxa+mxb));
}

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    cin >> r >> c >> n;
    for(int i=0;i<n;i++){
        cin >> x[i] >> y[i];
        pos.emplace_back(x[i]);
    }
    vector<int> xs;
    int mxa=0,mxb=0,sum=0;
    sort(pos.begin(),pos.end());
    mxa=pos[0]-1;
    mxb=r-pos[n-1];
    for(int i=1;i<n;i++){
        sum=max(sum,pos[i]-pos[i-1]-1);
    }
    for(int i=0;i<n;i++){
        xs.emplace_back(x[i]-1);
        xs.emplace_back(r-x[i]);
        for(int j=0;j<n;j++){
            int d=abs(x[i]-x[j]);
            xs.emplace_back(d);
            if(d>0){
                xs.emplace_back(d-1);
            }
        }
    }
    sort(xs.begin(),xs.end());
    xs.erase(unique(xs.begin(),xs.end()),xs.end());
    int ans=r+c-2;
    for(int xl:xs){
        if(xl<mxa)continue;
        for(int xr:xs){
            if(xr<mxb)continue;
            if(xl+xr<sum)continue;
            if(xl+xr<ans){
                ans=min(ans,calc(xl,xr));
            }
        }
    }
    cout << ans;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 16 ms 512 KB Output is correct
22 Correct 14 ms 604 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 16 ms 992 KB Output is correct
25 Correct 16 ms 732 KB Output is correct
26 Correct 44 ms 1496 KB Output is correct
27 Correct 25 ms 1492 KB Output is correct
28 Correct 20 ms 992 KB Output is correct
29 Correct 15 ms 1496 KB Output is correct
30 Correct 18 ms 1496 KB Output is correct
31 Correct 14 ms 1496 KB Output is correct
32 Correct 27 ms 1496 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 16 ms 512 KB Output is correct
22 Correct 14 ms 604 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 16 ms 992 KB Output is correct
25 Correct 16 ms 732 KB Output is correct
26 Correct 44 ms 1496 KB Output is correct
27 Correct 25 ms 1492 KB Output is correct
28 Correct 20 ms 992 KB Output is correct
29 Correct 15 ms 1496 KB Output is correct
30 Correct 18 ms 1496 KB Output is correct
31 Correct 14 ms 1496 KB Output is correct
32 Correct 27 ms 1496 KB Output is correct
33 Correct 6 ms 1492 KB Output is correct
34 Correct 204 ms 1496 KB Output is correct
35 Correct 224 ms 1496 KB Output is correct
36 Correct 212 ms 1492 KB Output is correct
37 Correct 169 ms 1496 KB Output is correct
38 Correct 227 ms 1496 KB Output is correct
39 Correct 219 ms 1496 KB Output is correct
40 Correct 220 ms 1492 KB Output is correct
41 Correct 171 ms 1492 KB Output is correct
42 Correct 197 ms 1496 KB Output is correct
43 Correct 215 ms 1496 KB Output is correct
44 Correct 216 ms 1492 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 348 KB Output is correct
2 Correct 1319 ms 592 KB Output is correct
3 Correct 628 ms 456 KB Output is correct
4 Correct 1907 ms 348 KB Output is correct
5 Execution timed out 2047 ms 348 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 348 KB Output is correct
2 Correct 1319 ms 592 KB Output is correct
3 Correct 628 ms 456 KB Output is correct
4 Correct 1907 ms 348 KB Output is correct
5 Execution timed out 2047 ms 348 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 6 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 16 ms 512 KB Output is correct
22 Correct 14 ms 604 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 16 ms 992 KB Output is correct
25 Correct 16 ms 732 KB Output is correct
26 Correct 44 ms 1496 KB Output is correct
27 Correct 25 ms 1492 KB Output is correct
28 Correct 20 ms 992 KB Output is correct
29 Correct 15 ms 1496 KB Output is correct
30 Correct 18 ms 1496 KB Output is correct
31 Correct 14 ms 1496 KB Output is correct
32 Correct 27 ms 1496 KB Output is correct
33 Correct 6 ms 1492 KB Output is correct
34 Correct 204 ms 1496 KB Output is correct
35 Correct 224 ms 1496 KB Output is correct
36 Correct 212 ms 1492 KB Output is correct
37 Correct 169 ms 1496 KB Output is correct
38 Correct 227 ms 1496 KB Output is correct
39 Correct 219 ms 1496 KB Output is correct
40 Correct 220 ms 1492 KB Output is correct
41 Correct 171 ms 1492 KB Output is correct
42 Correct 197 ms 1496 KB Output is correct
43 Correct 215 ms 1496 KB Output is correct
44 Correct 216 ms 1492 KB Output is correct
45 Correct 137 ms 348 KB Output is correct
46 Correct 1319 ms 592 KB Output is correct
47 Correct 628 ms 456 KB Output is correct
48 Correct 1907 ms 348 KB Output is correct
49 Execution timed out 2047 ms 348 KB Time limit exceeded
50 Halted 0 ms 0 KB -