oj.uz

Submission #885752

# Submission time Handle Problem Language Result Execution time Memory
885752 2023-12-10T15:49:07 Z qin Fire (JOI20_ho_t5) C++17
14 / 100
 257 ms 54408 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pn printf("\n")
#define ssize(x) int(x.size())
#define bitcount(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)
#define ctz(x) __builtin_ctz(x)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef double db;
typedef long double ldb;
#define V vector
/*void read(int &a){
		char c = getchar_unlocked(); a = 0;
		while(c<'0' || '9'<c) c = getchar_unlocked();
		while('0'<=c&&c<='9') a = (a<<3)+(a<<1)+c-'0', c = getchar_unlocked();
}*/
#ifdef DEBUG
#define debug(x...) cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...);}(x),cerr<<'\n'
#else
#define debug(...) {}
#endif
int inf = 2e09; ll infll = 2e18; int mod = (1<<23)*119+1;
int base = 1;
struct seg{
		struct Node{
				ll a, b; int la, lb;
				Node(): a(0), b(0), la(0), lb(0) {}
				Node(ll aa, ll bb, int laa, int lbb) : a(aa), b(bb), la(laa), lb(lbb) {}
		};
		vector<Node> t;
		vector<ll> tab;
		void merge(int &i){
				t[i].a = t[i<<1].a + t[i<<1|1].a, t[i].b = t[i<<1].b + t[i<<1|1].b;
				t[i].la = t[i<<1].la + t[i<<1|1].la, t[i].lb = t[i<<1].lb + t[i<<1|1].lb;
		}
		void init(int n, vector<ll> &a){
				while(base < n) base <<= 1;
				t.resize(base<<1); tab = a;
				for(int i = 1; i <= n; ++i) t[i+base-1] = Node(a[i], a[i], 1, 1);
				for(int i = base-1; i; --i) merge(i);
		}
		void update_point(int i, ll a, ll b, int la, int lb){ for(i += base-1, t[i] = Node(a, b, la, lb), i >>= 1; i; i >>= 1) merge(i); }
		ll first_k(int i, int s, int e, int &x, int &y, int &k, int &T){
				if(!k) return 0;
				int mid = (s+e)>>1;
				if(x <= s && e <= y){
						int sum = t[i].la*T + t[i].lb;
						if(sum <= k){ k -= sum; return t[i].a*T + t[i].b; }
						else{
								if(s != e) return first_k(i<<1, s, mid, x, y, k, T) + first_k(i<<1|1, mid+1, e, x, y, k, T);
								else{ ll ret = tab[s]*k; k = 0; return ret; }
						}
				} ll ret = 0;
				if(x <= mid) ret += first_k(i<<1, s, mid, x, y, k, T);
				if(mid < y) ret += first_k(i<<1|1, mid+1, e, x, y, k, T);
				return ret;
		}
		ll query_interval(int i, int s, int e, int &x, int &y, int &T){
				if(x <= s && e <= y){
						//printf("%d %d\n", t[i].a, t[i].b);
						return t[i].a*T + t[i].b;
				}
				int mid = (s+e)>>1; ll ret = 0;
				if(x <= mid) ret += query_interval(i<<1, s, mid, x, y, T);
				if(mid < y) ret += query_interval(i<<1|1, mid+1, e, x, y, T);
				return ret;
		}
		ll query(int x, int y, int T){
				if(x > y) return 0;
				return query_interval(1, 1, base, x, y, T);
		}
		ll firstk(int x, int y, int k, int T){
				if(x > y) return 0;
				return first_k(1, 1, base, x, y, k, T);
		}
};
struct ev{
		int t, i;
		ev(){}
		ev(int tt, int ii) : t(tt), i(ii) {}
		bool operator <(const ev &x) const{ return t < x.t; }
};
struct qr{
		int a, b, i;
		qr(){}
		qr(int aa, int bb, int ii) : a(aa), b(bb), i(ii) {}
};
void answer(){
		int n, q; scanf("%d%d", &n, &q);
		vector<ll> t(n+1);
		vector<int> nxt(n+1), bef(n+1);
		for(int i = 1; i <= n; ++i) scanf("%lld", &t[i]);
		seg seg; seg.init(n, t);
		
		vector<int> st;
		for(int i = 1; i <= n; ++i){
				while(!st.empty() && t[st.back()] < t[i]) st.pop_back();
				if(st.empty()) bef[i] = n+1;
				else bef[i] = i-st.back();
				st.emplace_back(i);
		} st = vector<int>();
		for(int i = n; i; --i){
				while(!st.empty() && t[st.back()] < t[i]) st.pop_back();
				if(st.empty()) nxt[i] = n+1-i;
				else nxt[i] = st.back()-i;
				st.emplace_back(i);
		} st = vector<int>();
		
		vector<vector<ev>> event(n+2);
		set<int> active;
		for(int i = 1; i <= n; ++i) event[min(n+1, min(bef[i], nxt[i]))].emplace_back(0, i), event[min(n+1, max(bef[i], nxt[i]))].emplace_back(1, i),
									event[min(n+1, min(bef[i], nxt[i])+max(bef[i], nxt[i]))].emplace_back(2, i), active.emplace(i);
		//for(int i = 1; i <= n; ++i) printf("%d %d\n", bef[i], nxt[i]);
		vector<vector<qr>> queries(n+1);
		for(int i = 1; i <= q; ++i){ int a, b, T; scanf("%d%d%d", &T, &a, &b), queries[T].emplace_back(a, b, i);}
		vector<ll> result(q+1);
		
		for(int T = 1; T <= n; ++T){
				for(ev &u : event[T]){
						//printf("%d, %d: %d\n", T, u.i, u.t);
						if(!u.t){
								if(u.i != 1) active.erase(u.i);
								//printf("%d %d\n", T, u.i);
								seg.update_point(u.i, 0, t[u.i]*T, 0, T);
						} else if(u.t == 1) seg.update_point(u.i, -t[u.i], t[u.i]*(min(bef[u.i], nxt[u.i])+T-1), -1, min(bef[u.i], nxt[u.i])+T-1);
						else seg.update_point(u.i, 0, 0, 0, 0);
				}
				for(qr &u : queries[T]){
						auto it1 = active.upper_bound(u.a); it1 = prev(it1);
						auto it2 = active.upper_bound(u.b); it2 = prev(it2);
						result[u.i] = seg.query(*it1, (*it2)-1, T)-seg.firstk(*it1, u.a-1, u.a-(*it1), T)+seg.firstk(*it2, u.b, u.b-(*it2)+1, T);
						//printf("%d: %d %d: %lld %lld %lld\n", u.i, *it1, *it2, seg.query(*it1, (*it2)-1, T), seg.firstk(*it1, u.a-1, u.a-(*it1), T), seg.firstk(*it2, u.b, u.b-(*it2)+1, T));
						//printf("%d %d %d, %lld\n", *it2, u.b, u.b-(*it2)+1, seg.firstk(*it2, u.b, u.b-(*it2)+1, T));
				}
				//if(T == 3) printf("%lld\n", seg.query(4, 4, T));
		}
		for(int i = 1; i <= q; ++i) printf("%lld\n", result[i]);
}
int main(){
		int T = 1; //scanf("%d", &T);
		//ios_base::sync_with_stdio(0); cin.tie(0); cin >> T;
		for(++T; --T; ) answer();
		return 0;
}

Compilation message

ho_t5.cpp: In function 'void answer()':
ho_t5.cpp:96:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   96 |   int n, q; scanf("%d%d", &n, &q);
      |             ~~~~~^~~~~~~~~~~~~~~~
ho_t5.cpp:99:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |   for(int i = 1; i <= n; ++i) scanf("%lld", &t[i]);
      |                               ~~~~~^~~~~~~~~~~~~~~
ho_t5.cpp:122:50: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  122 |   for(int i = 1; i <= q; ++i){ int a, b, T; scanf("%d%d%d", &T, &a, &b), queries[T].emplace_back(a, b, i);}
      |                                             ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 230 ms 53112 KB Output is correct
3 Correct 223 ms 53236 KB Output is correct
4 Correct 227 ms 52528 KB Output is correct
5 Correct 214 ms 53284 KB Output is correct
6 Correct 240 ms 52532 KB Output is correct
7 Correct 230 ms 53428 KB Output is correct
8 Correct 241 ms 53348 KB Output is correct
9 Correct 227 ms 54364 KB Output is correct
10 Correct 221 ms 52040 KB Output is correct
11 Correct 242 ms 54408 KB Output is correct
12 Correct 224 ms 52020 KB Output is correct
13 Correct 241 ms 53424 KB Output is correct
14 Correct 218 ms 53136 KB Output is correct
15 Correct 228 ms 53296 KB Output is correct
16 Correct 246 ms 53124 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 251 ms 53688 KB Output is correct
3 Correct 248 ms 52924 KB Output is correct
4 Correct 248 ms 54320 KB Output is correct
5 Correct 256 ms 53276 KB Output is correct
6 Correct 245 ms 53692 KB Output is correct
7 Correct 245 ms 53684 KB Output is correct
8 Correct 251 ms 53452 KB Output is correct
9 Correct 257 ms 53056 KB Output is correct
10 Correct 248 ms 52876 KB Output is correct
11 Correct 250 ms 54256 KB Output is correct
12 Correct 255 ms 53936 KB Output is correct
13 Correct 246 ms 54068 KB Output is correct
14 Correct 255 ms 53196 KB Output is correct
15 Correct 245 ms 54192 KB Output is correct
16 Correct 244 ms 53804 KB Output is correct

Subtask #4
0 / 6.0

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

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 432 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 230 ms 53112 KB Output is correct
34 Correct 223 ms 53236 KB Output is correct
35 Correct 227 ms 52528 KB Output is correct
36 Correct 214 ms 53284 KB Output is correct
37 Correct 240 ms 52532 KB Output is correct
38 Correct 230 ms 53428 KB Output is correct
39 Correct 241 ms 53348 KB Output is correct
40 Correct 227 ms 54364 KB Output is correct
41 Correct 221 ms 52040 KB Output is correct
42 Correct 242 ms 54408 KB Output is correct
43 Correct 224 ms 52020 KB Output is correct
44 Correct 241 ms 53424 KB Output is correct
45 Correct 218 ms 53136 KB Output is correct
46 Correct 228 ms 53296 KB Output is correct
47 Correct 246 ms 53124 KB Output is correct
48 Correct 251 ms 53688 KB Output is correct
49 Correct 248 ms 52924 KB Output is correct
50 Correct 248 ms 54320 KB Output is correct
51 Correct 256 ms 53276 KB Output is correct
52 Correct 245 ms 53692 KB Output is correct
53 Correct 245 ms 53684 KB Output is correct
54 Correct 251 ms 53452 KB Output is correct
55 Correct 257 ms 53056 KB Output is correct
56 Correct 248 ms 52876 KB Output is correct
57 Correct 250 ms 54256 KB Output is correct
58 Correct 255 ms 53936 KB Output is correct
59 Correct 246 ms 54068 KB Output is correct
60 Correct 255 ms 53196 KB Output is correct
61 Correct 245 ms 54192 KB Output is correct
62 Correct 244 ms 53804 KB Output is correct
63 Incorrect 248 ms 52196 KB Output isn't correct
64 Halted 0 ms 0 KB -