oj.uz

답안 #921819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
921819 2024-02-04T10:53:42 Z Alebn Fancy Fence (CEOI20_fancyfence) C++14
28 / 100
 1000 ms 3924 KB 
#include <bits/stdc++.h>
#define int long long
 
using namespace std;
 
const int MOD = 1e9+7, INV = 250000002;
 
int f(int n, int m) {
    return n * m % MOD * (n + 1) % MOD * (m + 1) % MOD * INV % MOD;
}
 
signed main() {
    //input and sum
    int n;
    cin >> n;
    vector<int> h(n), w(n);
    for(int i = 0; i < n; i++) cin >> h[i];
    for(int i = 0; i < n; i++) cin >> w[i];
    //linearily go over and compute result
    int res = 0;
    vector<int> hSorted;
    set<int> st;
    for(int i = 0; i < n; i++) {
        if(!st.count(h[i])) {
            hSorted.push_back(h[i]);
            st.insert(h[i]);
        }
    }
    sort(hSorted.begin(), hSorted.end());
    for(int i = 0; i < hSorted.size(); i++) {
        int consecutiveW = 0, minH = INT_MAX;
        for(int j = 0; j < n; j++) {
            if(h[j] < hSorted[i]) {
                //cout << minH << " " << consecutiveW << "\n";
                res = (res + f(minH, consecutiveW)) % MOD;
                if(i != 0) res = (res - f(hSorted[i-1], consecutiveW)) % MOD;
                if(res < 0) res = (res + 10000000070000000) % MOD;
                consecutiveW = 0, minH = INT_MAX;
            } else {
                consecutiveW = (consecutiveW + w[j]) % MOD;
                minH = min(minH, h[j]);
            }
        }
        //cout << minH << " " << consecutiveW << "\n";
        res = (res + f(minH, consecutiveW)) % MOD;
        if(i != 0) res = (res - f(hSorted[i-1], consecutiveW)) % MOD;
        if(res < 0) res = (res + 10000000070000000) % MOD;
        //cout << res << " " << i << "r\n";
    }
    //cout << h[n-1] << " " << m << "\n";
    cout << res << "\n";
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:30:22: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i = 0; i < hSorted.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
0 / 12.0

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

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 21 ms 1724 KB Output is correct
4 Correct 43 ms 3156 KB Output is correct
5 Correct 41 ms 3020 KB Output is correct
6 Correct 43 ms 3408 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 6 ms 680 KB Output is correct
3 Correct 35 ms 2140 KB Output is correct
4 Correct 71 ms 3924 KB Output is correct
5 Correct 59 ms 3924 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 7 ms 860 KB Output is correct
4 Correct 30 ms 2200 KB Output is correct
5 Correct 56 ms 3924 KB Output is correct
6 Correct 62 ms 3912 KB Output is correct
7 Correct 11 ms 348 KB Output is correct
8 Execution timed out 1050 ms 1320 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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