제출 #1165365

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165365		SmuggingSpun	Fancy Fence (CEOI20_fancyfence)	C++20	28 / 100	15 ms	1096 KiB

fancyfence

#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
typedef long long ll;
const int lim = 1e5 + 5;
const int mod = 1e9 + 7;
void add(int& a, int b){
    if((a += b) >= mod){
        a -= mod;
    }
}
int f(ll N){
    return ((N & 1LL) ? N % mod * (((N + 1) >> 1LL) % mod) : (N >> 1LL) % mod * ((N + 1) % mod)) % mod;
}
int n, h[lim], w[lim];
namespace sub3{
    void solve(){
        int ans = f(accumulate(w + 1, w + n + 1, 0LL));
        ll N = 0;
        for(int i = 1; i <= n; i++){
            if(h[i] == 2){
                N += w[i];
            }
            else{
                add(ans, (f(N) << 1) % mod);
                N = 0;
            }
        }
        cout << (ans + ((f(N) << 1) % mod)) % mod;
    }
}
namespace sub4{
    void solve(){
        cout << 1LL * f(accumulate(w + 1, w + n + 1, 0LL)) * f(h[1]) % mod;
    }
}
int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if(fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
    }
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> h[i];
    }
    for(int i = 1; i <= n; i++){
        cin >> w[i];
    }
    if(*max_element(h + 1, h + n + 1) < 3){
        sub3::solve();
    }
    else if(*min_element(h + 1, h + n + 1) == *max_element(h + 1, h + n + 1)){
        sub4::solve();
    }
}

컴파일 시 표준 에러 (stderr) 메시지

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 0
• Subtask 2: 0 / 12
• Subtask 3: 13 / 13
• Subtask 4: 15 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 18
• Subtask 7: 0 / 27