oj.uz

Submission #129292

# Submission time Handle Problem Language Result Execution time Memory
129292 2019-07-12T02:18:02 Z josefu_ Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 194 ms 7288 KB 
#define SuC_VaT              Doc_code_ban_khac
#define Nhan_cach_bang_0     Doc_code_ban_khac

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
#define int ll
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll, pair<ll,ll> > iii;

const int kn = 2e5 + 5, N = 1e5+5;
const ll mod = 1e9 + 7, mod2 = 1e9+9;
const ll base = 31, base1 = 37;

#define x first
#define y second
#define lwb lower_bound
#define upb upper_bound

//#define pb push_back
//#define popb pop_back
//#define pf push_front
//#define popf pop_front
//
//#define log2(X) (31-__builtin_clz(X))
//#define log2ll(X) (63-__builtin_clzll(X))
//#define numbit(X) __builtin_popcount(X)
//#define numbitll(X) __builtin_popcountll(X)

#define ms(val,a) memset(a,val,sizeof(a))

#define ff(i,n) for(int i=1;i<=n;i++)
#define _ff(i,n) for(int i=n;i>=1;i--)
#define f(i,a,b) for(int i = a; i <=b; i++)
#define _f(i,a,b) for(int i = b; i>=a;i--)

#define In(X) freopen(X,"r",stdin)
#define Out(X) freopen(X,"w",stdout)

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

int n, q, s , t;
int a[kn], cur;
int dif[kn];

void solve(int l, int r, int X)
{
	cur -= (dif[l]<0) ? (-t*dif[l]) : (-s*dif[l]);
	if(r<n) cur-= (dif[r+1]<0) ? (-t*dif[r+1]) : (-s*dif[r+1]);
	dif[l] += X; dif[r+1] -= X;
	cur += (dif[l]<0) ? (-t*dif[l]) : (-s*dif[l]);
	if(r<n) cur += (dif[r+1]<0) ? (-t*dif[r+1]) : (-s*dif[r+1]);
}

signed main()
{
	scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
	scanf("%lld",&a[0]);
	ff(i,n)
	{
		scanf("%lld",&a[i]);
		dif[i] = a[i] - a[i-1];
		cur += (dif[i]<0) ? (-t*dif[i]) : (-s*dif[i]);
	}
	//cout << cur << endl;
	while(q--)
	{
		int l, r, X;
		scanf("%lld %lld %lld", &l, &r, &X);
		solve(l,r,X);
		printf("%lld\n",cur);
	}
}

Compilation message

foehn_phenomena.cpp: In function 'int main()':
foehn_phenomena.cpp:60:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld %lld %lld %lld",&n,&q,&s,&t);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&a[0]);
  ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&a[i]);
   ~~~~~^~~~~~~~~~~~~~
foehn_phenomena.cpp:72:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld", &l, &r, &X);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 4844 KB Output is correct
2 Correct 160 ms 5644 KB Output is correct
3 Correct 174 ms 6056 KB Output is correct
4 Correct 143 ms 5368 KB Output is correct
5 Correct 147 ms 6008 KB Output is correct
6 Correct 131 ms 6440 KB Output is correct
7 Correct 128 ms 6392 KB Output is correct
8 Correct 167 ms 6572 KB Output is correct
9 Correct 160 ms 6796 KB Output is correct
10 Correct 157 ms 5484 KB Output is correct
11 Correct 113 ms 6392 KB Output is correct
12 Correct 120 ms 6776 KB Output is correct
13 Correct 122 ms 7288 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 4 ms 504 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 4 ms 428 KB Output is correct
11 Correct 3 ms 380 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 376 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 157 ms 4844 KB Output is correct
23 Correct 160 ms 5644 KB Output is correct
24 Correct 174 ms 6056 KB Output is correct
25 Correct 143 ms 5368 KB Output is correct
26 Correct 147 ms 6008 KB Output is correct
27 Correct 131 ms 6440 KB Output is correct
28 Correct 128 ms 6392 KB Output is correct
29 Correct 167 ms 6572 KB Output is correct
30 Correct 160 ms 6796 KB Output is correct
31 Correct 157 ms 5484 KB Output is correct
32 Correct 113 ms 6392 KB Output is correct
33 Correct 120 ms 6776 KB Output is correct
34 Correct 122 ms 7288 KB Output is correct
35 Correct 168 ms 5112 KB Output is correct
36 Correct 194 ms 6380 KB Output is correct
37 Correct 170 ms 7280 KB Output is correct
38 Correct 175 ms 7160 KB Output is correct
39 Correct 165 ms 7184 KB Output is correct
40 Correct 165 ms 7132 KB Output is correct
41 Correct 171 ms 6896 KB Output is correct
42 Correct 163 ms 7032 KB Output is correct
43 Correct 162 ms 6264 KB Output is correct
44 Correct 161 ms 6648 KB Output is correct
45 Correct 145 ms 6520 KB Output is correct
46 Correct 150 ms 7048 KB Output is correct
47 Correct 130 ms 7116 KB Output is correct
48 Correct 128 ms 7288 KB Output is correct
49 Correct 150 ms 6384 KB Output is correct
50 Correct 114 ms 7032 KB Output is correct
51 Correct 121 ms 7032 KB Output is correct
52 Correct 122 ms 7032 KB Output is correct