oj.uz

Submission #245292

# Submission time Handle Problem Language Result Execution time Memory
245292 2020-07-05T23:52:04 Z kimbj0709 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 872 ms 18540 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 200050
vector<int> seg(maxn*4,0),lazy(maxn*4,0);
vector<int> vect1;
void build(int node,int start,int end){
  if(start==end){
    seg[node] = vect1[start];
    return;
  }
  int mid = (start+end)/2;
  build(node*2+1,start,mid);
  build(node*2+2,mid+1,end);
}
void update(int node,int start,int end,int rangemin,int rangemax,int val){
    if(lazy[node]!=0){
      seg[node] += lazy[node];
      if(start!=end){
        lazy[node*2+1] += lazy[node];
        lazy[node*2+2] += lazy[node];
      }
      lazy[node] = 0;
    }
    if(start>rangemax||end<rangemin){
        return;
    }
    else if(start>=rangemin&&end<=rangemax){
        seg[node] += val;
        if(start!=end){
          lazy[node*2+1] += val;
          lazy[node*2+2] += val;
        }
        return;
    }
    int mid = (start+end)/2;
    update(node*2+1,start,mid,rangemin,rangemax,val);
    update(node*2+2,mid+1,end,rangemin,rangemax,val);
    seg[node] = seg[node*2+1]+seg[node*2+2];

}
int query(int node,int start,int end,int pos){
    if(lazy[node]!=0){
      seg[node] += lazy[node];
      if(start!=end){
        lazy[node*2+1] += lazy[node];
        lazy[node*2+2] += lazy[node];
      }
      lazy[node] = 0;
    }
    if(start==end&&start==pos){
      return seg[node];
    }
    int mid = (start+end)/2;
    if(pos<=mid){
      return query(node*2+1,start,mid,pos);
    }
    else{
      return query(node*2+2,mid+1,end,pos);
    }
}
int32_t main() {
  ios::sync_with_stdio(0);
  int no_of_input,no_of_query,up,down;
  int input,input1,input2,input3;
  cin >> no_of_input >> no_of_query >> up >> down;
  for(int i=0;i<=no_of_input;i++){
    cin >> input;
    vect1.push_back(input);
  }
  int cntup = 0;
  int cntdown = 0;
  for(int i=1;i<vect1.size();i++){
    if(vect1[i]>vect1[i-1]){
      cntup += abs(vect1[i]-vect1[i-1]);
    }
    else{
      cntdown += abs(vect1[i]-vect1[i-1]);
    }
  }
  build(0,0,vect1.size()-1);
  //cout << cntup << ' ' << cntdown << "\n";
  for(int i=0;i<no_of_query;i++){
    cin >> input1 >> input2 >> input3;
    //input1--,input2--;
    if(input1!=0){
      int before = query(0,0,vect1.size()-1,input1-1);
      int curr = query(0,0,vect1.size()-1,input1);
      if(curr>before){
        cntup -= abs(curr-before);
      }
      else{
        cntdown -= abs(curr-before);
      }
      curr += input3;
      if(curr>before){
        cntup += abs(curr-before);
      }
      else{
        cntdown += abs(curr-before);
      }
    }
    //cout << cntup << " " << cntdown << "---\n";
    if(input2!=vect1.size()-1){
      int next = query(0,0,vect1.size()-1,input2+1);
      int curr = query(0,0,vect1.size()-1,input2);
      if(next>curr){
        cntup -= abs(next-curr);
      }
      else{
        cntdown -= abs(next-curr);
      }
      curr += input3;
      if(next>curr){
        cntup += abs(next-curr);
      }
      else{
        cntdown += abs(next-curr);
      }
    }
    //cout << cntup << " " << cntdown << "--\n";
    update(0,0,vect1.size()-1,input1,input2,input3);
    cout << cntdown*down-cntup*up << "\n";
  }
}

Compilation message

foehn_phenomena.cpp: In function 'int32_t main()':
foehn_phenomena.cpp:73:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1;i<vect1.size();i++){
               ~^~~~~~~~~~~~~
foehn_phenomena.cpp:104:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(input2!=vect1.size()-1){
        ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 844 ms 16076 KB Output is correct
2 Correct 838 ms 16728 KB Output is correct
3 Correct 856 ms 17260 KB Output is correct
4 Correct 841 ms 16564 KB Output is correct
5 Correct 845 ms 17260 KB Output is correct
6 Correct 584 ms 17644 KB Output is correct
7 Correct 557 ms 17592 KB Output is correct
8 Correct 754 ms 17516 KB Output is correct
9 Correct 750 ms 17900 KB Output is correct
10 Correct 751 ms 16684 KB Output is correct
11 Correct 620 ms 17620 KB Output is correct
12 Correct 557 ms 18028 KB Output is correct
13 Correct 567 ms 18408 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 12928 KB Output is correct
2 Correct 17 ms 12928 KB Output is correct
3 Correct 18 ms 12928 KB Output is correct
4 Correct 19 ms 12928 KB Output is correct
5 Correct 18 ms 12928 KB Output is correct
6 Correct 17 ms 12928 KB Output is correct
7 Correct 18 ms 12928 KB Output is correct
8 Correct 18 ms 12928 KB Output is correct
9 Correct 17 ms 12928 KB Output is correct
10 Correct 18 ms 12928 KB Output is correct
11 Correct 20 ms 12928 KB Output is correct
12 Correct 18 ms 13056 KB Output is correct
13 Correct 17 ms 12928 KB Output is correct
14 Correct 16 ms 12928 KB Output is correct
15 Correct 18 ms 12928 KB Output is correct
16 Correct 17 ms 12928 KB Output is correct
17 Correct 17 ms 12928 KB Output is correct
18 Correct 17 ms 12928 KB Output is correct
19 Correct 12 ms 12800 KB Output is correct
20 Correct 12 ms 12928 KB Output is correct
21 Correct 11 ms 12928 KB Output is correct
22 Correct 844 ms 16076 KB Output is correct
23 Correct 838 ms 16728 KB Output is correct
24 Correct 856 ms 17260 KB Output is correct
25 Correct 841 ms 16564 KB Output is correct
26 Correct 845 ms 17260 KB Output is correct
27 Correct 584 ms 17644 KB Output is correct
28 Correct 557 ms 17592 KB Output is correct
29 Correct 754 ms 17516 KB Output is correct
30 Correct 750 ms 17900 KB Output is correct
31 Correct 751 ms 16684 KB Output is correct
32 Correct 620 ms 17620 KB Output is correct
33 Correct 557 ms 18028 KB Output is correct
34 Correct 567 ms 18408 KB Output is correct
35 Correct 861 ms 16340 KB Output is correct
36 Correct 847 ms 17772 KB Output is correct
37 Correct 827 ms 18540 KB Output is correct
38 Correct 864 ms 18484 KB Output is correct
39 Correct 862 ms 18284 KB Output is correct
40 Correct 859 ms 18356 KB Output is correct
41 Correct 852 ms 18028 KB Output is correct
42 Correct 854 ms 18420 KB Output is correct
43 Correct 850 ms 17516 KB Output is correct
44 Correct 822 ms 17900 KB Output is correct
45 Correct 851 ms 17772 KB Output is correct
46 Correct 872 ms 18352 KB Output is correct
47 Correct 601 ms 18356 KB Output is correct
48 Correct 569 ms 18540 KB Output is correct
49 Correct 849 ms 17644 KB Output is correct
50 Correct 617 ms 18412 KB Output is correct
51 Correct 584 ms 18408 KB Output is correct
52 Correct 666 ms 18284 KB Output is correct