# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750329 | doowey | Sum Zero (RMI20_sumzero) | C++14 | 704 ms | 15880 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;
typedef long long ll;
typedef pair<ll, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)4e5 + 4;
const int B = 3;
const int base = 100;
int nex[B][N];
unordered_map<ll, int> pre;
int pwr[B];
int main(){
fastIO;
//freopen("in.txt", "r", stdin);
int n;
cin >> n;
int a;
pre[0ll] = 0;
pwr[0] = 1;
nex[0][0] = -1;
int st = -1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |