Submission #1035681

#TimeUsernameProblemLanguageResultExecution timeMemory
1035681modwweSightseeing in Kyoto (JOI22_kyoto)C++17
0 / 100
0 ms468 KiB
//https://www.instagram.com/_modwwe/ #pragma GCC optimize("Ofast,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2") #include<bits/stdc++.h> #define int long long //#define ll long long #define down cout<<'\n'; #define debug cout<<" cucuucucuuu",down #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".ans","w",stdout) #define pb push_back #define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms"; using namespace std; void phongbeo(); const int inf=1e18; 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,s33; int i,s10,s12; int kk; int el=29; main() { #ifndef ONLINE_JUDGE // fin(task),fou(task); #endif NHP /// cin>>s1; // modwwe phongbeo(); } vector<int> v; vector<int> v2; int a[100001]; int b[100001]; int c[100002]; void phongbeo() { cin>>n>>m; dem=0; dem2=0; for(int i=1; i<=n; i++) cin>>a[i]; for(int i=1; i<=m; i++) cin>>b[i]; c[0]=inf; for(int i=1; i<=n; i++) { if(a[i]<c[i-1]) c[i]=a[i],v.pb(i); else c[i]=c[i-1]; } c[0]=inf; for(int i=1; i<=m; i++) { if(b[i]<c[i-1]) c[i]=b[i],v2.pb(i); else c[i]=c[i-1]; } l=0; r=0; s4=0; for(int i=1;i<=v.size()+v2.size()-2;i++) { s2=1e18; s3=1e18; if(l+1!=v.size()){s2=(a[v[l+1]]-a[v[l]])*(v2.back()-v2[r]);} if(r+1!=v2.size()){s3=(b[v2[r+1]]-b[v2[r]])*(v.back()-v[l]);} if(s2<s3){ s4+=(v[l+1]-v[l])*b[v2[r]]; l++;} else {s4+=(v2[r+1]-v2[r])*a[v[l]];r++;} } v.clear(); v2.clear(); c[n+1]=inf; for(int i=n;i>=1;--i) if(a[i]<c[i+1]) c[i]=a[i],v.pb(i); else c[i]=c[i+1]; c[m+1]=inf; for(int i=m;i>=1;--i) if(b[i]<c[i+1]) c[i]=b[i],v2.pb(i); else c[i]=c[i+1]; reverse(v.begin(),v.end()); reverse(v2.begin(),v2.end()); l=0; r=0; for(int i=1;i<=v.size()+v2.size()-2;i++) { s2=1e18; s3=1e18; if(l+1!=v.size()){s2=(a[v[l+1]]-a[v[l]])*(v2.back()-v2[r]);} if(r+1!=v2.size()){s3=(b[v2[r+1]]-b[v2[r]])*(v.back()-v[l]);} if(s2<s3){ s4+=(v[l+1]-v[l])*b[v2[r]]; s5=(v[l+1]-v[l])*b[v2[r]]; l++;} else {s4+=(v2[r+1]-v2[r])*a[v[l]],s6=(v2[r+1]-v2[r])*a[v[l]];r++; } } cout<<s4; }

Compilation message (stderr)

kyoto.cpp:49:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   49 | main()
      | ^~~~
kyoto.cpp: In function 'void phongbeo()':
kyoto.cpp:88:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |      for(int i=1;i<=v.size()+v2.size()-2;i++)
      |                  ~^~~~~~~~~~~~~~~~~~~~~~
kyoto.cpp:91:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         if(l+1!=v.size()){s2=(a[v[l+1]]-a[v[l]])*(v2.back()-v2[r]);}
      |            ~~~^~~~~~~~~~
kyoto.cpp:92:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         if(r+1!=v2.size()){s3=(b[v2[r+1]]-b[v2[r]])*(v.back()-v[l]);}
      |            ~~~^~~~~~~~~~~
kyoto.cpp:113:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |        for(int i=1;i<=v.size()+v2.size()-2;i++)
      |                    ~^~~~~~~~~~~~~~~~~~~~~~
kyoto.cpp:116:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |         if(l+1!=v.size()){s2=(a[v[l+1]]-a[v[l]])*(v2.back()-v2[r]);}
      |            ~~~^~~~~~~~~~
kyoto.cpp:117:15: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         if(r+1!=v2.size()){s3=(b[v2[r+1]]-b[v2[r]])*(v.back()-v[l]);}
      |            ~~~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...