# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90542 | 314rate | Split the sequence (APIO14_sequence) | C++14 | 8 ms | 1088 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;
const int N = 100000 + 5;
int n, k;
int p[N];
int ask(int st, int dr)
{
return p[dr] - p[st - 1];
}
vector <pair <int, int>> G;
vector <ll> cost;
vector <int> poz;
void del(int p)
{
for (int i = p; i + 1 < G.size(); i++)
{
G[i] = G[i + 1];
cost[i] = cost[i + 1];
poz[i] = poz[i + 1];
}
G.pop_back();
cost.pop_back();
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |