# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029735 | gs25 | 조개 줍기 (KOI17_shell) | C++17 | 115 ms | 51840 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;
int n;
const int MAXN = 1600;
ll ans;
struct BIT{
int N; ll v[MAXN] = {0,};
BIT(int N): N(N) {}
void update(int pos, int val){
while(pos<=N) v[pos]+=val, pos += pos&-pos;
}
ll query(int pos){
if(pos<=0) return 0;
if(pos>N) pos = N;
ll re = 0;
while(pos){
re += v[pos], pos -= pos&-pos;
}
return re;
}
};
ll dp[MAXN][MAXN];
int a[MAXN][MAXN];
int chk[MAXN][2];
vector<BIT> dp1;
const ll inf = 9999;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |