# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404246 | lyc | 조개 줍기 (KOI17_shell) | C++14 | 586 ms | 35308 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;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for (int i=(a);i>=(b);--i)
const int mxN = 1505;
int N, A[mxN][mxN], dp[mxN][mxN];
struct Fenwick {
int ft[mxN];
Fenwick() {
memset(ft,0,sizeof ft);
}
void update(int a, int b) {
for (; a <= N; a += a&-a) ft[a] += b;
}
void update(int a, int b, int c) {
update(a,c);
update(b+1,-c);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |