# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151757 | arnold518 | 조개 줍기 (KOI17_shell) | C++14 | 618 ms | 62332 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;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1500;
int N;
ll A[MAXN+10][MAXN+10], B[MAXN+10][MAXN+10], ans;
struct BIT
{
ll tree[MAXN+10];
void update(int i, ll val) { for(; i<=N; i+=(i&-i)) tree[i]+=val; }
ll query(int i) { ll ret=0; for(; i>0; i-=(i&-i)) ret+=tree[i]; return ret; }
};
BIT bit[MAXN+10];
ll query(int y, int x, int val)
{
int i, j;
int s=x, e=x;
//printf("=========\n");
//for(i=1; i<=N; i++) { for(j=1; j<=N; j++) printf("%d ", bit[i].query(j)); printf("\n"); }
//printf("=========\n");
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... |