oj.uz

Submission #923882

# Submission time Handle Problem Language Result Execution time Memory
923882 2024-02-08T04:18:08 Z bachhoangxuan Cultivation (JOI17_cultivation) C++17
80 / 100
 2000 ms 2976 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e9;
const int maxn=305;

int R,C,n;
long long ans=1e18;
pii p[maxn];
struct Data{
    int a=0,b=0,c=0;
}f[maxn][maxn];

int cur[maxn];
void init(){
    for(int l=1;l<=n;l++){
        int sz=0;
        for(int r=l;r<=n;r++){
            int d=p[r].se;
            for(int i=1;i<=sz;i++) if(d<cur[i]) swap(d,cur[i]);
            cur[++sz]=d;
            f[l][r].a=cur[1]-1;
            f[l][r].b=C-cur[sz];
            for(int i=1;i<sz;i++) f[l][r].c=max(f[l][r].c,cur[i+1]-cur[i]-1);
            //cout << l << ' ' << r << ' ' << f[l][r].a << ' ' << f[l][r].b << ' ' << f[l][r].c << '\n';
        }
    }
}

int num[2*maxn];
Data dd[2*maxn];
void cal(int len){
    int sz=0;
    for(int i=1,pos=1;i<=n;i++){
        while(pos<=n && p[pos].fi<p[i].fi+len+1){
            int val=p[pos++].fi;
            if(val>num[sz]) num[++sz]=val;
        }
        int val=p[i].fi+len+1;
        if(val>num[sz]) num[++sz]=val;
    }
    for(int i=1,l=1,r=1;i<=sz;i++){
        while(l<=n && !(p[l].fi<=num[i] && num[i]<=p[l].fi+len)) l++;
        r=max(r,l);
        while(r<=n && p[r].fi<=num[i] && num[i]<=p[r].fi+len) r++;
        if(l>n) dd[i]={inf,inf,inf};
        else dd[i]=f[l][r-1];
        //cout << num[i] << ' ' << dd[i].a << ' ' << dd[i].b << ' ' << dd[i].c << '\n';
    }
    deque<pii> a,b,c;
    auto add = [&](deque<pii> &dq,pii x){
        while(!dq.empty() && dq.back().fi<=x.fi) dq.pop_back();
        dq.push_back(x);
    };
    auto del = [&](deque<pii> &dq,int x){
        if(!dq.empty() && dq.front().se<=x) dq.pop_front();
    };
    auto get = [&](deque<pii> &dq){
        if(!dq.empty()) return dq[0].fi;
        else return inf;
    };
    //cout << '*' << len <<  '\n';
    for(int l=1,r=1;l<=sz;l++){
        r=max(r,l);
        while(r<=sz && num[r]<num[l]+R){
            add(a,{dd[r].a,r});
            add(b,{dd[r].b,r});
            add(c,{dd[r].c,r});
            r++;
        }
        ans=min(ans,0LL+len+max(get(a)+get(b),get(c)));
        del(a,l);del(b,l);del(c,l);
    }
}

void solve(){
    cin >> R >> C >> n;
    for(int i=1;i<=n;i++) cin >> p[i].fi >> p[i].se;
    sort(p+1,p+n+1);
    init();
    vector<int> d;
    for(int i=1;i<=n;i++){
        d.push_back(p[i].fi-1);
        d.push_back(R-p[i].fi);
        for(int j=1;j<=n;j++){
            d.push_back(max(0,p[i].fi-p[j].fi-1));
            d.push_back(p[i].fi-1+R-p[j].fi);
        }
    }
    sort(d.begin(),d.end());
    d.erase(unique(d.begin(),d.end()),d.end());
    for(auto len:d) cal(len);
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 1116 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 6 ms 1912 KB Output is correct
25 Correct 3 ms 1372 KB Output is correct
26 Correct 15 ms 2524 KB Output is correct
27 Correct 15 ms 2524 KB Output is correct
28 Correct 6 ms 1760 KB Output is correct
29 Correct 17 ms 2556 KB Output is correct
30 Correct 15 ms 2776 KB Output is correct
31 Correct 16 ms 2520 KB Output is correct
32 Correct 18 ms 2512 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 1116 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 6 ms 1912 KB Output is correct
25 Correct 3 ms 1372 KB Output is correct
26 Correct 15 ms 2524 KB Output is correct
27 Correct 15 ms 2524 KB Output is correct
28 Correct 6 ms 1760 KB Output is correct
29 Correct 17 ms 2556 KB Output is correct
30 Correct 15 ms 2776 KB Output is correct
31 Correct 16 ms 2520 KB Output is correct
32 Correct 18 ms 2512 KB Output is correct
33 Correct 15 ms 2524 KB Output is correct
34 Correct 12 ms 2524 KB Output is correct
35 Correct 14 ms 2976 KB Output is correct
36 Correct 13 ms 2524 KB Output is correct
37 Correct 14 ms 2524 KB Output is correct
38 Correct 13 ms 2524 KB Output is correct
39 Correct 14 ms 2524 KB Output is correct
40 Correct 13 ms 2524 KB Output is correct
41 Correct 13 ms 2520 KB Output is correct
42 Correct 13 ms 2524 KB Output is correct
43 Correct 15 ms 2532 KB Output is correct
44 Correct 15 ms 2520 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 4 ms 576 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 2 ms 348 KB Output is correct
20 Correct 4 ms 576 KB Output is correct
21 Correct 57 ms 1108 KB Output is correct
22 Correct 96 ms 1020 KB Output is correct
23 Correct 94 ms 1020 KB Output is correct
24 Correct 92 ms 860 KB Output is correct
25 Correct 103 ms 1020 KB Output is correct
26 Correct 32 ms 868 KB Output is correct
27 Correct 92 ms 860 KB Output is correct
28 Correct 93 ms 1024 KB Output is correct
29 Correct 89 ms 1020 KB Output is correct
30 Correct 94 ms 1020 KB Output is correct
31 Correct 100 ms 1044 KB Output is correct
32 Correct 91 ms 1016 KB Output is correct
33 Correct 99 ms 860 KB Output is correct
34 Correct 95 ms 860 KB Output is correct
35 Correct 95 ms 860 KB Output is correct
36 Correct 93 ms 1024 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 600 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 2 ms 1116 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 6 ms 1912 KB Output is correct
25 Correct 3 ms 1372 KB Output is correct
26 Correct 15 ms 2524 KB Output is correct
27 Correct 15 ms 2524 KB Output is correct
28 Correct 6 ms 1760 KB Output is correct
29 Correct 17 ms 2556 KB Output is correct
30 Correct 15 ms 2776 KB Output is correct
31 Correct 16 ms 2520 KB Output is correct
32 Correct 18 ms 2512 KB Output is correct
33 Correct 15 ms 2524 KB Output is correct
34 Correct 12 ms 2524 KB Output is correct
35 Correct 14 ms 2976 KB Output is correct
36 Correct 13 ms 2524 KB Output is correct
37 Correct 14 ms 2524 KB Output is correct
38 Correct 13 ms 2524 KB Output is correct
39 Correct 14 ms 2524 KB Output is correct
40 Correct 13 ms 2524 KB Output is correct
41 Correct 13 ms 2520 KB Output is correct
42 Correct 13 ms 2524 KB Output is correct
43 Correct 15 ms 2532 KB Output is correct
44 Correct 15 ms 2520 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 2 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 2 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 2 ms 600 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 2 ms 348 KB Output is correct
55 Correct 2 ms 348 KB Output is correct
56 Correct 2 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 344 KB Output is correct
60 Correct 2 ms 348 KB Output is correct
61 Correct 2 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 2 ms 348 KB Output is correct
64 Correct 4 ms 576 KB Output is correct
65 Correct 57 ms 1108 KB Output is correct
66 Correct 96 ms 1020 KB Output is correct
67 Correct 94 ms 1020 KB Output is correct
68 Correct 92 ms 860 KB Output is correct
69 Correct 103 ms 1020 KB Output is correct
70 Correct 32 ms 868 KB Output is correct
71 Correct 92 ms 860 KB Output is correct
72 Correct 93 ms 1024 KB Output is correct
73 Correct 89 ms 1020 KB Output is correct
74 Correct 94 ms 1020 KB Output is correct
75 Correct 100 ms 1044 KB Output is correct
76 Correct 91 ms 1016 KB Output is correct
77 Correct 99 ms 860 KB Output is correct
78 Correct 95 ms 860 KB Output is correct
79 Correct 95 ms 860 KB Output is correct
80 Correct 93 ms 1024 KB Output is correct
81 Correct 971 ms 2040 KB Output is correct
82 Correct 983 ms 1756 KB Output is correct
83 Correct 1154 ms 2016 KB Output is correct
84 Correct 1491 ms 2016 KB Output is correct
85 Execution timed out 2028 ms 2608 KB Time limit exceeded
86 Halted 0 ms 0 KB -