結果
問題 | No.1834 1D Gravity |
ユーザー |
|
提出日時 | 2022-02-04 23:14:32 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,362 bytes |
コンパイル時間 | 1,925 ms |
コンパイル使用メモリ | 200,016 KB |
最終ジャッジ日時 | 2025-01-27 19:50:11 |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 4 WA * 22 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for(long long i=0;i<(long long)(n);i++)#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)#define pb emplace_back#define lb(v,k) (lower_bound(all(v),(k))-v.begin())#define ub(v,k) (upper_bound(all(v),(k))-v.begin())#define fi first#define se second#define pi M_PI#define PQ(T) priority_queue<T>#define SPQ(T) priority_queue<T,vector<T>,greater<T>>#define dame(a) {out(a);return 0;}#define decimal cout<<fixed<<setprecision(15);#define all(a) a.begin(),a.end()#define rsort(a) {sort(all(a));reverse(all(a));}#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}#define popcnt __builtin_popcountlltypedef long long ll;typedef pair<ll,ll> P;typedef tuple<ll,ll,ll> PP;typedef tuple<ll,ll,ll,ll> PPP;using vi=vector<ll>;using vvi=vector<vi>;using vvvi=vector<vvi>;using vvvvi=vector<vvvi>;using vp=vector<P>;using vvp=vector<vp>;using vb=vector<bool>;using vvb=vector<vb>;const ll inf=1001001001001001001;const ll INF=1001001001;const ll mod=1000000007;const double eps=1e-10;template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}template<class T> void out(T a){cout<<a<<'\n';}template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}template<class T> void yesno(T b){if(b)out("yes");else out("no");}template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';}void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}int main(){ll n;cin>>n;vi v(n);rep(i,n)cin>>v[i];vi id(n);rep(i,n){if(i==0)id[i]=1;else if(i==n-1)id[i]=0;else if(v[i-1]<v[i+1])id[i]=1;else id[i]=0;}ll ans1=0,ans2=0;ll l=0;vp al;while(l<n){ll r=l,a=0,b=0;while(id[r]==1){a++;r++;}while(r<n&&id[r]==0){b++;r++;}l=r;al.pb(a-1,b-1);}l=0;while(l<al.size()){ll r=l+1;if(al[l].se==0){while(r<al.size()&&al[r]==P(0,0))r++;if(r<al.size()&&al[r].fi==0)r++;}ll a=al[l].fi,b=al[r-1].se,c=r-l;// cout<<a<<' '<<b<<' '<<c<<endl;ll tmp=c-1;a-=tmp;b-=tmp;if(a<0)a=(a+INF+1)%2;if(b<0)b=(b+INF+1)%2;ll tmp2=min(a,b);a-=tmp2;b-=tmp2;if(a+b>1)ans2+=(a+b)/2;else ans2++;if(a+b>1)tmp+=2;else tmp++;tmp+=tmp2;chmax(ans1,tmp);l=r;}cout<<ans1<<' '<<ans2<<endl;}