oj.uz

Submission #58919

# Submission time Handle Problem Language Result Execution time Memory
58919 2018-07-19T20:06:22 Z TadijaSebez Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 363 ms 52080 KB 
#include <stdio.h>
#define ll long long
const int N=200050;
struct BIT
{
	ll sum[N],a[N];
	void init(){ for(int i=0;i<N;i++) sum[i]=a[i]=0;}
	void Set1(int i, ll x){ int j=i;for(;i<N;i+=i&-i) sum[i]+=x-a[j];a[j]=x;}
	void Set2(int i, ll x){ for(i++;i<N;i+=i&-i) sum[i]+=x;}
	void Set2(int l, int r, ll x){ Set2(l,x);Set2(r+1,-x);}
	ll Get1(int i){ ll ret=0;for(;i;i-=i&-i) ret+=sum[i];return ret;}
	ll Get2(int i){ return Get1(i+1);}
	ll Get1(){ return Get1(N-1);}
} BIT1,BIT2;
int a[N],s,t;
ll abs(ll x){ return x>0?x:-x;}
ll Get(ll x, ll y)
{
	return (ll)(x>y?-s:t)*abs(x-y);
}
int main()
{
	int n,q,i;BIT1.init();BIT2.init();
	scanf("%i %i %i %i",&n,&q,&s,&t);
	for(i=0;i<=n;i++) scanf("%i",&a[i]),BIT2.Set2(i,i,a[i]);
	for(i=1;i<=n;i++) BIT1.Set1(i,Get(a[i],a[i-1]));
	int l,r,x;
	while(q--)
	{
		scanf("%i %i %i",&l,&r,&x);
		BIT2.Set2(l,r,x);
		BIT1.Set1(l,Get(BIT2.Get2(l),BIT2.Get2(l-1)));
		if(r!=n) BIT1.Set1(r+1,Get(BIT2.Get2(r+1),BIT2.Get2(r)));
		printf("%lld\n",BIT1.Get1());
	}
	return 0;
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%i %i %i %i",&n,&q,&s,&t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:25:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=0;i<=n;i++) scanf("%i",&a[i]),BIT2.Set2(i,i,a[i]);
                    ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%i %i %i",&l,&r,&x);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6648 KB Output is correct
2 Correct 12 ms 6804 KB Output is correct
3 Correct 9 ms 6804 KB Output is correct
4 Correct 9 ms 7040 KB Output is correct
5 Correct 9 ms 7040 KB Output is correct
6 Correct 10 ms 7060 KB Output is correct
7 Correct 12 ms 7148 KB Output is correct
8 Correct 12 ms 7188 KB Output is correct
9 Correct 11 ms 7316 KB Output is correct
10 Correct 12 ms 7316 KB Output is correct
11 Correct 11 ms 7340 KB Output is correct
12 Correct 13 ms 7392 KB Output is correct
13 Correct 10 ms 7448 KB Output is correct
14 Correct 9 ms 7620 KB Output is correct
15 Correct 8 ms 7620 KB Output is correct
16 Correct 12 ms 7620 KB Output is correct
17 Correct 9 ms 7716 KB Output is correct
18 Correct 9 ms 7760 KB Output is correct
19 Correct 7 ms 7760 KB Output is correct
20 Correct 9 ms 7836 KB Output is correct
21 Correct 9 ms 7836 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 15300 KB Output is correct
2 Correct 255 ms 21336 KB Output is correct
3 Correct 239 ms 27340 KB Output is correct
4 Correct 326 ms 32232 KB Output is correct
5 Correct 289 ms 39156 KB Output is correct
6 Correct 212 ms 44040 KB Output is correct
7 Correct 273 ms 47012 KB Output is correct
8 Correct 282 ms 47012 KB Output is correct
9 Correct 305 ms 47356 KB Output is correct
10 Correct 258 ms 47356 KB Output is correct
11 Correct 169 ms 47356 KB Output is correct
12 Correct 166 ms 47448 KB Output is correct
13 Correct 188 ms 47800 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 6648 KB Output is correct
2 Correct 12 ms 6804 KB Output is correct
3 Correct 9 ms 6804 KB Output is correct
4 Correct 9 ms 7040 KB Output is correct
5 Correct 9 ms 7040 KB Output is correct
6 Correct 10 ms 7060 KB Output is correct
7 Correct 12 ms 7148 KB Output is correct
8 Correct 12 ms 7188 KB Output is correct
9 Correct 11 ms 7316 KB Output is correct
10 Correct 12 ms 7316 KB Output is correct
11 Correct 11 ms 7340 KB Output is correct
12 Correct 13 ms 7392 KB Output is correct
13 Correct 10 ms 7448 KB Output is correct
14 Correct 9 ms 7620 KB Output is correct
15 Correct 8 ms 7620 KB Output is correct
16 Correct 12 ms 7620 KB Output is correct
17 Correct 9 ms 7716 KB Output is correct
18 Correct 9 ms 7760 KB Output is correct
19 Correct 7 ms 7760 KB Output is correct
20 Correct 9 ms 7836 KB Output is correct
21 Correct 9 ms 7836 KB Output is correct
22 Correct 239 ms 15300 KB Output is correct
23 Correct 255 ms 21336 KB Output is correct
24 Correct 239 ms 27340 KB Output is correct
25 Correct 326 ms 32232 KB Output is correct
26 Correct 289 ms 39156 KB Output is correct
27 Correct 212 ms 44040 KB Output is correct
28 Correct 273 ms 47012 KB Output is correct
29 Correct 282 ms 47012 KB Output is correct
30 Correct 305 ms 47356 KB Output is correct
31 Correct 258 ms 47356 KB Output is correct
32 Correct 169 ms 47356 KB Output is correct
33 Correct 166 ms 47448 KB Output is correct
34 Correct 188 ms 47800 KB Output is correct
35 Correct 305 ms 47800 KB Output is correct
36 Correct 248 ms 47800 KB Output is correct
37 Correct 260 ms 47800 KB Output is correct
38 Correct 302 ms 47800 KB Output is correct
39 Correct 320 ms 47800 KB Output is correct
40 Correct 307 ms 47800 KB Output is correct
41 Correct 311 ms 47800 KB Output is correct
42 Correct 313 ms 47800 KB Output is correct
43 Correct 316 ms 47800 KB Output is correct
44 Correct 312 ms 47800 KB Output is correct
45 Correct 363 ms 47800 KB Output is correct
46 Correct 325 ms 47800 KB Output is correct
47 Correct 247 ms 48536 KB Output is correct
48 Correct 212 ms 52080 KB Output is correct
49 Correct 314 ms 52080 KB Output is correct
50 Correct 191 ms 52080 KB Output is correct
51 Correct 246 ms 52080 KB Output is correct
52 Correct 243 ms 52080 KB Output is correct