oj.uz

Submission #1092569

# Submission time Handle Problem Language Result Execution time Memory
1092569 2024-09-24T12:20:37 Z Sunbae Growing Trees (BOI11_grow) C++17
0 / 100
 88 ms 4168 KB 
#include <bits/stdc++.h>
#define z exit(0)
typedef long long ll;
using namespace std;
const int N = 1e5 + 5;
ll bit[N], a[N];
int n;
void upd(int i, ll v){ for(; i<=n; i+=i&-i) bit[i] += v;}
int qry(int i){ ll r = 0; for(; i; i-=i&-i) r += bit[i]; return r;}
void UPD(int l, int r){ upd(l, +1); upd(r+1, -1);}
ll A(int i){ return a[i] + qry(i);}
signed main(){
	int q; scanf("%d %d", &n, &q);
	for(int i = 1; i<=n; ++i) scanf("%lld", a+i);
	sort(a+1, a+1+n);
	for(int i = 0, c, h, l, r, L, R; i<q; ++i){
		char op; scanf(" %c", &op);
		if(op == 'F'){
			scanf("%d %d", &c, &h);
			int low = 1, high = n, st = n+1, ed = -1;
			while(low <= high){
				int mid = low + ((high-low)>>1);
				if(A(mid) >= h) high = mid-1, st = mid;
				else low = mid+1;
			}
			if(st > n) continue;
			ed = min(n, st+c-1);
			ll val = A(ed);
			low = 1; high = ed; l = n+1; r = -1;
			while(low <= high){
				int mid = low + ((high-low)>>1);
				if(A(mid) < val) low = mid+1;
				else if(A(mid) == val) high = mid-1, l = mid;
			}
			low = ed; high = n;
			while(low <= high){
				int mid = low + ((high-low)>>1);
				if(A(mid) > val) high = mid-1;
				else if(A(mid) == val) low = mid+1, r = mid;
			}
			if(l > r) continue;
			L = st; R = l-1;
			if(L <= R) UPD(L, R);
			int rem = c-l+st;
			L = r - rem + 1; R = r;
			if(rem > 0 && L <= R) UPD(L, R);
		}else{
			scanf("%d %d", &l, &r);
			int low = 1, high = n; L = n+1; R = -1;
			while(low <= high){
				int mid = low + ((high-low)>>1);
				if(A(mid) >= l) high = mid-1, L = mid;
				else low = mid+1;
			}
			low = 1; high = n;
			while(low <= high){
				int mid = low + ((high-low)>>1);
				if(A(mid) <= r) low = mid+1, R = mid;
				else high = mid-1;
			}
			if(L <= R) printf("%d\n", R-L+1);
			else puts("0");
		}
	}
}

Compilation message

grow.cpp: In function 'int main()':
grow.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |  int q; scanf("%d %d", &n, &q);
      |         ~~~~~^~~~~~~~~~~~~~~~~
grow.cpp:14:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |  for(int i = 1; i<=n; ++i) scanf("%lld", a+i);
      |                            ~~~~~^~~~~~~~~~~~~
grow.cpp:17:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |   char op; scanf(" %c", &op);
      |            ~~~~~^~~~~~~~~~~~
grow.cpp:19:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |    scanf("%d %d", &c, &h);
      |    ~~~~~^~~~~~~~~~~~~~~~~
grow.cpp:48:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |    scanf("%d %d", &l, &r);
      |    ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 47 ms 2896 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Incorrect 2 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 39 ms 1620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 27 ms 1628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 2388 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 57 ms 2652 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 2688 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 3384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 63 ms 3156 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 87 ms 4168 KB Output isn't correct
2 Halted 0 ms 0 KB -