oj.uz

답안 #745841

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
745841 2023-05-21T08:39:20 Z vjudge1 Fancy Fence (CEOI20_fancyfence) C++17
15 / 100
 21 ms 1900 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;

ll solve_rect(ll h, ll w) {
  h %= mod;
  w %= mod;
  ll hc = (h * (h + 1) / 2) % mod;
  ll wc = (w * (w + 1) / 2) % mod;
  return (hc * wc) % mod;
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int n;
  cin >> n;
  vector<ll> hv(n), wv(n);
  for (ll& h : hv) cin >> h;
  for (ll& w : wv) cin >> w;
  ll res = 0ll;
  ll w_rem = accumulate(wv.begin(), wv.end(), 0ll);
  res += solve_rect(hv[0], w_rem);
  /*
  ll prev_h = 0ll;
  cout << w_rem << endl;
  for (int i = 0; i < n; i++) {
    int h = hv[i], w = wv[i];
    res += solve_rect(h - prev_h, w_rem);
    res %= mod;
    w_rem -= w;
    prev_h = h;
  }*/
  cout << res;
}

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 9 ms 1108 KB Output is correct
4 Correct 18 ms 1900 KB Output is correct
5 Correct 21 ms 1876 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -