| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 850143 | divad | Sum Zero (RMI20_sumzero) | C++14 | 2 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int n,x,pref;
map<int, int> mp;
int main()
{
cin >> n;
mp[0]++;
int ans = 0;
for(int i = 1; i <= n; i++){
cin >> x;
pref += x;
ans += mp[pref];
mp[pref]++;
}
if(ans > 1e5){
return -1;
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
