Submission #495488

#TimeUsernameProblemLanguageResultExecution timeMemory
495488couplefireSum Zero (RMI20_sumzero)C++17
0 / 100
2 ms1100 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long const int N = 400005; int n, q; bitset<19> to[N][5]; map<ll, int> mp; ll sum; int main(){ // freopen("a.in", "r", stdin); cin.tie(0)->sync_with_stdio(0); cin >> n; mp[0] = 0; for(int i = 1; i<=n; ++i){ int a; cin >> a; sum += a; to[i][0] = to[i-1][0]; if(mp.count(sum)) to[i][0] = max((int)to[i][0].to_ulong(), mp[sum]+1); mp[sum] = i; } mp.clear(); for(int j = 1; j<5; ++j) for(int i = 1; i<=n; ++i){ int bruh = i+1; for(int k = 0; k<16; ++k) bruh = to[bruh-1][j-1].to_ulong(); to[i][j] = bruh; } cin >> q; while(q--){ int l, r; cin >> l >> r; int cnt = 0, cur = r; for(int i = 4; i>=0; --i) while(to[cur][i].to_ulong()>=l) cur = to[cur][i].to_ulong()-1, cnt += (1<<(4*i)); cout << cnt << '\n'; } }

Compilation message (stderr)

sumzero.cpp: In function 'int main()':
sumzero.cpp:33:40: warning: comparison of integer expressions of different signedness: 'long unsigned int' and 'int' [-Wsign-compare]
   33 |             while(to[cur][i].to_ulong()>=l) cur = to[cur][i].to_ulong()-1, cnt += (1<<(4*i));
      |                   ~~~~~~~~~~~~~~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...