結果

問題 No.2248 max(C)-min(C)
ユーザー omgflakaomgflaka
提出日時 2023-03-17 22:56:40
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,278 bytes
コンパイル時間 2,230 ms
コンパイル使用メモリ 206,096 KB
実行使用メモリ 12,672 KB
最終ジャッジ日時 2023-10-18 15:56:01
合計ジャッジ時間 5,910 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,348 KB
testcase_01 AC 2 ms
4,348 KB
testcase_02 AC 2 ms
4,348 KB
testcase_03 AC 3 ms
4,348 KB
testcase_04 AC 2 ms
4,348 KB
testcase_05 AC 2 ms
4,348 KB
testcase_06 AC 2 ms
4,348 KB
testcase_07 AC 2 ms
4,348 KB
testcase_08 AC 2 ms
4,348 KB
testcase_09 AC 2 ms
4,348 KB
testcase_10 AC 2 ms
4,348 KB
testcase_11 AC 2 ms
4,348 KB
testcase_12 AC 2 ms
4,348 KB
testcase_13 AC 2 ms
4,348 KB
testcase_14 AC 2 ms
4,348 KB
testcase_15 AC 3 ms
4,348 KB
testcase_16 AC 2 ms
4,348 KB
testcase_17 AC 2 ms
4,348 KB
testcase_18 AC 46 ms
11,352 KB
testcase_19 AC 8 ms
4,348 KB
testcase_20 AC 53 ms
12,672 KB
testcase_21 AC 50 ms
12,144 KB
testcase_22 AC 36 ms
9,572 KB
testcase_23 AC 24 ms
7,196 KB
testcase_24 AC 11 ms
4,820 KB
testcase_25 AC 47 ms
11,880 KB
testcase_26 AC 43 ms
10,892 KB
testcase_27 AC 47 ms
11,616 KB
testcase_28 AC 6 ms
4,348 KB
testcase_29 AC 45 ms
11,156 KB
testcase_30 AC 20 ms
6,404 KB
testcase_31 AC 52 ms
12,672 KB
testcase_32 AC 11 ms
5,084 KB
testcase_33 AC 18 ms
6,140 KB
testcase_34 AC 52 ms
12,672 KB
testcase_35 AC 52 ms
12,672 KB
testcase_36 AC 52 ms
12,672 KB
testcase_37 AC 29 ms
8,252 KB
testcase_38 AC 49 ms
12,672 KB
testcase_39 AC 50 ms
12,672 KB
testcase_40 AC 50 ms
12,672 KB
testcase_41 WA -
testcase_42 AC 50 ms
12,672 KB
testcase_43 AC 44 ms
11,616 KB
testcase_44 AC 50 ms
12,672 KB
testcase_45 AC 39 ms
10,628 KB
testcase_46 AC 22 ms
7,196 KB
testcase_47 AC 50 ms
12,672 KB
testcase_48 AC 45 ms
12,672 KB
testcase_49 AC 53 ms
12,672 KB
testcase_50 AC 53 ms
12,672 KB
testcase_51 AC 53 ms
12,672 KB
testcase_52 AC 53 ms
12,672 KB
testcase_53 AC 10 ms
4,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int> 
#define vb vector<bool> 
#define pub push_back
#define emb emplace_back
#define rep(i,a,b) for(long long i = a; i < b; i++)
#define rrep(i,a,b) for(long long i = a; i >= b; i--)
#define iterm(key,val,ok) for(auto const& [key, val]:ok)
#define all(x) x.begin(),x.end()
#define py cout<<"YES"<<endl
#define pn cout<<"NO"<<endl
#define pa cout<<ans<<endl
#define pe cout<<endl
#define mp make_pair
#define f first 
#define se second 
using pii=pair<ll,ll>;
template<typename T>             istream& operator>>(istream& is, vector<T>& v) { for (auto& i : v) is >> i;        return is; }
template<typename T>             ostream& operator<<(ostream& os, const vector<T>& v) { for (auto& i : v) os << i << " "; return os; }
template<typename T>             istream& operator>>(istream& is, pair<T, T>& v) { is >> v.first >> v.second;        return is; }
template<typename T>             ostream& operator<<(ostream& os, const pair<T, T>& v) { os << v.first << " " << v.second; return os; }
 
 
 
/*
problems with mod or small constraints are DP (2d,3d) or combo
ascii: 1=49 a=97 A=65
check edge cases and constraints CHECK FOR JUST ONE ELEMENT OR SAME NUMBERS ETC
always think about reversing a process
see if theres any dumb tricks if youre not getting it: like only having to check small values or sth
(a-b)modm = (a%m+(m-b%m))%m
mark visited after adding to queue
think about transforming representations of graphs, if some graph is too big to be represented, think about bipartite
representation, if its too small maybe you can expand according to problem to make it easier
you can also bfs on pairs of nodes, different representations of nodes etc etc
lower bound can give beyond end also (check segfaults etc if using)
many smol vectors are slowwww, use std:array instead
to search for and remove particular things fastly just use multiset, like u can use prefix multiset and find closest
value of something also like so many applications in just logn time
*/

void solve(){
    ll n;cin>>n;
    vector<ll> a(n);
    vector<ll> b(n);
    vector<ll> x(n);
    ll d1,d2,d3;
    cin>>a>>b;
    ll dp[n][3];
    ll ans=0;
    rep(j,0,3){
        if(j==0){
            dp[0][0]=dp[0][1]=dp[0][2]=a[0];    
        }
        else if(j==1){
            dp[0][0]=dp[0][1]=dp[0][2]=b[0];  
        }
        else{
            dp[0][0]=dp[0][1]=dp[0][2]=(a[0]+b[0])/2;  
        }
        rep(i,1,n){
            vector<int> arr1;
            x[i]=(a[i]+b[i])/2;
            if(a[i]>=dp[i-1][1] && a[i]<=dp[i-1][2]){
                dp[i][0]=a[i];
                dp[i][1]=dp[i-1][1];
                dp[i][2]=dp[i-1][2];
                continue;
            }
            else if(b[i]>=dp[i-1][1] && b[i]<=dp[i-1][2]){
                dp[i][0]=b[i];
                dp[i][1]=dp[i-1][1];
                dp[i][2]=dp[i-1][2];
                continue;
            }
            else if(x[i]>=dp[i-1][1] && x[i]<=dp[i-1][2]){
                dp[i][0]=x[i];
                dp[i][1]=dp[i-1][1];
                dp[i][2]=dp[i-1][2];
                continue;
            }
            else{
                d1=min(abs(a[i]-dp[i-1][1]),abs(a[i]-dp[i-1][2]));
                d2=min(abs(b[i]-dp[i-1][1]),abs(b[i]-dp[i-1][2]));
                d3=min(abs(x[i]-dp[i-1][1]),abs(x[i]-dp[i-1][2]));
                if(d1<=d2 && d1<=d3){
                    dp[i][0]=a[i];
                    dp[i][1]=min(dp[i-1][1],a[i]);
                    dp[i][2]=max(dp[i-1][2],a[i]);
                }
                else if(d2<=d1 && d2<=d3){
                    dp[i][0]=b[i];
                    dp[i][1]=min(dp[i-1][1],b[i]);
                    dp[i][2]=max(dp[i-1][2],b[i]);
                }
                else{
                    dp[i][0]=x[i];
                    dp[i][1]=min(dp[i-1][1],x[i]);
                    dp[i][2]=max(dp[i-1][2],x[i]);
                }
            }
        }
        if(j==0){
            ans=dp[n-1][2]-dp[n-1][1];
        }
        else{
            ans=min(ans,dp[n-1][2]-dp[n-1][1]);
        }
    }
    pa;
}
 
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int t=1;
    //cin>>t;
    while(t--){
        solve();
    }
}
0