# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
403475 | tqbfjotld | 조개 줍기 (KOI17_shell) | C++14 | 805 ms | 317932 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;
#define int long long
set<int> ups[1505];
int fenwick[1505][1505];
void upd(int pos, int val, int num){
while (pos<1505){
fenwick[pos][num]+=val;
pos+=pos&-pos;
}
}
int qu(int pos, int num){
int ans = 0;
while (pos>0){
ans += fenwick[pos][num];
pos-=pos&-pos;
}
return ans;
}
int initarr[1505][1505];
int v2[1505][1505];
int n;
int curans = 0;
vector<pair<int,int> > to_up;
vector<pair<int,int> > to_left;
void incr(int x, int y){
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... |