# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
261039 | onjo0127 | 역사적 조사 (JOI14_historical) | C++11 | 316 ms | 8048 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;
using pii = pair<int, int>;
const int bck = 320;
struct query {
int s, e, id;
};
int N, X[100009], I[100009];
long long ans[100009], sum[100009], mx;
vector<query> L[333];
void add(int x) {
sum[I[x]] += X[x];
mx = max(mx, sum[I[x]]);
}
void del(int x) {
sum[I[x]] -= X[x];
}
int main() {
vector<int> P;
int Q; scanf("%d%d", &N, &Q);
for(int i=1; i<=N; i++) {
scanf("%d", &X[i]);
P.push_back(X[i]);
}
sort(P.begin(), P.end());
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... |