제출 #47891

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
47891		Mamnoon_Siam	Sterilizing Spray (JOI15_sterilizing)	C++17	100 / 100	409 ms	70116 KiB

sterilizing

//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>
using namespace std;

#define debug(s) cout<< #s <<" = "<< s <<endl
#define all(v) (v).begin(), (v).end()
#define KeepUnique(v) (v).erase( unique(all(v)), v.end() )
#define MEMSET(a,val) memset(a, val, sizeof a)
#define PB push_back
#define endl '\n'

inline int myrand(int l, int r) {
	int ret = rand(); ret <<= 15; ret ^= rand();
	if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
	return ret;
}
template <typename F, typename S>
ostream& operator << (ostream& os, const pair< F, S>& p) {
    return os<<"(" <<p.first<<", "<<p.second<<")"; }

typedef pair<int, int> ii;
template<typename T> using min_pq =
	priority_queue<T, vector<T>, greater<T> >;

//int dx[] = {-1, +0, +1, +0};
//int dy[] = {+0, +1, +0, -1};

typedef long long ll;

const int maxn = 100010;

int n, q, k;
int a[maxn], mx[maxn * 4];
ll t[maxn * 4];

void replace(int u, int b, int e, int p, int v) {
	if(b > p or e < p) return;
	if(b == e) return void(t[u] = mx[u] = a[p] = v);
	int mid = b + e >> 1;
	replace(u << 1, b, mid, p, v);
	replace(u << 1 | 1, mid + 1, e, p, v);
	t[u] = t[u << 1] + t[u << 1 | 1];
	mx[u] = max(mx[u << 1], mx[u << 1 | 1]);
}

void update(int u, int b, int e, int i, int j) {
	if(b > j or e < i) return;
	if(mx[u] == 0) return;
	if(b == e) return void(t[u] = mx[u] = a[b] /= k);
	int mid = b + e >> 1;
	update(u << 1, b, mid, i, j);
	update(u << 1 | 1, mid + 1, e, i, j);
	t[u] = t[u << 1] + t[u << 1 | 1];
	mx[u] = max(mx[u << 1], mx[u << 1 | 1]);
}

void build(int u, int b, int e) {
	if(b == e) return void(t[u] = mx[u] = a[b]);
	int mid = b + e >> 1;
	build(u << 1, b, mid);
	build(u << 1 | 1, mid + 1, e);
	t[u] = t[u << 1] + t[u << 1 | 1];
	mx[u] = max(mx[u << 1], mx[u << 1 | 1]);
}

ll query(int u, int b, int e, int i, int j) {
	if(b > j or e < i) return 0;
	if(i <= b and e <= j) return t[u];
	int mid = b + e >> 1;
	return query(u << 1, b, mid, i, j) + query(u << 1 | 1, mid + 1, e, i, j);
}

int32_t main () {
	//freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
	cin>>n>>q>>k;
	for(int i=1; i<=n; i++) {
		cin>>a[i];
	}
	build(1, 1, n);
	while(q--) {
		int s, t, u;
		cin>>s>>t>>u;
		if(s == 1) {
			replace(1, 1, n, t, u);
		} else if(s == 2) {
			if(k != 1) {
				update(1, 1, n, t, u);
			}
		} else {
			cout<<query(1, 1, n, t, u)<<endl;
		}
	}
	return 0;
}

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

sterilizing.cpp: In function 'int myrand(int, int)':
sterilizing.cpp:16:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
  ^~
sterilizing.cpp:16:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if(ret < 0) ret = -ret; ret %= (r-l+1); ret += l;
                          ^~~
sterilizing.cpp: In function 'void replace(int, int, int, int, int)':
sterilizing.cpp:41:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = b + e >> 1;
            ~~^~~
sterilizing.cpp: In function 'void update(int, int, int, int, int)':
sterilizing.cpp:52:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = b + e >> 1;
            ~~^~~
sterilizing.cpp: In function 'void build(int, int, int)':
sterilizing.cpp:61:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = b + e >> 1;
            ~~^~~
sterilizing.cpp: In function 'll query(int, int, int, int, int)':
sterilizing.cpp:71:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid = b + e >> 1;
            ~~^~~

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75