oj.uz

Submission #799387

# Submission time Handle Problem Language Result Execution time Memory
799387 2023-07-31T13:40:33 Z bachhoangxuan Abduction 2 (JOI17_abduction2) C++17
100 / 100
 615 ms 150688 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 int long long
#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=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;
struct Sparse{
    int n;
    vector<vector<int>> lt,rt;
    Sparse(){}
    Sparse(vector<int> a){
        n=(int)a.size();
        lt.assign(n,vector<int>(maxl,0));
        rt.assign(n,vector<int>(maxl,0));
        for(int i=0;i<n;i++) lt[i][0]=rt[i][0]=a[i];
        for(int j=1;j<maxl;j++){
            for(int i=0;i<=n-(1<<j);i++) rt[i][j]=max(rt[i][j-1],rt[i+(1<<(j-1))][j-1]);
            for(int i=(1<<j)-1;i<n;i++) lt[i][j]=max(lt[i][j-1],lt[i-(1<<(j-1))][j-1]);
        }
    }
    int get_lt(int p,int x){
        for(int i=maxl-1;i>=0;i--){
            if(p<(1<<i)-1) continue;
            if(lt[p][i]<x) p-=(1<<i);
        }
        return p;
    }
    int get_rt(int p,int x){
        for(int i=maxl-1;i>=0;i--){
            if(p>n-(1<<i)) continue;
            if(rt[p][i]<x) p+=(1<<i);
        }
        return p;
    }
}sx,sy;
int n,m,q;
vector<int> a,b;
unordered_map<int,int> mp[2][maxn];
int query(int x,int y,int t){
    if(x<0 || x>=n || y<0 || y>=m) return 0;
    auto it=mp[t][x].find(y);
    if(it!=mp[t][x].end()) return (long long)(it->second);
    int ans=0;
    if(t==0){
        int lt=sx.get_lt(x-1,b[y]),rt=sx.get_rt(x+1,b[y]);
        //cout << x << ' ' << y << ' ' << t << ' ' << lt << ' ' << rt << '\n';
        ans=max(ans,(min(rt,n-1)-x)+query(rt,y,1));
        ans=max(ans,(x-max(lt,0LL))+query(lt,y,1));
    }
    else{
        int lt=sy.get_lt(y-1,a[x]),rt=sy.get_rt(y+1,a[x]);
        //cout << x << ' ' << y << ' ' << t << ' ' << lt << ' ' << rt << '\n';
        ans=max(ans,(min(rt,m-1)-y)+query(x,rt,0));
        ans=max(ans,(y-max(lt,0LL))+query(x,lt,0));
    }
    return (long long)(mp[t][x][y]=ans);
}
void solve(){
    cin >> n >> m >> q;
    a.resize(n);b.resize(m);
    for(int i=0;i<n;i++) cin >> a[i];
    for(int i=0;i<m;i++) cin >> b[i];
    sx=Sparse(a);
    sy=Sparse(b);
    for(int i=0;i<q;i++){
        int x,y;cin >> x >> y;x--;y--;
        cout << max(query(x,y,0),query(x,y,1)) << '\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
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 22228 KB Output is correct
2 Correct 13 ms 22240 KB Output is correct
3 Correct 13 ms 22196 KB Output is correct
4 Correct 13 ms 22172 KB Output is correct
5 Correct 11 ms 22256 KB Output is correct
6 Correct 13 ms 22240 KB Output is correct
7 Correct 14 ms 22148 KB Output is correct
8 Correct 11 ms 22160 KB Output is correct
9 Correct 14 ms 22228 KB Output is correct
10 Correct 11 ms 22136 KB Output is correct
11 Correct 12 ms 22172 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 22228 KB Output is correct
2 Correct 13 ms 22240 KB Output is correct
3 Correct 13 ms 22196 KB Output is correct
4 Correct 13 ms 22172 KB Output is correct
5 Correct 11 ms 22256 KB Output is correct
6 Correct 13 ms 22240 KB Output is correct
7 Correct 14 ms 22148 KB Output is correct
8 Correct 11 ms 22160 KB Output is correct
9 Correct 14 ms 22228 KB Output is correct
10 Correct 11 ms 22136 KB Output is correct
11 Correct 12 ms 22172 KB Output is correct
12 Correct 13 ms 23784 KB Output is correct
13 Correct 13 ms 23832 KB Output is correct
14 Correct 13 ms 23884 KB Output is correct
15 Correct 13 ms 23856 KB Output is correct
16 Correct 14 ms 23800 KB Output is correct
17 Correct 13 ms 23824 KB Output is correct
18 Correct 14 ms 23920 KB Output is correct
19 Correct 15 ms 24048 KB Output is correct
20 Correct 14 ms 24176 KB Output is correct
21 Correct 13 ms 24080 KB Output is correct
22 Correct 14 ms 24344 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 22228 KB Output is correct
2 Correct 13 ms 22240 KB Output is correct
3 Correct 13 ms 22196 KB Output is correct
4 Correct 13 ms 22172 KB Output is correct
5 Correct 11 ms 22256 KB Output is correct
6 Correct 13 ms 22240 KB Output is correct
7 Correct 14 ms 22148 KB Output is correct
8 Correct 11 ms 22160 KB Output is correct
9 Correct 14 ms 22228 KB Output is correct
10 Correct 11 ms 22136 KB Output is correct
11 Correct 12 ms 22172 KB Output is correct
12 Correct 13 ms 23784 KB Output is correct
13 Correct 13 ms 23832 KB Output is correct
14 Correct 13 ms 23884 KB Output is correct
15 Correct 13 ms 23856 KB Output is correct
16 Correct 14 ms 23800 KB Output is correct
17 Correct 13 ms 23824 KB Output is correct
18 Correct 14 ms 23920 KB Output is correct
19 Correct 15 ms 24048 KB Output is correct
20 Correct 14 ms 24176 KB Output is correct
21 Correct 13 ms 24080 KB Output is correct
22 Correct 14 ms 24344 KB Output is correct
23 Correct 70 ms 63532 KB Output is correct
24 Correct 66 ms 63520 KB Output is correct
25 Correct 63 ms 63524 KB Output is correct
26 Correct 59 ms 63456 KB Output is correct
27 Correct 69 ms 63444 KB Output is correct
28 Correct 76 ms 70176 KB Output is correct
29 Correct 64 ms 64044 KB Output is correct
30 Correct 99 ms 70932 KB Output is correct
31 Correct 110 ms 73044 KB Output is correct
32 Correct 63 ms 63076 KB Output is correct
33 Correct 71 ms 65492 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 24048 KB Output is correct
2 Correct 14 ms 23944 KB Output is correct
3 Correct 14 ms 23968 KB Output is correct
4 Correct 15 ms 24020 KB Output is correct
5 Correct 14 ms 24020 KB Output is correct
6 Correct 15 ms 24276 KB Output is correct
7 Correct 15 ms 24312 KB Output is correct
8 Correct 18 ms 24364 KB Output is correct
9 Correct 20 ms 24404 KB Output is correct
10 Correct 20 ms 24404 KB Output is correct
11 Correct 16 ms 24568 KB Output is correct

Subtask #5
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 22228 KB Output is correct
2 Correct 13 ms 22240 KB Output is correct
3 Correct 13 ms 22196 KB Output is correct
4 Correct 13 ms 22172 KB Output is correct
5 Correct 11 ms 22256 KB Output is correct
6 Correct 13 ms 22240 KB Output is correct
7 Correct 14 ms 22148 KB Output is correct
8 Correct 11 ms 22160 KB Output is correct
9 Correct 14 ms 22228 KB Output is correct
10 Correct 11 ms 22136 KB Output is correct
11 Correct 12 ms 22172 KB Output is correct
12 Correct 13 ms 23784 KB Output is correct
13 Correct 13 ms 23832 KB Output is correct
14 Correct 13 ms 23884 KB Output is correct
15 Correct 13 ms 23856 KB Output is correct
16 Correct 14 ms 23800 KB Output is correct
17 Correct 13 ms 23824 KB Output is correct
18 Correct 14 ms 23920 KB Output is correct
19 Correct 15 ms 24048 KB Output is correct
20 Correct 14 ms 24176 KB Output is correct
21 Correct 13 ms 24080 KB Output is correct
22 Correct 14 ms 24344 KB Output is correct
23 Correct 70 ms 63532 KB Output is correct
24 Correct 66 ms 63520 KB Output is correct
25 Correct 63 ms 63524 KB Output is correct
26 Correct 59 ms 63456 KB Output is correct
27 Correct 69 ms 63444 KB Output is correct
28 Correct 76 ms 70176 KB Output is correct
29 Correct 64 ms 64044 KB Output is correct
30 Correct 99 ms 70932 KB Output is correct
31 Correct 110 ms 73044 KB Output is correct
32 Correct 63 ms 63076 KB Output is correct
33 Correct 71 ms 65492 KB Output is correct
34 Correct 19 ms 24048 KB Output is correct
35 Correct 14 ms 23944 KB Output is correct
36 Correct 14 ms 23968 KB Output is correct
37 Correct 15 ms 24020 KB Output is correct
38 Correct 14 ms 24020 KB Output is correct
39 Correct 15 ms 24276 KB Output is correct
40 Correct 15 ms 24312 KB Output is correct
41 Correct 18 ms 24364 KB Output is correct
42 Correct 20 ms 24404 KB Output is correct
43 Correct 20 ms 24404 KB Output is correct
44 Correct 16 ms 24568 KB Output is correct
45 Correct 71 ms 63400 KB Output is correct
46 Correct 76 ms 63412 KB Output is correct
47 Correct 63 ms 63428 KB Output is correct
48 Correct 65 ms 63428 KB Output is correct
49 Correct 67 ms 63428 KB Output is correct
50 Correct 84 ms 70828 KB Output is correct
51 Correct 84 ms 71540 KB Output is correct
52 Correct 125 ms 76648 KB Output is correct
53 Correct 114 ms 75260 KB Output is correct
54 Correct 134 ms 74932 KB Output is correct
55 Correct 136 ms 81860 KB Output is correct
56 Correct 615 ms 150688 KB Output is correct
57 Correct 192 ms 87492 KB Output is correct
58 Correct 194 ms 87260 KB Output is correct
59 Correct 193 ms 87608 KB Output is correct