Submission #900681

#TimeUsernameProblemLanguageResultExecution timeMemory
9006813laaFancy Fence (CEOI20_fancyfence)C++14
15 / 100
57 ms3836 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> #include <unordered_map> #define endl '\n' #define mid ((l+r)/2) #define F first #define S second #define pb push_back #define yes void (cout<<"YES"<<endl) #define no void (cout<<"NO"<<endl) #define ump unordered_map <ll,ll> #define sp " " #define vll vector<ll> #define vint vector<int> #define pll pair<ll,ll> typedef long long ll; using namespace std; const ll inf=1e18+9; const ll M=1e9+7; ll n; ll h[100009]; ll w[100009]; int main(){ cin>>n; for(ll i=0 ; i<n ; i++){ cin>>h[i]; } ll W=0; for(ll i=0 ; i<n ; i++){ cin>>w[i]; W+=w[i]; W%=M; } vector<pll> v; v.pb({h[0],w[0]}); for(ll i=1 ; i<n ; i++){ if(h[i]==h[i-1]){ v[v.size()-1].S+=w[i]; v[v.size()-1].S%=M; } else v.pb({h[i],w[i]}); } ll x=((h[0]*(h[0]+1)/2))%M; ll y=((W*(W+1))/2)%M; ll ans=(x*y)%M; W-=w[0]; for(ll i=1 ; i<v.size() ; i++){ x=((h[i]*(h[i]+1))/2)%M; y=((W*(W+1))/2)%M; ans=(ans+((x*y)%M))%M; x=((h[i-1]*(h[i-1]+1))/2)%M; ans=((ans+M)-((x*y)%M))%M; W-=w[i]; } cout<<ans<<endl; }

Compilation message (stderr)

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:48:19: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(ll i=1 ; i<v.size() ; i++){
      |                  ~^~~~~~~~~
#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...