oj.uz

Submission #129363

# Submission time Handle Problem Language Result Execution time Memory
129363 2019-07-12T06:22:41 Z LittleFlowers__ Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 137 ms 7800 KB 
#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(false),cin.tie(nullptr);
#define task "Foehn"
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define gg exit(0)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
main(){
    //freopen(task".inp","r",stdin);
    //freopen(task".out","w",stdout);
    #define int long long
    int n=in,q=in,s=in,t=in,tmp=0;
    vector<int> a(n+1),b(n+1);
    forinc(i,0,n) a[i]=in;
    auto eval=[&](int i){
        return  i<0 ? i*s : i*t;
    };
    forinc(i,1,n){
        b[i]=a[i-1]-a[i];
        tmp+=eval(b[i]);
    }
    forinc(i,1,q){
        int l=in,r=in,x=in;
        if(l){
            tmp-=eval(b[l]);
            b[l]-=x;
            tmp+=eval(b[l]);
        }
        if(r<n){
            tmp-=eval(b[r+1]);
            b[r+1]+=x;
            tmp+=eval(b[r+1]);
        }
        cout<<tmp<<"\n";
    }
}

Compilation message

foehn_phenomena.cpp:22:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 5484 KB Output is correct
2 Correct 127 ms 6136 KB Output is correct
3 Correct 131 ms 6776 KB Output is correct
4 Correct 122 ms 5752 KB Output is correct
5 Correct 132 ms 6520 KB Output is correct
6 Correct 102 ms 7032 KB Output is correct
7 Correct 102 ms 7176 KB Output is correct
8 Correct 135 ms 7028 KB Output is correct
9 Correct 134 ms 7388 KB Output is correct
10 Correct 130 ms 6136 KB Output is correct
11 Correct 98 ms 7028 KB Output is correct
12 Correct 104 ms 7516 KB Output is correct
13 Correct 104 ms 7800 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 3 ms 504 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 504 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 127 ms 5484 KB Output is correct
23 Correct 127 ms 6136 KB Output is correct
24 Correct 131 ms 6776 KB Output is correct
25 Correct 122 ms 5752 KB Output is correct
26 Correct 132 ms 6520 KB Output is correct
27 Correct 102 ms 7032 KB Output is correct
28 Correct 102 ms 7176 KB Output is correct
29 Correct 135 ms 7028 KB Output is correct
30 Correct 134 ms 7388 KB Output is correct
31 Correct 130 ms 6136 KB Output is correct
32 Correct 98 ms 7028 KB Output is correct
33 Correct 104 ms 7516 KB Output is correct
34 Correct 104 ms 7800 KB Output is correct
35 Correct 129 ms 5572 KB Output is correct
36 Correct 134 ms 7128 KB Output is correct
37 Correct 136 ms 7800 KB Output is correct
38 Correct 137 ms 7672 KB Output is correct
39 Correct 135 ms 7544 KB Output is correct
40 Correct 137 ms 7676 KB Output is correct
41 Correct 135 ms 7528 KB Output is correct
42 Correct 132 ms 7568 KB Output is correct
43 Correct 133 ms 6904 KB Output is correct
44 Correct 136 ms 7288 KB Output is correct
45 Correct 132 ms 7108 KB Output is correct
46 Correct 136 ms 7800 KB Output is correct
47 Correct 106 ms 7708 KB Output is correct
48 Correct 104 ms 7800 KB Output is correct
49 Correct 114 ms 6904 KB Output is correct
50 Correct 101 ms 7544 KB Output is correct
51 Correct 104 ms 7672 KB Output is correct
52 Correct 103 ms 7544 KB Output is correct