제출 #1277560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1277560		lmaobruh	Fancy Fence (CEOI20_fancyfence)	C++20	30 / 100	6 ms	588 KiB

fancyfence

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define eb emplace_back
#define pb push_back
#define fi first
#define se second
#define ii pair<int,int>
#define ve vector
#define all(x) x.begin(), x.end()
#define fo(i,a,b) for (int i=(a),_b=(b); i<=_b; ++i)
#define fd(i,a,b) for (int i=(a),_b=(b); i>=_b; --i)
#define maxi(a, b) a = max(a, b)
#define mini(a, b) a = min(a, b)
#define _ << ' ' << 

const int N = 1e5+5, inf = 1e9+10, mod = 1e9+7;

/*

*/

int n, a[N], b[N];

namespace sub1 {
    ll sb[N];
    ll C2(ll x) {
        return (x * (x - 1) / 2) % mod;
    }
    void solve() {
        ll ans = 0;
        fo(i,1,n) {
            int mn = a[i];
            fo(j,i+1,n) {
                mini(mn, a[j]);
                ans = (ans + C2(mn + 1) * b[i] % mod * b[j] % mod) % mod;
            }
        }
        fo(i,1,n) ans = (ans + C2(a[i] + 1) * C2(b[i] + 1)) % mod;
        cout << ans;
    }
}

void sol() {
    cin >> n;
    fo(i,1,n) cin >> a[i];
    fo(i,1,n) cin >> b[i];
    if (n <= 1000) return sub1::solve();
}

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    if(fopen("A.inp","r")) {
        freopen("A.inp","r",stdin);
        freopen("A.out","w",stdout);
    }
    int tc = 1; // cin >> tc;
    fo(i,1,tc) sol();
    return 0;
}

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

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

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