oj.uz

답안 #528244

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528244 2022-02-19T18:13:27 Z Olympia Fancy Fence (CEOI20_fancyfence) C++17
0 / 100
 4 ms 332 KB 
#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#include <stack>

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimization ("Ofast")
using namespace std;
const int MOD = 1e9 + 7;
int64_t mult (int64_t x, int64_t y) {
    return (x * y) % MOD;
}
int64_t c2 (int64_t x) {
    return (x * (x + 1)/2) % MOD;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N;
    cin >> N;
    vector<int64_t> h(N), w(N);
    vector<pair<int64_t,int64_t>> grid(N);
    for (int i = 0; i < N; i++) {
        cin >> h[i];
    }
    for (int i = 0; i < N; i++) {
        cin >> w[i];
    }
    for (int i = 0; i < N; i++) {
        grid[i] = make_pair(h[i], w[i]);
    }
    int64_t ans = 0;
    for (int i = 0; i < N; i++) {
        int64_t min_w = 1e10;
        for (int j = i; j < N; j++) {
            min_w = min(min_w, grid[j].second);
            int64_t to_add = 0;
            if (i == j) {
                to_add += mult(c2(min_w), c2(grid[i].first));
            } else {
                to_add += mult(c2(min_w), mult(grid[i].first, grid[j].first));
            }
            //cout << i << " " << j << " " << to_add << '\n';
            ans += to_add;
            ans %= MOD;
        }
    }
    cout << ans << '\n';
}

Compilation message

fancyfence.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("O3")
      | 
fancyfence.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   17 | #pragma GCC optimization ("unroll-loops")
      | 
fancyfence.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("Ofast")
      |

Subtask #1
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 4 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

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

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 4 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

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

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 4 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 4 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 4 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -