# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
95614 | diamond_duke | 조개 줍기 (KOI17_shell) | C++11 | 549 ms | 48408 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 <algorithm>
#include <cstring>
#include <cstdio>
using ll = long long;
int dp[2005][2005], arr[2005][2005], st[2005], en[2005], n;
struct BIT
{
int seg[2005];
BIT() { memset(seg, 0, sizeof(seg)); }
inline void modify(int pos, int x)
{
for (; pos <= n; pos += pos & -pos)
seg[pos] += x;
}
inline int query(int pos)
{
int res = 0;
for (; pos; pos -= pos & -pos)
res += seg[pos];
return res;
}
} seg[2005];
inline int query(int x, int y) { return dp[x][y] + seg[x].query(y); }
int main()
{
// freopen("KOI2017-T4.in", "r", stdin);
scanf("%d", &n);
ll ans = 0;
for (int i = 1; i <= n; i++)
{
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... |