Submission #959363

#TimeUsernameProblemLanguageResultExecution timeMemory
959363ALTAKEXEFancy Fence (CEOI20_fancyfence)C++17
0 / 100
1 ms516 KiB
#include<bits/stdc++.h> #define ll long long #define f first #define s second const int mod = 1e9 + 7; using namespace std; int main(){ int n,ans=0; cin>>n; int h[n],w[n]; for(int i=0;i<n;i++) cin>>h[i]; for(int i=0;i<n;i++) cin>>w[i]; for(int i=1;i<=n;i++) ans+=i; cout<<ans*4<<endl; return 0; }
#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...