oj.uz

Submission #243960

# Submission time Handle Problem Language Result Execution time Memory
243960 2020-07-02T11:50:19 Z uacoder123 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 867 ms 30584 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef long long int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
pair<ii,ii> segt[8*100000];
lli lazy[8*100000];
void up(lli node,lli l,lli r,lli s,lli e,lli val)
{
  if(lazy[node]!=0)
  {
    segt[node].F.F+=lazy[node];
    segt[node].F.S+=lazy[node];
    if(l!=r)
    {
      lazy[2*node+1]+=lazy[node];
      lazy[2*node+2]+=lazy[node];
    }
    lazy[node]=0;
  }
  if(l>e||r<s)
    return;
  if(l>=s&&r<=e)
  {
    segt[node].F.F+=val;
    segt[node].F.S+=val;
    if(l!=r)
    {
      lazy[2*node+1]+=val;
      lazy[2*node+2]+=val;
    }
    return;
  }
  lli m=(l+r)/2;
  up(2*node+1,l,m,s,e,val);
  up(2*node+2,m+1,r,s,e,val);
  segt[node].F.F=segt[2*node+1].F.F;
  segt[node].F.S=segt[2*node+2].F.S;
  segt[node].S.F=segt[2*node+1].S.F+segt[2*node+2].S.F;
  segt[node].S.S=segt[2*node+1].S.S+segt[2*node+2].S.S;
  if(segt[2*node+1].F.S<=segt[2*node+2].F.F)
    segt[node].S.F+=segt[2*node+2].F.F-segt[2*node+1].F.S;
  else
    segt[node].S.S+=segt[2*node+1].F.S-segt[2*node+2].F.F;
}
ii qu(lli node,lli l,lli r,lli s,lli e)
{
  if(l>e||r<s)
    return(mp(0*1LL,0*1LL));
  if(lazy[node]!=0)
  {
    segt[node].F.F+=lazy[node];
    segt[node].F.S+=lazy[node];
    if(l!=r)
    {
      lazy[2*node+1]+=lazy[node];
      lazy[2*node+2]+=lazy[node];
    }
    lazy[node]=0;
  }
  if(l>=s&&r<=e)
    return(segt[node].S);
  lli m=(l+r)/2;
  ii q1=qu(2*node+1,l,m,s,e),q2=qu(2*node+2,m+1,r,s,e);
  return(mp(q1.F+q2.F,q2.S+q1.S));
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  lli test=1;
  for(;test>0;--test)
  {
    lli n,q,s,t,fi,se,th;
    cin>>n>>q>>s>>t;
    n++;
    for(lli i=0;i<n;++i)
    {
      cin>>fi;
      up(0,0,n-1,i,i,fi);
    }
    for(lli i=0;i<q;++i)
    {
      cin>>fi>>se>>th;
      up(0,0,n-1,fi,se,th);
      ii ans=qu(0,0,n-1,0,n-1);
      cout<<-ans.F*s+ans.S*t<<endl;
    }
  }
  return(0);
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 807 ms 27896 KB Output is correct
2 Correct 832 ms 28412 KB Output is correct
3 Correct 816 ms 29124 KB Output is correct
4 Correct 818 ms 28396 KB Output is correct
5 Correct 787 ms 29560 KB Output is correct
6 Correct 589 ms 24440 KB Output is correct
7 Correct 604 ms 24440 KB Output is correct
8 Correct 773 ms 29560 KB Output is correct
9 Correct 782 ms 29692 KB Output is correct
10 Correct 762 ms 28408 KB Output is correct
11 Correct 594 ms 24440 KB Output is correct
12 Correct 598 ms 25336 KB Output is correct
13 Correct 579 ms 25208 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 640 KB Output is correct
2 Correct 15 ms 640 KB Output is correct
3 Correct 11 ms 640 KB Output is correct
4 Correct 10 ms 640 KB Output is correct
5 Correct 10 ms 640 KB Output is correct
6 Correct 11 ms 640 KB Output is correct
7 Correct 10 ms 640 KB Output is correct
8 Correct 11 ms 640 KB Output is correct
9 Correct 13 ms 640 KB Output is correct
10 Correct 13 ms 640 KB Output is correct
11 Correct 11 ms 768 KB Output is correct
12 Correct 13 ms 640 KB Output is correct
13 Correct 10 ms 512 KB Output is correct
14 Correct 10 ms 512 KB Output is correct
15 Correct 11 ms 640 KB Output is correct
16 Correct 10 ms 640 KB Output is correct
17 Correct 10 ms 512 KB Output is correct
18 Correct 10 ms 640 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 807 ms 27896 KB Output is correct
23 Correct 832 ms 28412 KB Output is correct
24 Correct 816 ms 29124 KB Output is correct
25 Correct 818 ms 28396 KB Output is correct
26 Correct 787 ms 29560 KB Output is correct
27 Correct 589 ms 24440 KB Output is correct
28 Correct 604 ms 24440 KB Output is correct
29 Correct 773 ms 29560 KB Output is correct
30 Correct 782 ms 29692 KB Output is correct
31 Correct 762 ms 28408 KB Output is correct
32 Correct 594 ms 24440 KB Output is correct
33 Correct 598 ms 25336 KB Output is correct
34 Correct 579 ms 25208 KB Output is correct
35 Correct 853 ms 27928 KB Output is correct
36 Correct 852 ms 29432 KB Output is correct
37 Correct 861 ms 30168 KB Output is correct
38 Correct 828 ms 29816 KB Output is correct
39 Correct 827 ms 30072 KB Output is correct
40 Correct 834 ms 29996 KB Output is correct
41 Correct 848 ms 29844 KB Output is correct
42 Correct 825 ms 30176 KB Output is correct
43 Correct 862 ms 29176 KB Output is correct
44 Correct 867 ms 29584 KB Output is correct
45 Correct 811 ms 29720 KB Output is correct
46 Correct 816 ms 30584 KB Output is correct
47 Correct 601 ms 25184 KB Output is correct
48 Correct 579 ms 25080 KB Output is correct
49 Correct 788 ms 28160 KB Output is correct
50 Correct 591 ms 24960 KB Output is correct
51 Correct 582 ms 25464 KB Output is correct
52 Correct 619 ms 25216 KB Output is correct