# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587495 | NekoRolly | I want to be the very best too! (NOI17_pokemonmaster) | C++17 | 91 ms | 10316 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;
const int N = 5e4+4;
struct Bit{
int n,t[N];
void up(int i,int val){
for (; i<=n; i+=i&-i) t[i] += val;
}
int que(int i){ int ans = 0;
for (; i>0; i-=i&-i) ans += t[i];
return ans;
}
} d1;
int n,m,q;
vector<vector<int>> level,poke,vis;
bool use[N];
set<int> d2[N];
bool valid(int a,int b,int x){
return 0 < a && a <= n && 0 < b && b <= m && !vis[a][b] && level[a][b] <= x;
}
void dfs(int a,int b,int x){ use[poke[a][b]] = vis[a][b] = 1;
if (valid(a-1, b, x)) dfs(a-1, b, x);
if (valid(a+1, b, x)) dfs(a+1, b, x);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |