제출 #1138495

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138495		SmuggingSpun	Sterilizing Spray (JOI15_sterilizing)	C++20	100 / 100	152 ms	6772 KiB

sterilizing

#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
typedef long long ll;
const int lim = 1e5 + 5;
int n, q, k, a[lim];
ll bit[lim];
void update(int p, int x){
	for(; p <= n; p += p & -p){
		bit[p] += x;
	}
}
ll get(int p){
	ll ans = 0;
	for(; p > 0; p -= p & -p){
		ans += bit[p];
	}
	return ans;
}
namespace sub3{
	void solve(){
		for(int _ = 0; _ < q; _++){
			int _t, u, v;
			cin >> _t >> u >> v;
			if(_t == 1){
				update(u, -a[u]);
				update(u, a[u] = v);
			}
			else if(_t == 3){
				cout << get(v) - get(u - 1) << "\n";
			}
		}
	}
}
namespace sub124{
	set<int>s;
	void solve(){
		for(int i = 1; i <= n; i++){
			if(a[i] > 0){
				s.insert(i);
			}
		}
		for(int _ = 0; _ < q; _++){
			int _t, u, v;
			cin >> _t >> u >> v;
			if(_t == 1){
				update(u, -a[u]);
				update(u, a[u] = v);
				if(v > 0){
					s.insert(u);
				}
			}
			else if(_t == 2){
				vector<int>trash;
				for(auto it = s.lower_bound(u); it != s.end() && *it <= v; it = next(it)){
					int i = *it;
					update(i, -a[i]);
					update(i, a[i] /= k);
					if(a[i] == 0){
						trash.emplace_back(i);
					}
				}
				for(int& i : trash){
					s.erase(i);
				}
			}
			else{
				cout << get(v) - get(u - 1) << "\n";
			}
		}
	}
}
int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	if(fopen(taskname".inp", "r")){
		freopen(taskname".inp", "r", stdin);
	}
	cin >> n >> q >> k;
	memset(bit, 0, sizeof(bit));
	for(int i = 1; i <= n; i++){
		cin >> a[i];
		update(i, a[i]);
	}
	if(k == 1){
		sub3::solve();
	}
	else{
		sub124::solve();
	}
}

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

sterilizing.cpp: In function 'int main()':
sterilizing.cpp:76:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |                 freopen(taskname".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

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