# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
661306 | ktkerem | Fancy Fence (CEOI20_fancyfence) | C++17 | 82 ms | 6052 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")/**/
#include<bits/stdc++.h>
/**/
//typedef int ll;
typedef long long ll;
typedef unsigned long long ull;
typedef std::string str;
/*typedef __int128 vll;
typedef unsigned __int128 uvll;*/
#define llll std::pair<ll , ll>
#define pb push_back
#define pf push_front
#define halo cout << "hello\n"
#define fi first
#define sec second
#define all(a) a.begin() , a.end()
const ll limit = 1e9 + 7;
const ll ous = 1e5 + 7;
const ll dx[4] = {-1 , 0 , 1 , 0} , dy[4] = {0,1,0,-1};
ll n , m;std::vector<llll> ar;
ll binpow(ll x , ll y){
ll g = 1;
while(y){
if(y & 1){
g*=x;
g%=limit;
}
y/=2;
x*=x;
x%=limit;
}
return g;
}
void solve(){
ll n;std::cin >> n;
ar.resize(n+1);
ll biki = binpow(2 , limit - 2);
//std::cout << biki << "\n";
for(ll i = 0;n>i;i++){
std::cin >> ar[i].fi;
}
for(ll i = 0;n>i;i++){
std::cin >> ar[i].sec;
}
ar[n] = {0 , 0};
std::vector<llll> v;
v.pb({0 , 0});
ll ans = 0;
for(ll i = 0;n>=i;i++){
ll ww = 0;
while(v[(ll)v.size() - 1].fi > ar[i].fi){
ll nh = std::max(ar[i].fi , v[(ll)v.size() - 2].fi);
ll df = v[(ll)v.size() - 1].fi - nh;
ww = (ww + v[(ll)v.size() - 1].sec) % limit;
v.pop_back();
//std::cout << df << " " << ww << "\n";
ans += (((((df * (df + 1) % limit) * biki % limit) + (df * nh % limit)) % limit) * ((ww * (ww + 1) % limit) * biki % limit))%limit;
ans %= limit;
}
v.pb({ar[i].fi , ar[i].sec + ww});
}
std::cout << ans << "\n";
return;/**/
}
signed main(){
ll t=1;
//std::cin >> t;
ll o = 1;
while(t--){
//cout << "Case " << o++ << ":\n";
solve();
}
return 0;
}/**/
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |