oj.uz

Submission #489821

# Submission time Handle Problem Language Result Execution time Memory
489821 2021-11-24T20:38:43 Z ignaciocanta Growing Trees (BOI11_grow) C++14
100 / 100
 99 ms 2872 KB 
#include <bits/stdc++.h>

using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T> using Tree = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
 
using tint = long long;
using ld = long double;
 
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
using vi = vector<int>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vl = vector<tint>;
using vvl = vector<vl>;
using vb = vector<bool>;
 
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
 
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+7; 
const int mod = 998244353;
const int MX = 1e5+5;
const tint INF = 1e18; 
const int inf = 1e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-5;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
 
bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } 
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } 
 
void NACHO(string name = ""){
    ios_base::sync_with_stdio(0); cin.tie(0);
    if(sz(name)){
        freopen((name+".in").c_str(), "r", stdin);
        freopen((name+".out").c_str(), "w", stdout);
    }
}

int B[MX];
int n;

void upd(int pos, int val){
	for(int x = pos; x <= n; x += x&(-x)){
		B[x] += val;
	}
}

int sum(int pos){
	int ret = 0;
	for(int x = pos; x > 0; x -= x&(-x)){
		ret += B[x];
	}
	return ret;
}

int main(){
    NACHO();
	int q; cin >> n >> q;
	vi a(n+1);
	F0R(i, n){
		cin >> a[i+1];
	}
	sort(all(a));
	FOR(i, 1, n+1) upd(i, a[i] - a[i-1]);
	F0R(assa, q){
		char t; cin >> t;
		if(t == 'F'){
			int c, h; cin >> c >> h;
			int low = 0, high = n+1;
			while(high - low > 1){
				int mid = low + (high - low) / 2;
				if(sum(mid) >= h) high = mid;
				else low = mid;
			}
			int L = high;
			if(L == n+1) continue;
			int R = L + c - 1;
			if(R >= n){
				upd(L, 1);
				continue;
			}
			int a_r = sum(R);
			low = 0, high = n+1;
			while(high - low > 1){
				int mid = low + (high - low) / 2;
				if(sum(mid) >= a_r) high = mid;
				else low = mid;
			}
			int L2 = high;
			low = 0, high = n+1;
			while(high - low > 1){
				int mid = low + (high - low) / 2;
				if(sum(mid) > a_r) high = mid;
				else low = mid;
			}
			int R2 = high - 1;
			upd(L, 1); upd(L2, -1);
			upd(R2 - (c - (L2 - L)) + 1, 1); upd(R2 + 1, -1);
		}else{
			int l, r; cin >> l >> r;
			int low = 0, high = n+1;
			while(high - low > 1){
				int mid = low + (high - low) / 2;
				if(sum(mid) >= l) high = mid;
				else low = mid;
			}
			int L = high;
			low = 0, high = n+1;
			while(high - low > 1){
				int mid = low + (high - low) / 2;
				if(sum(mid) > r) high = mid;
				else low = mid;
			}
			int R = high - 1;
			cout << max(0, R - L + 1) << "\n";
		}
	}
}

Compilation message

grow.cpp: In function 'void NACHO(std::string)':
grow.cpp:74:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         freopen((name+".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
grow.cpp:75:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   75 |         freopen((name+".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 1216 KB Output is correct
2 Correct 89 ms 2760 KB Output is correct
3 Correct 39 ms 2632 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 2 ms 336 KB Output is correct
5 Correct 41 ms 1352 KB Output is correct
6 Correct 52 ms 1564 KB Output is correct
7 Correct 5 ms 336 KB Output is correct
8 Correct 38 ms 1092 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 644 KB Output is correct
2 Correct 50 ms 1692 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 36 ms 1288 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 684 KB Output is correct
2 Correct 56 ms 1608 KB Output is correct
3 Correct 6 ms 464 KB Output is correct
4 Correct 51 ms 1716 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 1000 KB Output is correct
2 Correct 85 ms 2228 KB Output is correct
3 Correct 15 ms 832 KB Output is correct
4 Correct 34 ms 2248 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 1004 KB Output is correct
2 Correct 86 ms 2328 KB Output is correct
3 Correct 42 ms 2648 KB Output is correct
4 Correct 14 ms 848 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 1064 KB Output is correct
2 Correct 63 ms 2324 KB Output is correct
3 Correct 40 ms 2600 KB Output is correct
4 Correct 14 ms 848 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 1024 KB Output is correct
2 Correct 85 ms 2200 KB Output is correct
3 Correct 25 ms 1816 KB Output is correct
4 Correct 70 ms 2200 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 1220 KB Output is correct
2 Correct 91 ms 2680 KB Output is correct
3 Correct 99 ms 2872 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 1532 KB Output is correct