oj.uz

Submission #36162

# Submission time Handle Problem Language Result Execution time Memory
36162 2017-12-06T05:26:40 Z lequangtan Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 236 ms 5980 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll s1,s2;
ll dif[300001];
ll get(ll t)
{
	if(t>0)return -s1*t;
	else return -s2*t;
}
int main()
{
	//freopen ("WIND.INP","r",stdin);
	//freopen ("WIND.OUT","w",stdout);
	int num,query;
	scanf("%d%d%lld%lld",&num,&query,&s1,&s2);
	vector<int>v;
	for(int i=0;i<=num;i++)
	{
		int z;
		scanf("%d",&z);
		v.push_back(z);
	}
	ll ans=0;
	for(int i=0;i<num;i++)
	{
		dif[i]=v[i+1]-v[i];
		ans+=get(dif[i]);
	}
	for(int i=0;i<query;i++)
	{
		int za,zb,zc;
		scanf("%d%d%d",&za,&zb,&zc);
		ans-=get(dif[za-1]);
		dif[za-1]+=zc;
		ans+=get(dif[za-1]);
		if(zb!=num)
		{
			ans-=get(dif[zb]);
			dif[zb]-=zc;
			ans+=get(dif[zb]);
		}
		printf("%lld\n",ans);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:16:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%lld%lld",&num,&query,&s1,&s2);
                                           ^
foehn_phenomena.cpp:21:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&z);
                 ^
foehn_phenomena.cpp:33:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&za,&zb,&zc);
                              ^

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 186 ms 5980 KB Output is correct
2 Correct 173 ms 5980 KB Output is correct
3 Correct 176 ms 5980 KB Output is correct
4 Correct 193 ms 5980 KB Output is correct
5 Correct 186 ms 5980 KB Output is correct
6 Correct 149 ms 5980 KB Output is correct
7 Correct 126 ms 5980 KB Output is correct
8 Correct 216 ms 5980 KB Output is correct
9 Correct 226 ms 5980 KB Output is correct
10 Correct 209 ms 5980 KB Output is correct
11 Correct 139 ms 5980 KB Output is correct
12 Correct 169 ms 5980 KB Output is correct
13 Correct 143 ms 5980 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 4360 KB Output is correct
2 Correct 0 ms 4360 KB Output is correct
3 Correct 0 ms 4360 KB Output is correct
4 Correct 0 ms 4360 KB Output is correct
5 Correct 0 ms 4360 KB Output is correct
6 Correct 0 ms 4360 KB Output is correct
7 Correct 3 ms 4360 KB Output is correct
8 Correct 0 ms 4360 KB Output is correct
9 Correct 0 ms 4360 KB Output is correct
10 Correct 3 ms 4360 KB Output is correct
11 Correct 0 ms 4360 KB Output is correct
12 Correct 0 ms 4360 KB Output is correct
13 Correct 0 ms 4360 KB Output is correct
14 Correct 3 ms 4360 KB Output is correct
15 Correct 0 ms 4360 KB Output is correct
16 Correct 0 ms 4360 KB Output is correct
17 Correct 0 ms 4360 KB Output is correct
18 Correct 0 ms 4360 KB Output is correct
19 Correct 0 ms 4360 KB Output is correct
20 Correct 0 ms 4360 KB Output is correct
21 Correct 0 ms 4360 KB Output is correct
22 Correct 186 ms 5980 KB Output is correct
23 Correct 173 ms 5980 KB Output is correct
24 Correct 176 ms 5980 KB Output is correct
25 Correct 193 ms 5980 KB Output is correct
26 Correct 186 ms 5980 KB Output is correct
27 Correct 149 ms 5980 KB Output is correct
28 Correct 126 ms 5980 KB Output is correct
29 Correct 216 ms 5980 KB Output is correct
30 Correct 226 ms 5980 KB Output is correct
31 Correct 209 ms 5980 KB Output is correct
32 Correct 139 ms 5980 KB Output is correct
33 Correct 169 ms 5980 KB Output is correct
34 Correct 143 ms 5980 KB Output is correct
35 Correct 216 ms 5980 KB Output is correct
36 Correct 206 ms 5980 KB Output is correct
37 Correct 206 ms 5980 KB Output is correct
38 Correct 236 ms 5980 KB Output is correct
39 Correct 186 ms 5980 KB Output is correct
40 Correct 213 ms 5980 KB Output is correct
41 Correct 173 ms 5980 KB Output is correct
42 Correct 223 ms 5980 KB Output is correct
43 Correct 203 ms 5980 KB Output is correct
44 Correct 216 ms 5980 KB Output is correct
45 Correct 193 ms 5980 KB Output is correct
46 Correct 203 ms 5980 KB Output is correct
47 Correct 119 ms 5980 KB Output is correct
48 Correct 173 ms 5980 KB Output is correct
49 Correct 163 ms 5980 KB Output is correct
50 Correct 123 ms 5980 KB Output is correct
51 Correct 133 ms 5980 KB Output is correct
52 Correct 123 ms 5980 KB Output is correct