# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1136161 | cowwycow | Sum Zero (RMI20_sumzero) | C++20 | 411 ms | 28244 KiB |
#include <bits/stdc++.h>
using namespace std;
#define name "aaaaaa"
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using ppii = pair<ll, pii>;
using pll = pair<ll, ll>;
using ull = unsigned long long;
void file(){
ios_base::sync_with_stdio(0); cin.tie(0);
if(fopen(name".inp", "r")) {
freopen(name".inp", "r", stdin);
freopen(name".out", "w", stdout);
}
}
const int N = 4e5 + 5;
const int L = 7;
const int inf = 1e9;
int n;
ll a[N];
int par[N][L], dep[N];
int e[N];
int cal(int x, int y){
if(x > n) return n + 1;
if(y % 3 == 0) return par[x][y / 3];
if(y == 0) return e[x];
return cal(cal(x, y - 1) + 1, y - 1);
}
void solve (){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
a[i] += a[i - 1];
}
map<ll, int> mp;
e[n + 1] = inf;
mp[a[n]] = n;
for(int i = n; i >= 1; i--){
int p = mp[a[i - 1]];
if(p == 0) p = inf;
e[i] = min(e[i + 1], p);
mp[a[i - 1]] = i - 1;
}
for(int i = 1; i <= n; i++){
if(e[i] == inf) e[i] = n + 1;
}
for(int i = n; i >= 1; i--){
par[i][0] = e[i];
for(int j = 3; j <= 18; j += 3){
if(cal(i, j - 1) == n + 1){
par[i][j / 3] = n + 1;
continue;
}
par[i][j / 3] = cal(cal(i, j - 1) + 1, j - 1);
}
}
int q; cin >> q;
while(q--){
int l, r;
cin >> l >> r;
int ans = 0;
for(int i = 19; i >= 0; i--){
if(l == n + 1) continue;
int cur = cal(l, i);
if(cur == n + 1 || cur > r || l == n + 1) continue;
l = cur + 1;
ans += (1 << i);
}
cout << ans << "\n";
}
}
int main(){
file();
int test = 1;
//cin >> test;
while(test--){
solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |