oj.uz

답안 #877000

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877000 2023-11-22T16:36:49 Z cpptowin Foehn Phenomena (JOI17_foehn_phenomena) C++17
0 / 100
 2 ms 860 KB 
#include<bits/stdc++.h>
#define fo(i,d,c) for(int i=d;i<=c;i++)
#define fod(i,c,d) for(int i=c;i>=d;i--)
#define maxn 1000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout<<"\n";
#define int long long
#define inf 1000000000
#define pii pair<int,int>
#define vii vector<pii>
#define lb(x) x&-x
#define bit(i,j) ((i>>j)&1)
#define offbit(i,j) (i^(1<<j))
#define onbit(i,j) (i|(1<<j))
#define vi vector<int>
template <typename T1, typename T2> bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
struct Fenwick_Tree
{
    int bit_add[N], bit_sub[N];
    void update(int u, int v, int val)
    {
        for (int i = u; i <= N; i += i & -i)
        {
            bit_add[i] += val;
            bit_sub[i] += 1LL * (u - 1) * val;
        }
        for (int i = v; i <= N; i += i & -i)
        {
            bit_add[i] -= val;
            bit_sub[i] -= 1LL * v * val;
        }
    }

    void update(int u, int val)
    {
        update(u, u, val);
    }

    int get(int u)
    {
        if(u == 0) return 0;
        int ans1 = 0, ans2 = 0;
        if(u <= 0) return 0;
        for (int i = u; i; i -= i & -i)
        {
            ans1 += bit_add[i];
            ans2 += bit_sub[i];
        }
        return u * ans1 - ans2;
    }

    int get(int l, int r)
    {
        return get(r) - get(l - 1);
    }
} t1;
int a[N];
int n,q,s,t;
int ans;
main()
{
#define name "TASK"
    if(fopen(name".inp","r"))
    {
        freopen(name".inp","r",stdin);
        freopen(name".out","w",stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> q >> s >> t;
    fo(i,1,n)
    {
        cin >> a[i];
        ans += ((a[i - 1] - a[i] < 0) ? t : -s) * (a[i - 1] - a[i]);
    }
    while(q--)
    {
        int l,r,add;
        cin >> l >> r >> add;
        int val = ((t1.get(l - 1,l - 1) - t1.get(l,l) < 0) ? t : -s) * (t1.get(l - 1,l - 1) - t1.get(l,l));
        ans -= val;
        if(r < n)
            val = ((t1.get(r,r) - t1.get(r + 1,r + 1) < 0) ? t : -s) * (t1.get(r,r) - t1.get(r + 1,r + 1));
        t1.update(l,r,add);
        val = ((t1.get(l - 1,l - 1) - t1.get(l,l) < 0) ? t : -s) * (t1.get(l - 1,l - 1) - t1.get(l,l));
        ans += val;
        if(r <= n)
        val = ((t1.get(r,r) - t1.get(r + 1,r + 1) < 0) ? t : -s) * (t1.get(r,r) - t1.get(r + 1,r + 1));
        ans += val;
        cout << ans;
        en;
    }
}

Compilation message

foehn_phenomena.cpp:81:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   81 | main()
      | ^~~~
foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:86:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |         freopen(name".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:87:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |         freopen(name".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 2 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 604 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -