oj.uz

Submission #25109

# Submission time Handle Problem Language Result Execution time Memory
25109 2017-06-20T07:05:03 Z kdh9949 Sterilizing Spray (JOI15_sterilizing) C++14
100 / 100
 4166 ms 2456 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int MX = 100000, B = 41;
int n, q, K;

struct Buc{
	int a[B], c, nc;
	ll s;
	void ch(int x, int v){ s -= a[x]; a[x] = v; s += a[x]; }
	void dv(int x){ s -= a[x]; a[x] /= K; s += a[x]; }
	void rs(){
		s = 0;
		for(int i = 0; i < B; i++) s += a[i];
	}
	ll rec(){
		while(c <= 30 && c < nc){
			for(int i = 0; i < B; i++) a[i] /= K;
			c++;
		}
		rs();
		return s;
	}
	void rn(){
		rec();
		c = nc = 0;
	}
};

Buc a[MX / B + 1];

int main(){
	scanf("%d%d%d", &n, &q, &K);
	for(int i = 0; i < n; i++){
		scanf("%d", a[i / B].a + (i % B));
		a[i / B].s += a[i / B].a[i % B];
	}
	for(int t, x, y; q--; ){
		scanf("%d%d%d", &t, &x, &y);
		if(t == 1){
			x--;
			a[x / B].rn();
			a[x / B].ch(x % B, y);
		}
		else if(t == 2){
			x--; y--;
			if(x % B) a[x / B].rn();
			for(; x <= y && x % B; x++) a[x / B].dv(x % B);
			for(; x + B <= y; x += B) a[x / B].nc++;
			if(x <= y) a[x / B].rn();
			for(; x <= y; x++) a[x / B].dv(x % B);
		}
		else{
			x--; y--;
			ll ans = 0;
			if(x % B) a[x / B].rec(); 
			for(; x <= y && x % B; x++) ans += a[x / B].a[x % B];
			for(; x + B <= y; x += B) ans += a[x / B].rec();
			if(x <= y) a[x / B].rec();
			for(; x <= y; x++) ans += a[x / B].a[x % B];
			printf("%lld\n", ans);
		}
		//for(int i = 0; i < n; i++) printf("%d ", a[i / B].a[i % B]);
		//puts("");
	}
	//puts("");
}

Compilation message

sterilizing.cpp: In function 'int main()':
sterilizing.cpp:34:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &q, &K);
                             ^
sterilizing.cpp:36:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", a[i / B].a + (i % B));
                                    ^
sterilizing.cpp:40:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &t, &x, &y);
                              ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2456 KB Output is correct
2 Correct 0 ms 2456 KB Output is correct
3 Correct 0 ms 2456 KB Output is correct
4 Correct 3 ms 2456 KB Output is correct
5 Correct 6 ms 2456 KB Output is correct
6 Correct 6 ms 2456 KB Output is correct
7 Correct 6 ms 2456 KB Output is correct
8 Correct 6 ms 2456 KB Output is correct
9 Correct 9 ms 2456 KB Output is correct
10 Correct 6 ms 2456 KB Output is correct
11 Correct 6 ms 2456 KB Output is correct
12 Correct 6 ms 2456 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 919 ms 2456 KB Output is correct
2 Correct 693 ms 2456 KB Output is correct
3 Correct 806 ms 2456 KB Output is correct
4 Correct 1203 ms 2456 KB Output is correct
5 Correct 1506 ms 2456 KB Output is correct
6 Correct 1583 ms 2456 KB Output is correct
7 Correct 1366 ms 2456 KB Output is correct
8 Correct 1539 ms 2456 KB Output is correct
9 Correct 4146 ms 2456 KB Output is correct
10 Correct 4049 ms 2456 KB Output is correct
11 Correct 3919 ms 2456 KB Output is correct
12 Correct 4126 ms 2456 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 2456 KB Output is correct
2 Correct 136 ms 2456 KB Output is correct
3 Correct 219 ms 2456 KB Output is correct
4 Correct 559 ms 2456 KB Output is correct
5 Correct 1463 ms 2456 KB Output is correct
6 Correct 1533 ms 2456 KB Output is correct
7 Correct 1433 ms 2456 KB Output is correct
8 Correct 1433 ms 2456 KB Output is correct
9 Correct 3889 ms 2456 KB Output is correct
10 Correct 4166 ms 2456 KB Output is correct
11 Correct 4086 ms 2456 KB Output is correct
12 Correct 4006 ms 2456 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 679 ms 2456 KB Output is correct
2 Correct 806 ms 2456 KB Output is correct
3 Correct 466 ms 2456 KB Output is correct
4 Correct 726 ms 2456 KB Output is correct
5 Correct 1569 ms 2456 KB Output is correct
6 Correct 1393 ms 2456 KB Output is correct
7 Correct 1486 ms 2456 KB Output is correct
8 Correct 1466 ms 2456 KB Output is correct
9 Correct 3959 ms 2456 KB Output is correct
10 Correct 4113 ms 2456 KB Output is correct
11 Correct 4026 ms 2456 KB Output is correct
12 Correct 4043 ms 2456 KB Output is correct