Submission #1186329

#TimeUsernameProblemLanguageResultExecution timeMemory
1186329asli_bgMarathon Race 2 (JOI24_ho_t3)C++20
7 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; #define int long long typedef pair<int,int> pii; typedef vector<int> vi; typedef vector<pii> vii; typedef vector<bool> vb; typedef tree<pii,null_type,less<pii>,rb_tree_tag, tree_order_statistics_node_update> oset; #define fi first #define se second #define pb push_back #define pf push_front #define mid (l+r)/2 #define all(x) x.begin(),x.end() #define FOR(i,a) for(int i=0;i<(a);i++) #define FORE(i,a,b) for(int i=(a);i<(b);i++) #define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl; #define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl; #define sp <<" "<< #define DEBUG(x) cout<<(#x) sp x<<endl #define carp(a,b) (((a%MOD)*(b%MOD))%MOD) #define topla(a,b) (((a%MOD)+(b%MOD))%MOD) const int INF=1e18; const int MAXN=2e5+5; const int MOD=998244353; int n,l; vi x; int res; void solve(int bas,int son){ int bir,iki; bir=iki=0; //ilk topa git int pos=bas; int top=0; int git=1; if(x[1]<son){ bir+=abs(pos-x[1]); pos=x[1]; top++; bir++; git++; } FORE(i,git,n+1){ if(x[i]>=son) break; bir+=(top+1)*abs(x[i]-pos); pos=x[i]; top++; bir++; } git=n; if(x[n]>=son){ bir+=(top+1)*abs(pos-x[n]); pos=x[n]; top++; bir++; git--; } for(int i=git;i>0;i--){ if(x[i]<son) break; bir+=(top+1)*abs(x[i]-pos); pos=x[i]; top++; bir++; } bir+=(top+1)*abs(son-pos); res=bir; //son topa git pos=bas; top=0; git=n; if(x[n]>son){ iki+=abs(pos-x[n]); pos=x[n]; top++; iki++; git--; } for(int i=git;i>0;i--){ if(x[i]<=son) break; iki+=(top+1)*abs(x[i]-pos); pos=x[i]; top++; iki++; } git=1; if(x[1]<=son){ iki+=(top+1)*abs(pos-x[1]); pos=x[1]; top++; iki++; git++; } FORE(i,git,n+1){ if(x[i]>son) break; iki+=(top+1)*abs(x[i]-pos); pos=x[i]; top++; iki++; } iki+=(top+1)*abs(son-pos); //DEBUG(bir); //DEBUG(iki); res=min(bir,iki); } signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>l; x.resize(n+1); FORE(i,1,n+1) cin>>x[i]; sort(all(x)); int q; cin>>q; while(q--){ int bas,son,t; cin>>bas>>son>>t; solve(bas,son); //DEBUG(res); if(res<=t) cout<<"Yes"<<endl; else cout<<"No"<<endl; } }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...