Submission #745752

#	Time	Username	Problem	Language	Result	Execution time	Memory
745752		vjudge1	Fancy Fence (CEOI20_fancyfence)	C++14	0 / 100	2 ms	308 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;

#define int long long

const int MOD = 1e9 +7;

signed main() {
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    int cnt = 0;
    for(int i = 0; i < n; i++){
        cin >> h[i] >> w[i];
        cnt = (cnt + w[i]) % MOD;
    }
    if(h[0] > 1 && cnt > 1) cout << (cnt * (cnt + 1) / 2 * h[0] * (h[0] + 1) / 2) % MOD << endl;
    else if(h[0] == 1 && cnt != 1) cout << (cnt * (cnt + 1) / 2) % MOD<< endl;
    else if(cnt == 1 && h[0] != 1) cout << (h[0] * (h[0] + 1) / 2) % MOD << endl;
    else cout << 1 << endl;
    return 0;
}

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