제출 #561503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
561503		Baytoro	Foehn Phenomena (JOI17_foehn_phenomena)	C++17	100 / 100	106 ms	11596 KiB

foehn_phenomena

#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();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 30
• Subtask 2: 10 / 10
• Subtask 3: 60 / 60