oj.uz

답안 #370110

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
370110 2021-02-23T09:38:43 Z silverfish Sjeckanje (COCI21_sjeckanje) C++14
0 / 110
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const ll INF = 1e18 + 7, N = 2e5;

ll a[N];
int n, q; 

bool cmp(ll a, ll b){
	return a < b;
}

ll calc(){
	ll ret = 0, fst = a[0];
	ll mn = min(a[0], a[1]);
	ll mx = max(a[0], a[1]);
	bool rel = cmp(a[0], a[1]);
	for(int i = 2; i < n; ++i){

		if(cmp(a[i-1], a[i]) == rel){
			mn = min(mn, a[i]);
			mx = max(mx, a[i]);

		}else{

			if(mx-mn){
				ret += mx-mn;
				mn = a[i];
				mx = a[i];
			}

			if(a[i-1] == a[i-2]){
				mn = min(mn, a[i-1]);
				mx = max(mx, a[i-1]);
			}

			if(i<n-1) rel = cmp(a[i], a[i+1]);
		}
	}
	ret += mx-mn;
	return ret;
}

int main(void)
{
	FAST;
	cin >> n >> q;
	for(int i = 0; i < n; ++i) cin >> a[i];

	while(q--){
		ll v;
		int l, r; cin >> l >> r >> v;
		--l;
		for(int i = l; i < r; ++i) a[i] += v;
//		for(int i = 0; i < n; ++i) cout << a[i] << ' ';
//		cout << '\n';
		cout << calc() << '\n';
	}

	return 0;
}

Compilation message

Main.cpp: In function 'll calc()':
Main.cpp:61:14: warning: unused variable 'fst' [-Wunused-variable]
   61 |  ll ret = 0, fst = a[0];
      |              ^~~

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 364 KB Output isn't correct
2 Halted 0 ms 0 KB -