# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857112 | busamate | Sum Zero (RMI20_sumzero) | C++14 | 8 ms | 23384 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 <iostream>
#include <set>
#include <vector>
using namespace std;
long long N, Q, hol, o;
int t[400001];
vector<int> kerd[400001];
int aa[400001];
vector<int> f[400001];
int tav[400001];
set<pair<long long, int>> szet;
set<int> veg;
void solve(int x, int ki)
{
int y = aa[ki];
if (t[x] < y)
{
aa[ki] = 0;
return;
}
int ret = 0;
for (int i = 18; i >= 0; i--)
{
if (tav[x] >= (1 << i) && y <= t[f[x][i]])
{
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |