Submission #1272512

#	Time	Username	Problem	Language	Result	Execution time	Memory
1272512		algoproclub	Sum Zero (RMI20_sumzero)	C++20	61 / 100	493 ms	47056 KiB

sumzero

// UUID: 0f62c2e1-4e60-4ff7-a114-ce99a267c1e8

#include <bits/stdc++.h>
 
using namespace std;
 
#ifdef DEBUG
namespace debug {
int dbg_rec = 0;
 
template <typename T, typename... U>
concept IsAnyOf = (std::same_as<T, U> || ...);
 
template<typename T>
concept IsCont = IsAnyOf<T, std::vector<typename T::value_type>, 
std::set<typename T::value_type>,
std::multiset<typename T::value_type>>;
 
template<typename Ostream, IsCont Cont> 
Ostream& operator<<(Ostream& os,  const Cont v){ os<<"["; for(auto& x : v){os<<x<<", ";} os<<"]"; return os; }
 
template<typename Ostream, typename ...Ts>
Ostream& operator<<(Ostream& os,  const pair<Ts...>& p){
    os<<"{"<<p.first<<", "<<p.second<<"}"; return os;
}
 
template<typename T>
void print_dbg(stringstream& ss, T x) { ss << x; }
template<typename T, typename... Args>
void print_dbg(stringstream& ss, T x, Args... args) { ss << x << ", "; print_dbg(ss, args...); }
}
#define dbg(...) {stringstream ss; ++debug::dbg_rec; debug::print_dbg(ss, __VA_ARGS__); --debug::dbg_rec; cerr << string(debug::dbg_rec, '\t') << "\e[91m" << __func__ << ":" << __LINE__ << '\t' << #__VA_ARGS__ << " = " << ss.str() << "\e[39m" << endl; }
#define ASSERT(x) assert((x))
#else
#define dbg(...)
#define ASSERT(x)
#endif
 
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

const int logn = 20;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin>>n;

    vector<long long> v(n);
    for(auto &x : v) cin>>x;

    for(int i = 1; i < n; i++) v[i] += v[i-1];

    map<long long, int> mp;
    mp[0] = -1;
    vector<vector<int>> to(logn, vector<int>(n, -1));
    int last = -1;
    for(int i = 0; i < n; i++) {
        if(mp.count(v[i])) last = max(mp[v[i]] + 1, last);
        mp[v[i]] = i;
        to[0][i] = last;
    }
    for(int j = 1; j < logn; j++) {
        for(int i = 0; i < n; i++) {
            if(to[j-1][i] > 0) to[j][i] = to[j-1][to[j-1][i] - 1];
        }
    }

    int q;
    cin>>q;
    while(q--) {
        int l, r;
        cin>>l>>r;
        --l, --r;

        int ans = 0, x = r;
        for(int j = logn-1; j >= 0; j--) {
            if(x >= 0 && to[j][x] >= l) {
                x = to[j][x] - 1;
                ans += (1<<j);
            }
        }  
        cout << ans << '\n';
    }

    return 0;
}

• Subtask 1: 22 / 22
• Subtask 2: 39 / 39
• Subtask 3: 0 / 39