# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
23025 | shuuna | Sterilizing Spray (JOI15_sterilizing) | C++14 | 5000 ms | 250024 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.
//THIS IS ONLY TRIAL. SOLUTION TAKEN FROM KAGAMIZ BLOG
#include <bits/stdc++.h>
#define MAX_N (100010)
#define MAX_Q (100010)
#define MAX_S (131072)
using namespace std;
typedef long long Int;
class BIT {
Int A[MAX_N + 1];
public:
BIT(){
memset(A, 0, sizeof(A));
}
void add(int p, Int x){
for (p++; p <= MAX_N; p += p & -p) A[p] += x;
}
Int sum(int p){
Int ret = 0;
for (p++; p; p &= (p - 1)) ret += A[p];
return (ret);
}
};
struct Node {
Int val;
bool id;
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... |