# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
690397 | valerikk | Ants and Sugar (JOI22_sugar) | C++17 | 4042 ms | 9720 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 = 5e5 + 7;
const ll INF = 2e18;
int q, L;
struct query {
int t, x;
ll a;
} qr[N];
int n;
vector<int> xs;
ll a[N], b[N];
void adda(int l, int r, ll d) {
for (int i = l; i < r; ++i) {
a[i] += d;
}
}
void addb(int l, int r, ll d) {
for (int i = l; i < r; ++i) {
b[i] += d;
}
}
# | 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... |