Submission #748364

#TimeUsernameProblemLanguageResultExecution timeMemory
748364GrindMachineAbduction 2 (JOI17_abduction2)C++17
23 / 100
5033 ms256176 KiB
// Om Namah Shivaya #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; typedef long long int ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL) #define pb push_back #define endl '\n' #define sz(a) a.size() #define setbits(x) __builtin_popcountll(x) #define ff first #define ss second #define conts continue #define ceil2(x, y) ((x + y - 1) / (y)) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define yes cout << "Yes" << endl #define no cout << "No" << endl #define rep(i, n) for(int i = 0; i < n; ++i) #define rep1(i, n) for(int i = 1; i <= n; ++i) #define rev(i, s, e) for(int i = s; i >= e; --i) #define trav(i, a) for(auto &i : a) template<typename T> void amin(T &a, T b) { a = min(a, b); } template<typename T> void amax(T &a, T b) { a = max(a, b); } #ifdef LOCAL #include "debug.h" #else #define debug(x) 42 #endif /* refs: edi */ const int MOD = 1e9 + 7; const int N = 2e3 + 5; const int inf1 = int(1e9) + 5; const ll inf2 = ll(1e18) + 5; ll n,m,q; vector<ll> a(N), b(N); ll dp[N][N][4]; ll go(ll i, ll j, ll d){ if(i < 1 or i > n or j < 1 or j > m) return -inf1; if(dp[i][j][d] != -1) return dp[i][j][d]; ll ans = 0; if(d <= 1){ if(b[j] > a[i]){ amax(ans, 1 + go(i-1,j,2)); amax(ans, 1 + go(i+1,j,3)); } else{ if(d == 0){ amax(ans, 1 + go(i,j-1,d)); } else{ amax(ans, 1 + go(i,j+1,d)); } } } else{ if(a[i] > b[j]){ amax(ans, 1 + go(i,j-1,0)); amax(ans, 1 + go(i,j+1,1)); } else{ if(d == 2){ amax(ans, 1 + go(i-1,j,d)); } else{ amax(ans, 1 + go(i+1,j,d)); } } } return dp[i][j][d] = ans; } void solve(int test_case) { cin >> n >> m >> q; rep1(i,n) cin >> a[i]; rep1(i,m) cin >> b[i]; while(q--){ ll i,j; cin >> i >> j; memset(dp,-1,sizeof dp); ll ans = 1 + max({go(i,j-1,0), go(i,j+1,1), go(i-1,j,2), go(i+1,j,3)}); cout << ans << endl; } } int main() { fastio; int t = 1; // cin >> t; rep1(i, t) { solve(i); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...