oj.uz

답안 #242355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
242355 2020-06-27T09:27:01 Z michao Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 232 ms 16376 KB 
#include <bits/stdc++.h>
//#define ll long long int
#define int long long 
#define mp make_pair
#define pb push_back
#define ld long double
#define pii pair<int,int>
#define sz(x) (int)x.size()
#define piii pair<pii,pii>
#define precise cout<<fixed<<setprecision(10)
#define st first
#define nd second
#define ins insert
#define vi vector<int>
#define BOOST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
int n,q,s,t;
int ans=0;
const int MAX=1<<18;
int tree[2*MAX];
int tab[MAX];
int dp[MAX];
void update(int u,int v,int c)
{
	for (u+=MAX,v+=MAX;u<v;u>>=1,v>>=1)
	{
		if (u&1)tree[u++]+=c;
		if (v&1)tree[--v]+=c;
	}
}
 
int query(int u)
{
	int sum=0;
	for (u+=MAX;u>0;u>>=1)sum+=tree[u];
	return sum;
}
 
int32_t main()
{
  BOOST;
  cin>>n>>q>>s>>t;
  for (int i=0;i<=n;i++)cin>>tab[i],update(i,i+1,tab[i]);
  dp[0]=0;
  for (int i=1;i<=n;i++)
  {
  	if (tab[i]>tab[i-1])dp[i]=dp[i-1]-s*(tab[i]-tab[i-1]);
  	else dp[i]=dp[i-1]+t*(tab[i-1]-tab[i]);
  }
  ans=dp[n];
  for (int z=0;z<q;z++)
  {
  	int l,r,c;
  	cin>>l>>r>>c;
  	//cout<<"ZAWARTOSC "<<z<<"\n";
  	//for (int i=0;i<=n;i++)cout<<query(i)<<" ";
  	//cout<<"\n";
  	int prevl=query(l);
  	int prevr=query(r);
  	update(l,r+1,c);
  	int nowl=query(l);
  	int nowr=query(r);
  	int ilel=query(l-1);
  	int iler=query(r+1);
    int balans=0;
    // pierwsza czesc dla lewego;
    //if (z==2)cout<<"TERAZ "<<ilel<<" "<<prevl<<" "<<nowl<<"\n";
    if (ilel>=prevl)balans-=(ilel-prevl)*t;
    else balans+=(prevl-ilel)*s;
    if (ilel>=nowl)balans+=(ilel-nowl)*t;
    else balans-=(nowl-ilel)*s;
    // druga czesc dla prawego
    if (r!=n)
    {
    	 if (iler<=prevr)balans-=(prevr-iler)*t;
    	 else balans+=(iler-prevr)*s;
    	 if (iler<=nowr)balans+=(nowr-iler)*t;
    	 else balans-=(iler-nowr)*s;
    }
    ans+=balans;
  	cout<<ans<<"\n";
  }
  return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 7 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 688 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 13560 KB Output is correct
2 Correct 184 ms 14072 KB Output is correct
3 Correct 193 ms 14840 KB Output is correct
4 Correct 182 ms 14200 KB Output is correct
5 Correct 212 ms 15224 KB Output is correct
6 Correct 143 ms 12792 KB Output is correct
7 Correct 135 ms 12792 KB Output is correct
8 Correct 185 ms 15096 KB Output is correct
9 Correct 186 ms 15432 KB Output is correct
10 Correct 193 ms 14200 KB Output is correct
11 Correct 127 ms 12664 KB Output is correct
12 Correct 141 ms 13432 KB Output is correct
13 Correct 135 ms 13560 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 512 KB Output is correct
2 Correct 6 ms 640 KB Output is correct
3 Correct 6 ms 512 KB Output is correct
4 Correct 7 ms 640 KB Output is correct
5 Correct 6 ms 640 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 7 ms 512 KB Output is correct
10 Correct 6 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 688 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 7 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 172 ms 13560 KB Output is correct
23 Correct 184 ms 14072 KB Output is correct
24 Correct 193 ms 14840 KB Output is correct
25 Correct 182 ms 14200 KB Output is correct
26 Correct 212 ms 15224 KB Output is correct
27 Correct 143 ms 12792 KB Output is correct
28 Correct 135 ms 12792 KB Output is correct
29 Correct 185 ms 15096 KB Output is correct
30 Correct 186 ms 15432 KB Output is correct
31 Correct 193 ms 14200 KB Output is correct
32 Correct 127 ms 12664 KB Output is correct
33 Correct 141 ms 13432 KB Output is correct
34 Correct 135 ms 13560 KB Output is correct
35 Correct 225 ms 13764 KB Output is correct
36 Correct 210 ms 15096 KB Output is correct
37 Correct 230 ms 15864 KB Output is correct
38 Correct 232 ms 15736 KB Output is correct
39 Correct 219 ms 15736 KB Output is correct
40 Correct 214 ms 15736 KB Output is correct
41 Correct 227 ms 15612 KB Output is correct
42 Correct 222 ms 15736 KB Output is correct
43 Correct 229 ms 14968 KB Output is correct
44 Correct 219 ms 15224 KB Output is correct
45 Correct 215 ms 15352 KB Output is correct
46 Correct 218 ms 16376 KB Output is correct
47 Correct 147 ms 13560 KB Output is correct
48 Correct 137 ms 13304 KB Output is correct
49 Correct 207 ms 13944 KB Output is correct
50 Correct 134 ms 13176 KB Output is correct
51 Correct 139 ms 13560 KB Output is correct
52 Correct 143 ms 13432 KB Output is correct