Submission #999936

#TimeUsernameProblemLanguageResultExecution timeMemory
999936modwweMarathon Race 2 (JOI24_ho_t3)C++17
7 / 100
1 ms2396 KiB
///https://www.instagram.com/_modwwe/ #include<bits/stdc++.h> #define int long long //#define ll long long #define down cout<<'\n'; #define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0); #define modwwe int t;cin>>t; while(t--) #define bit(i,j) (i>>j&1) #define sobit(a) __builtin_popcountll(a) #define task "test" #define fin(x) freopen(x".inp","r",stdin) #define fou(x) freopen(x".out","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; void phongbeo(); const int mod2=1e9+7; const int mod1=998244353; struct icd { int a,b; }; struct ib { int a; int b; }; struct ic { int a,b,c; }; struct id { int a,b,c,d; }; struct ie { int a,b,c, d,e,f; }; int n,m,s1,s2,s4,s3,sf,k,r,mid,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,l; int i,s10,s12; int el=29; main() { #ifndef ONLINE_JUDGE // fin(task),fou(task); #endif NHP /// cin>>s1; // modwwe phongbeo(); } int a[500002]; int dp[500003][2]; int c[500002][2]; void solve1() { /// left for(int i=2;i<=n;i++) dp[i][0]=dp[i-1][0]+(i-1)*(a[i]-a[i-1]); } void solve2() { /// right for(int i=n-1;i>=1;--i) dp[i][1]=dp[i+1][1]+(n-i)*(a[i+1]-a[i]); } void solve3() {/// left->right->mid /// right->left->mid s8=0; for(int i=1;i<=n;i++){ if(a[i]!=a[i+1]){ c[i][0]=dp[s8][0]+dp[i][1]+s8*(a[n]-a[s8]+a[n]-a[i])+a[n]-a[1]+a[n]-a[i]; c[s8+1][0]=c[i][0]; s8=i; } } s8=n+1; for(int i=n;i>=1;--i){ if(a[i]!=a[i-1]){ c[i][1]=dp[s8][1]+dp[i][0]+(n-s8+1)*(a[s8]-a[1]+a[i]-a[1])+a[n]-a[1]+a[i]-a[1]; c[s8-1][1]=c[i][1]; s8=i; } } } void phongbeo() { cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i];///16 ///2 7 11 12 18 a[0]=-1; sort(a+1,a+1+n); solve1(); solve2(); solve3(); cin>>m; while(m--) { cin>>l>>r>>s2; s6=abs(a[1]-l); s4=abs(a[n]-l); s3=lower_bound(a+1,a+1+n,r)-a; s9=upper_bound(a+1,a+1+n,r)-a; s9=s9-s3; s5=1e18; if(s3-1!=0){ s7=(r-a[s3-1])*(n+1-s9); s5=min({s5,c[s3-1][0]+s6+s7,c[s3-1][1]+s4+s7}); } if(s3<=n){ s7=(a[s3]-r)*(n+1); s5=min({s5,c[s3][0]+s6+s7,c[s3][1]+s4+s7}); } s5+=n; if(s5<=s2) cout<<"Yes"; else cout<<"No"; down } }

Compilation message (stderr)

Main.cpp:44:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   44 | main()
      | ^~~~
#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...