oj.uz

Submission #561503

# Submission time Handle Problem Language Result Execution time Memory
561503 2022-05-13T03:00:38 Z Baytoro Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 106 ms 11596 KB 
#include <bits/stdc++.h>
using namespace std;
#define Baytoro_Mayrambekov void solve()
#define ios ios::sync_with_stdio(false); cin.tie(NULL);
#define pb push_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fr first
#define sc second
#define int long long
#define endl '\n'
const int INF=1e18;
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
int binpow(int a,int n){
	if(n==0)
		return 1;
	if(n%2==1)
		return binpow(a, n-1)*a;
	else{
		int b=binpow(a, n/2);
		return b*b;
	}
}

int a,b,c,n,m,i,j,k,t,s,q,x,y,cnt=0,sum=0,res=0;
int calc(int h){
	if(h>=0)
		return -h*s;
	return -h*t;
}
Baytoro_Mayrambekov{
	cin>>n>>q>>s>>t;
	vector<int> vec(n);
	vec[0]=0;
	cin>>a;
	for(i=0;i<n;i++){
		cin>>x;
		vec[i]=x-a;
		res+=calc(vec[i]);
		a=x;
	}
	while(q--){
		int l,r;
		cin>>l>>r>>x;
		l--;
		res-=calc(vec[l]);
		vec[l]+=x;
		res+=calc(vec[l]);
		if(r<n){
			res-=calc(vec[r]);
			vec[r]-=x;
			res+=calc(vec[r]);
		}
		cout<<res<<endl;
	}
}
main(){
	ios;
	int T=1;
	//cin>>T;
	while(T--){
		solve();
	}
}

Compilation message

foehn_phenomena.cpp:60:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   60 | main(){
      | ^~~~
foehn_phenomena.cpp: In function 'void fopn(std::string)':
foehn_phenomena.cpp:14:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foehn_phenomena.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 100 ms 8728 KB Output is correct
2 Correct 96 ms 9364 KB Output is correct
3 Correct 92 ms 9928 KB Output is correct
4 Correct 91 ms 9264 KB Output is correct
5 Correct 95 ms 10368 KB Output is correct
6 Correct 79 ms 9476 KB Output is correct
7 Correct 86 ms 9416 KB Output is correct
8 Correct 97 ms 10192 KB Output is correct
9 Correct 93 ms 10572 KB Output is correct
10 Correct 93 ms 9304 KB Output is correct
11 Correct 84 ms 9292 KB Output is correct
12 Correct 79 ms 10060 KB Output is correct
13 Correct 81 ms 10256 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 396 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 388 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 100 ms 8728 KB Output is correct
23 Correct 96 ms 9364 KB Output is correct
24 Correct 92 ms 9928 KB Output is correct
25 Correct 91 ms 9264 KB Output is correct
26 Correct 95 ms 10368 KB Output is correct
27 Correct 79 ms 9476 KB Output is correct
28 Correct 86 ms 9416 KB Output is correct
29 Correct 97 ms 10192 KB Output is correct
30 Correct 93 ms 10572 KB Output is correct
31 Correct 93 ms 9304 KB Output is correct
32 Correct 84 ms 9292 KB Output is correct
33 Correct 79 ms 10060 KB Output is correct
34 Correct 81 ms 10256 KB Output is correct
35 Correct 105 ms 8876 KB Output is correct
36 Correct 96 ms 10196 KB Output is correct
37 Correct 95 ms 11160 KB Output is correct
38 Correct 100 ms 10828 KB Output is correct
39 Correct 94 ms 10836 KB Output is correct
40 Correct 100 ms 11076 KB Output is correct
41 Correct 98 ms 10796 KB Output is correct
42 Correct 99 ms 10928 KB Output is correct
43 Correct 97 ms 10088 KB Output is correct
44 Correct 106 ms 10572 KB Output is correct
45 Correct 94 ms 10444 KB Output is correct
46 Correct 95 ms 11596 KB Output is correct
47 Correct 81 ms 10156 KB Output is correct
48 Correct 91 ms 10056 KB Output is correct
49 Correct 87 ms 9176 KB Output is correct
50 Correct 84 ms 9948 KB Output is correct
51 Correct 82 ms 10316 KB Output is correct
52 Correct 79 ms 10064 KB Output is correct