結果
問題 | No.1496 不思議な数え上げ |
ユーザー |
![]() |
提出日時 | 2022-12-27 05:16:55 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 126 ms / 3,000 ms |
コード長 | 2,777 bytes |
コンパイル時間 | 2,032 ms |
コンパイル使用メモリ | 204,064 KB |
最終ジャッジ日時 | 2025-02-09 21:05:24 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 39 |
ソースコード
#include <bits/stdc++.h>using namespace std;vector<int> cartesiantree(vector<int> A) {int N = A.size();vector<int>p(N,-1);stack<int>st;for(int i = 0; i < N; i++) {int pr = -1;while(!st.empty()) {int x = st.top();if(A[i] < A[x]) {st.pop();if(pr != -1) {p[pr] = x;}pr = x;}else {break;}}if(pr != -1) {p[pr] = i;}st.push(i);}while(st.size() >= 2) {int x = st.top();st.pop();p[x] = st.top();}return p;}void calc(int L,int R,int now,vector<int>&l,vector<int>&r,vector<long long>&Q,vector<long long>&A,vector<long long>&ans) {long long P = Q[now+1]-Q[now]-1;if(now-L <= R-now) {for(int i = L; i <= now; i++) {if(Q[now+1]-Q[i] <= A[P]) {int le = now,ri = R+1;while(le+1 < ri) {int mid = (le+ri)/2;if(Q[mid+1]-Q[i] <= A[P]) {le = mid;}else {ri = mid;}}ans[P] += le-now+1;}}}else {for(int i = now; i <= R; i++) {if(Q[i+1]-Q[now] <= A[P]) {int le = L-1,ri = now;while(le+1 < ri) {int mid = (le+ri)/2;if(Q[i+1]-Q[mid] <= A[P]) {ri = mid;}else {le = mid;}}ans[P] += now-ri+1;}}}if(l[now] != -1) {calc(L,now-1,l[now],l,r,Q,A,ans);}if(r[now] != -1) {calc(now+1,R,r[now],l,r,Q,A,ans);}}int main() {ios::sync_with_stdio(false);cin.tie(nullptr);int N;cin >> N;vector<int>P(N);vector<long long>Q(N+1);for(int i = 0; i < N; i++) {cin >> P[i];Q[i+1] = Q[i]+P[i];}vector<long long>A(N);for(int i = 0; i < N; i++) {cin >> A[i];}vector<long long>ans(N);vector<int>c = cartesiantree(P);vector<int>l(N,-1),r(N,-1);int root = 0;for(int i = 0; i < N; i++) {if(c[i] != -1) {if(c[i] < i) {r[c[i]] = i;}else {l[c[i]] = i;}}else {root = i;}}calc(0,N-1,root,l,r,Q,A,ans);for(int i = 0; i < N; i++) {cout << ans[i] << "\n";}}