oj.uz

답안 #1013591

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1013591 2024-07-03T17:00:46 Z daffuwu Fancy Fence (CEOI20_fancyfence) C++14
55 / 100
 24 ms 5480 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

long long n, h[100069], w, dp[100069], ans, ps[100069];
const long long dv = 1e9+7;
stack<long long> stk;

long long calc(long long a, long long b)
{
    if (a%2 == 0) a/=2;
    else b/=2;
    return a%dv*(b%dv)%dv;
}

int main() 
{
    long long i, j;
    scanf("%lld", &n);
    for (i=1; i<=n; i++)
    {
        scanf("%lld", h+i);
    }
    stk.push(0);
    for (i=1; i<=n; i++)
    {
        scanf("%lld", &w);
        ps[i] = ps[i-1]+w;
        for (; h[i]<=h[stk.top()]; stk.pop());
        j = stk.top();
        ans += (calc(ps[i]-ps[j], ps[i]-ps[j]+1)-calc(ps[i-1]-ps[j], ps[i-1]-ps[j]+1))*calc(h[i], h[i]+1)%dv;
        ans += dp[j]*w%dv;
        ans %= dv;
        dp[i] = (dp[j]+calc(h[i], h[i]+1)*(ps[i]-ps[j])%dv)%dv;
        stk.push(i);
    }
    if (ans<0) ans += dv;
    printf("%lld\n", ans);
}

Compilation message

fancyfence.cpp: In function 'int main()':
fancyfence.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%lld", &n);
      |     ~~~~~^~~~~~~~~~~~
fancyfence.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |         scanf("%lld", h+i);
      |         ~~~~~^~~~~~~~~~~~~
fancyfence.cpp:29:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |         scanf("%lld", &w);
      |         ~~~~~^~~~~~~~~~~~

Subtask #1
0.0 / 0.0

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

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 8 ms 2148 KB Output is correct
4 Correct 15 ms 3416 KB Output is correct
5 Correct 16 ms 3404 KB Output is correct
6 Correct 20 ms 3456 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 12 ms 2468 KB Output is correct
4 Correct 24 ms 4700 KB Output is correct
5 Correct 17 ms 4780 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 828 KB Output is correct
4 Correct 10 ms 2572 KB Output is correct
5 Correct 20 ms 4556 KB Output is correct
6 Correct 19 ms 4688 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 9 ms 2652 KB Output is correct
10 Correct 24 ms 5288 KB Output is correct
11 Correct 17 ms 5480 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #6
0 / 18.0

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

Subtask #7
0 / 27.0

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