Submission #1029735

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
10297352024-07-21 08:42:25gs25조개 줍기 (KOI17_shell)C++17
0 / 100
115 ms51840 KiB
#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;
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...