# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124490 | DJ035 | 조개 줍기 (KOI17_shell) | C++14 | 487 ms | 35660 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 mx = 1505;
ll dpval = 0;
struct RRBIT{
int n;
ll *d;
int *f;
RRBIT(){}
RRBIT(int n, ll *p, int *B):n(n),d(p),f(B){}
void upd(int a, int b, int v){
dpval += v * (b-a+1);
for(;a<=n;a+=(a&-a)) f[a] += v;
for(++b;b<=n;b+=(b&-b)) f[b] -= v;
}
ll gsum(int i){
ll s = d[i];
for(;i;i-=(i&-i)) s += f[i];
return s;
}
} I[mx];
ll dp[mx][mx], sh;
int BIT[mx][mx];
inline int t(int i, int j){
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... |