# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
55983 | red1108 | 조개 줍기 (KOI17_shell) | C++17 | 1687 ms | 83216 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 <iostream>
#include <stdio.h>
using namespace std;
typedef long long ll;
ll dp[1600][1600], seg[1600][6000], input[1600][1600],ans,n, si=1;
ll query(ll x, ll y)
{
ll ret=0;
y=y+si-1;
while(y)
{
ret+=seg[x][y];
y/=2;
}
return ret;
}
void gang(ll x, ll v, ll l, ll r, ll s, ll e, ll t)
{
if(l>r||e<l||r<s||s>e)
return ;
if(s<=l&&r<=e)
{
seg[x][v]+=t;
return ;
}
gang(x,v*2,l,(l+r)/2,s,e,t);
gang(x,v*2+1,((l+r)/2)+1,r,s,e,t);
}
int main()
{
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... |