Submission #945688

#TimeUsernameProblemLanguageResultExecution timeMemory
945688kxdFancy Fence (CEOI20_fancyfence)C++17
0 / 100
1 ms2396 KiB
#include <bits/stdc++.h> //#define DEBUG 1106 #define int long long #define ll long long #define ld long double #define pb push_back #define p_q priority_queue #define m_p make_pair #define pii pair<int,int> #define endl '\n' #define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define FOR(i,a,b) for(int i = a; i <= b; i++) #define forn(i,n) for (int i = 0; i < n; i++) #define forn1(i,n) for (int i = 1; i <= n; i++) #define all(x) x.begin(),x.end() #define ft first #define sd second #define lowbit(x) (x&(-x)) #define chmax(x,y) x=max(x,y) #define chmin(x,y) x=min(x,y) #ifdef DEBUG #define debug(x) cout << #x << ": " << x << endl; #else #define debug(x) 1106; #endif using namespace std; const int N = 2e5+5; const int inf = 1e9; const int INF = 1e18; const int MOD = 1e9+7; int h[N],w[N];; signed main() { INIT #ifdef DEBUG freopen("input.txt", "r", stdin); #endif /////////// int n; cin >> n; forn(i,n) { cin >> h[i]; } int t = 0; forn(i,n) { cin >> w[i]; t += w[i]; } t = (t%MOD+MOD+MOD)%MOD; int x = h[0]; int y = t; if(y<x) swap(x,y); int a = x; int b = x-1; int c = x+1; if(a%3==0) a/=3; if(c%3==0) b/=3; if(b%3==0) c/=3; int ans = (((a*b)%MOD)*c)%MOD + ((((x*(x+1))/2)%MOD)*(y-x+1))%MOD; cout << (ans%MOD+MOD+MOD)%MOD; }
#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...