oj.uz

Submission #203628

# Submission time Handle Problem Language Result Execution time Memory
203628 2020-02-21T16:38:27 Z thebes Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 181 ms 13176 KB 
#include <bits/stdc++.h>
#define DEBUG 1
using namespace std;

namespace output{
    void __(short x){cout<<x;}
    void __(unsigned x){cout<<x;}
    void __(int x){cout<<x;}
    void __(long long x){cout<<x;}
    void __(unsigned long long x){cout<<x;}
    void __(double x){cout<<x;}
    void __(long double x){cout<<x;}
    void __(char x){cout<<x;}
    void __(const char*x){cout<<x;}
    void __(const string&x){cout<<x;}
    void __(bool x){cout<<(x?"true":"false");}
    template<class S,class T>
    void __(const pair<S,T>&x){__(DEBUG?"(":""),__(x.first),__(DEBUG?", ":" "),__(x.second),__(DEBUG?")":"");}
    template<class T>
    void __(const vector<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const set<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class T>
    void __(const multiset<T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    template<class S,class T>
    void __(const map<S,T>&x){__(DEBUG?"{":"");bool _=0;for(const auto&v:x)__(_?DEBUG?", ":" ":""),__(v),_=1;__(DEBUG?"}":"");}
    void pr(){cout<<"\n";}
    template<class S,class... T>
    void pr(const S&a,const T&...b){__(a);if(sizeof...(b))__(' ');pr(b...);}
}

using namespace output;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
typedef pair<ld,ld> pld;
typedef vector<int> vi;
typedef vector<ll> vl;

#define pb push_back
#define fox(i,x,y) for(int i=(x);i<=(y);i++)
#define foxr(i,x,y) for(int i=(y);i>=(x);i--)

const ll MN = 2e5+5;
ll N, Q, S, T, A[MN], arr[MN], x, y, k, i, ans;

int main(){
    scanf("%lld%lld%lld%lld",&N,&Q,&S,&T);
    for(i=0;i<=N;i++) scanf("%lld",&A[i]);
    for(i=1;i<=N;i++){
        arr[i]=A[i-1]-A[i];
        ans+=arr[i]>=0?arr[i]*T:arr[i]*S;
    }
    for(;Q;Q--){
        scanf("%lld%lld%lld",&x,&y,&k); y++; k*=-1; ll kk = k;
        if(arr[x]<=0){
            if(k>=0){
                ll D = min(-arr[x],k);
                k -= D; arr[x] += D; ans += S*D;
                if(k) arr[x]+=k, ans += T*k;
            }
            else arr[x]+=k, ans += S*k;
        }
        else{
            if(k<=0){
                ll D = min(arr[x],-k);
                k += D, arr[x] -= D; ans -= T*D;
                if(k) arr[x]+=k, ans += S*k;
            }
            else arr[x]+=k, ans += T*k;
        }
        if(y==N+1){
            printf("%lld\n",ans);
            continue;
        }
        x = y; k = -kk;
        if(arr[x]<=0){
            if(k>=0){
                ll D = min(-arr[x],k);
                k -= D; arr[x] += D; ans += S*D;
                if(k) arr[x]+=k, ans += T*k;
            }
            else arr[x]+=k, ans += S*k;
        }
        else{
            if(k<=0){
                ll D = min(arr[x],-k);
                k += D, arr[x] -= D; ans -= T*D;
                if(k) arr[x]+=k, ans += S*k;
            }
            else arr[x]+=k, ans += T*k;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld%lld%lld%lld",&N,&Q,&S,&T);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:52:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(i=0;i<=N;i++) scanf("%lld",&A[i]);
                       ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%lld%lld%lld",&x,&y,&k); y++; k*=-1; ll kk = k;
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 7 ms 504 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 504 KB Output is correct
14 Correct 6 ms 504 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 504 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 167 ms 10348 KB Output is correct
2 Correct 166 ms 11000 KB Output is correct
3 Correct 161 ms 11536 KB Output is correct
4 Correct 145 ms 10872 KB Output is correct
5 Correct 153 ms 12152 KB Output is correct
6 Correct 144 ms 11128 KB Output is correct
7 Correct 130 ms 11064 KB Output is correct
8 Correct 159 ms 11896 KB Output is correct
9 Correct 157 ms 12148 KB Output is correct
10 Correct 163 ms 10876 KB Output is correct
11 Correct 117 ms 11000 KB Output is correct
12 Correct 125 ms 11896 KB Output is correct
13 Correct 120 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 504 KB Output is correct
4 Correct 6 ms 504 KB Output is correct
5 Correct 6 ms 504 KB Output is correct
6 Correct 6 ms 504 KB Output is correct
7 Correct 7 ms 504 KB Output is correct
8 Correct 7 ms 504 KB Output is correct
9 Correct 7 ms 376 KB Output is correct
10 Correct 6 ms 376 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 6 ms 504 KB Output is correct
13 Correct 6 ms 504 KB Output is correct
14 Correct 6 ms 504 KB Output is correct
15 Correct 6 ms 376 KB Output is correct
16 Correct 6 ms 504 KB Output is correct
17 Correct 6 ms 376 KB Output is correct
18 Correct 6 ms 376 KB Output is correct
19 Correct 5 ms 376 KB Output is correct
20 Correct 5 ms 376 KB Output is correct
21 Correct 5 ms 376 KB Output is correct
22 Correct 167 ms 10348 KB Output is correct
23 Correct 166 ms 11000 KB Output is correct
24 Correct 161 ms 11536 KB Output is correct
25 Correct 145 ms 10872 KB Output is correct
26 Correct 153 ms 12152 KB Output is correct
27 Correct 144 ms 11128 KB Output is correct
28 Correct 130 ms 11064 KB Output is correct
29 Correct 159 ms 11896 KB Output is correct
30 Correct 157 ms 12148 KB Output is correct
31 Correct 163 ms 10876 KB Output is correct
32 Correct 117 ms 11000 KB Output is correct
33 Correct 125 ms 11896 KB Output is correct
34 Correct 120 ms 11896 KB Output is correct
35 Correct 167 ms 10588 KB Output is correct
36 Correct 160 ms 11896 KB Output is correct
37 Correct 163 ms 12800 KB Output is correct
38 Correct 162 ms 12536 KB Output is correct
39 Correct 163 ms 12640 KB Output is correct
40 Correct 158 ms 12408 KB Output is correct
41 Correct 162 ms 12280 KB Output is correct
42 Correct 166 ms 12408 KB Output is correct
43 Correct 156 ms 11640 KB Output is correct
44 Correct 181 ms 12156 KB Output is correct
45 Correct 145 ms 12156 KB Output is correct
46 Correct 152 ms 13176 KB Output is correct
47 Correct 130 ms 11768 KB Output is correct
48 Correct 132 ms 11768 KB Output is correct
49 Correct 141 ms 10744 KB Output is correct
50 Correct 121 ms 11640 KB Output is correct
51 Correct 123 ms 11896 KB Output is correct
52 Correct 124 ms 11768 KB Output is correct