output stringlengths 52 181k | instruction stringlengths 296 182k |
|---|---|
#include <bits/stdc++.h>
using namespace std;
const int z = 300;
struct cool {
int x, y, d;
};
vector<cool> a[z * z + 1];
int n, m, p;
bool comp(cool a, cool b) { return (a.d < b.d); }
int main() {
cin >> n >> m >> p;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) {
int x;
cool c;
c... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int MAX = 305;
int dp[MAX][MAX];
int d[MAX][MAX];
vector<pair<int, int> > sq[MAX * MAX];
int n, m, p;
int dist(pair<int, int> a, pair<int, int> b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
int ok(int x, int y) { return... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5e5 + 256;
const char nxtl = '\n';
const double eps = (double)1e-9;
template <typename T>
inline bool updmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
inline bool updmax(T &a, const T &b) {
return a < b ? a = b, 1 : 0;
}
i... | ### Prompt
Please formulate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int m, n;
const int inf = 0x3f3f3f3f;
struct node {
int x, y;
node(int x = 0, int y = 0) {
this->x = x;
this->y = y;
}
};
const int mx[6] = {0, 1, 0, -1, 0};
const int my[6] = {0, 0, 1, 0, -1};
vector<node> f[90011];
int gg[301][301];
int g[301][301], x, y;
in... | ### Prompt
Your task is to create a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c)) f |= c == '-', c = getchar();
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
if (f) x = -x;
return x;
}
template <class t>
inline void wr... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
int n, m, k, mp[305][305];
std::vector<std::pair<int, int> > garden[90005];
int dis[305][305], dis2[305][305];
bool vis[305][305];
int dist(std::pair<int, int> a, std::pair<int, int> b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
void refresh(int lev)... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f7f7f7f;
const int MAXN = 305;
const double eps = 1e-10;
int maze[MAXN][MAXN];
int dis[2][MAXN * MAXN];
int n, m, p;
struct node {
int x, y, len, id;
node(int x = 0, int y = 0, int len = 0, int id = 0)
: x(x), y(y), len(len), id(id) {}
};
vector... | ### Prompt
Please create a solution in CPP to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 300 + 10;
const int MAXV = MAXN * MAXN;
const int INF = 1e9 + 69;
int n, m, p, a[MAXN][MAXN];
int dr[] = {-1, 0, 0, 1};
int dc[] = {0, -1, 1, 0};
void mini(int& x, int y) { x = min(x, y); }
bool on_grid(int i, int j) { return 0 <= i && i < n && 0 <= j && j ... | ### Prompt
Please formulate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 3e2;
int n, m, k, a[N + 7][N + 7];
struct node {
int first, second, g;
node(int X = 0, int Y = 0, int G = 0) { first = X, second = Y, g = G; }
};
vector<node> w[N * N + 7];
int d[N + 7][... | ### Prompt
Please create a solution in CPP to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 305;
int dp[maxn][maxn], mat[maxn][maxn];
int cnt[maxn * maxn], inq[maxn][maxn], d[maxn][maxn];
vector<pair<int, int> > G[maxn * maxn];
int n, m, p;
inline int get_dis(int x1, int y1, int x2, int y2) {
return abs(x1 - x2) + abs(y1 - y2);
}
const int dx[] ... | ### Prompt
Develop a solution in cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int N = 310;
int a[N][N], dp[N][N];
vector<pair<int, int> > g[N * N];
const int inf = 1e9;
int vis[N];
int main() {
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
scanf("%d", &a[i][j]);
g[a... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)1e5 + 17;
const int MX = (int)1e6 + 17;
const int MOD = (int)1e9 + 7;
const long long oo = LLONG_MAX;
const int INF = INT_MAX;
const long double Pi = 3.14159265358979323846264338327950288419716939937510;
const int di[4] = {-1, 0, 1, 0};
const int dj[4] = ... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
int board[310][310], bfs_board[310][310], dp[310][310];
vector<vector<pair<int, int> > > coords;
bool visited[310][310];
bool valid(int i, int j) {
if (i >= 1 && i <= n && j >= 1 && j <= m)
return true;
else
return false;
}
queue<pair<int, int> > q;... | ### Prompt
In CPP, your task is to solve the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of... |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
};
vector<node> P[305 * 305];
int n, m, K, X, Y, mp[305][305], dp[305][305], L[2][305][305], R[2][305][305];
void Min(int &a, int b) {
if (a == -1 || a > b) a = b;
}
int MIN(int a, int b) {
if (a == -1) return b;
if (b == -1) return a;
retu... | ### Prompt
Generate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
const int oo = 0x3f3f3f3f;
const double eps = 1e-9;
int di[] = {1, 0, -1, 0}, dj[] = {0, 1, 0, -1};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, m, x;
cin >> m >> n >> x;
vector<vector<int>> a(m, vector<int>(n));
vector<vector<pair<int, i... | ### Prompt
Construct a CPP code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
int a[305][305];
struct stu {
int h, z;
};
const int INF = 0x3f3f3f3f;
vector<stu> b[90005];
int dp[305][305];
bool vis[305][305];
int xx[] = {1, 0, 0, -1};
int yy[] = {0, 1, -1, 0};
int n, m;
void bfs(int k) {
queue<stu> q;
int ans[305][305];
for (int i = 0; i < 30... | ### Prompt
Create a solution in CPP for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
struct Edge {
int x, y, next;
} edge[305 * 305];
int e, ft[305 * 305], cnt[305 * 305];
int N;
long long inf, dp[305][305], d[305][305];
bool flag[305][305];
int r, c, p, maze[305][305];
int dx[] = {0, 0, 1, -1}, dy[] = {1, -1, 0, 0};
struct Node {
int x, y;
Node() {}
... | ### Prompt
Please formulate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int ma[305][305];
struct node {
int x;
int y;
int id;
int cost;
bool operator<(const node& cx) const { return cost > cx.cost; }
};
vector<node> vec[100000];
bool flag[305][305];
int minn[305][305];
int mim[305][305];
priority_queue<node> que;
int n, m;
void bfs();... | ### Prompt
Please formulate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int z = 300;
struct cool {
int x, y, d;
};
vector<cool> a[z * z + 1];
int n, m, p;
bool comp(cool a, cool b) { return (a.d < b.d); }
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m >> p;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++) ... | ### Prompt
Generate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
const int N = 3e2, magic = 1e5;
int n, m, p, mt[N + 2][N + 2], ds[N + 2][N + 2], tmp[N + 2][N + 2],
qd[N + 2][N + 2];
vector<pair<int, int> > po[N * N + 2];
void goNext(int tr) {
if (po[tr].size() * po[tr - 1].size() <= magic) {
for (auto x : po[tr - 1]) {
d... | ### Prompt
Please formulate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
long long dx[] = {1, 0, 0, -1};
long long dy[] = {0, -1, 1, 0};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, m, p;
cin >> n >> m >> p;
vector<pair<long long, long long> > a[p + 1];
for (long long i = 0; i < n; i++)... | ### Prompt
Please create a solution in cpp to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const long long N = 305;
const long long INF = 1e9 + 5;
const long long mod = 1e9 + 7;
long long n, m, t, a[N][N];
vector<pair<long long, long long>> pos[N * N];
pair<long long, long long> loc;
long long adjx[4] = {-1, 0, 1, 0}, adjy[4] = {0, 1, 0, -1};
bool inRange(long lo... | ### Prompt
In Cpp, your task is to solve the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of... |
#include <bits/stdc++.h>
using namespace std;
inline long long sqr(long long x) { return x * x; }
int tree[4][1505][1505], dp[305][305];
int n, m, p, id;
vector<pair<int, int> > g[90005];
void update_y(int kx, int lx, int rx, int ky, int l, int r, int x, int y,
int val) {
if (l == r) {
if (lx == rx)... | ### Prompt
Create a solution in CPP for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
long long int ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1) ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
if (b == 0) return a;
return gcd(b, a % b)... | ### Prompt
Please formulate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const long long inf = ~0ull >> 4;
vector<pair<int, int> > key[90005];
long long ans[405][405];
long long dis[405][405];
int vis[405][405];
int main() {
int n, m, p, x;
scanf("%d%d%d", &n, &m, &p);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const double PI = acos(-1.0);
const int inf = 0x3f3f3f3f;
template <class T>
void read(T& num) {
char CH;
bool F = false;
for (CH = getchar(); CH < '0' || CH > '9'; F = CH == '-', CH = getchar())
;
for (num = 0; CH >= '0' && CH <= ... | ### Prompt
Construct a cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
vector<int> a[300 * 300 + 5];
int ans[300 * 300 + 5];
int dis[300 * 300 + 5];
int vis[300 * 300 + 5];
int main() {
int n, m, p, x;
cin >> n >> m >> p;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 305;
struct sss {
int a, b, c;
bool operator<(const sss& a) const { return c < a.c; }
};
vector<sss> v[MAXN * MAXN];
int cost(int a, int b, int c, int d) { return abs(a - c) + abs(b - d); }
int main() {
int m, n, i, j, k, p;
cin >> m >> n >> p;
fo... | ### Prompt
Construct a cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
inline int dist(const pair<int, int>& a, const pair<int, int>& b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
void bfs(int n, int m, const vector<vector<int> >& a,
const vector<pair<int, int> >& pPairs,
const vector<vector<long long> >&... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
int i, j, n, h, x, y, cur_h, k, m, p, fx, fy;
int a[505][505], dp[505][505], d[505][505];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
vector<pair<int, int> > g[250505];
vector<pair<int, pair<int, int> > > lst, bfs;
int Abs(int x) { return x > 0 ? x : -x; }
int find_... | ### Prompt
Please formulate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int N, M, P;
struct _2D_Segment_Tree {
struct _1D_Segment_Tree {
int seg[310 * 4];
void modify(int l, int r, int y, int val, int idx) {
if (l == r) {
seg[idx] = val;
} else {
int mid = (l + r) >> 1;
if (y <= mid)
modif... | ### Prompt
Please formulate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 310;
const int INF = 1e9;
const int S = 90000;
int n, m, p;
int mp[MAXN][MAXN];
int dist[MAXN][MAXN];
vector<pair<int, int>> g[MAXN][MAXN];
vector<pair<int, int>> fsz[MAXN * MAXN];
int pr(int i, int j) {
if ((0 <= i) && (i <= n) && (0 <= j) && (j <= m)) {... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
long long dp[333][333];
int a[333][333];
int fq[333 * 333];
vector<pair<int, int> > pos[333 * 333];
long long dt[333][333];
int main() {
ios_base::sync_with_stdio();
cin.tie(0);
int n, m, p;
cin >> n >> m >> p;
for (int i = 0; i < n; i++) {
for (int ii = 0; ii... | ### Prompt
Your task is to create a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
#pragma GCC optizie("3", "Ofast", "inline")
#pragma GCC target("avx")
using namespace std;
inline long long read() {
long long x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = 1;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '... | ### Prompt
Please create a solution in CPP to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
return x * x;
}
template <class T>
T gcd(T a, T b) {
return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
if (e == 0) retur... | ### Prompt
Create a solution in Cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
int break_point() {
char c;
while ((c = getchar()) != '\n')
;
return 0;
}
template <typename T>
void read_integer(T &r) {
bool sign = 0;
r = 0;
char c;
while (1) {
c = getchar();
if (c == '-') {
sign = 1;
break;
}
if (c != ' ' &... | ### Prompt
Your task is to create a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n, m, p;
int dist[90055];
vector<int> vec[90055];
int main() {
scanf("%d %d %d", &n, &m, &p);
int x;
vec[0].emplace_back(0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d",... | ### Prompt
Please create a solution in Cpp to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p, dp[305][305];
vector<pair<int, int> > a[90005];
template <class T>
inline void RD(T &a) {
register int ch = getchar();
bool ng = 0;
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-') ng = 1;
for (a = 0; ch >= '0' && ch <= '9'; ch = getchar(... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>, long long> > place[90004];
vector<pair<int, long long> > temp[305];
vector<long long> MIN[2][305];
int bin(int i, int j, const int &b, const int &x) {
if (i == j) return i;
if (i == j - 1) {
if (temp[x][i].first >= b) return i;
return... | ### Prompt
Construct a CPP code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 305;
const int INF = (int)1e9;
int a[N][N];
int dp[N][N];
vector<pair<int, int>> ps[N * N];
int help[N][N];
int dst(pair<int, int> x, pair<int, int> y) {
return abs(x.first - y.first) + abs(x.second - y.second);
}
int main() {
int n, m, p;
scanf("%d%d%d"... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
int a[312][312];
vector<pair<int, pair<int, int> > > tab[312 * 312];
int d[312][312];
int vis[312][312];
int x[4] = {0, 0, 1, -1};
int y[4] = {1, -1, 0, 0};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> p;
for (int i = 0; i < n... | ### Prompt
Please formulate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x;
int y;
int z;
node() {}
node(int x1, int y1, int z1) : x(x1), y(y1), z(z1) {}
};
int f[310][310];
int MAX = 2000000000;
vector<node> v[90010];
int main() {
int n, m, p;
cin >> n >> m >> p;
for (int i = 1; i <= n; ++i) {
for (int j = ... | ### Prompt
Please formulate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int dp[500][500];
int maze[500][500];
vector<pair<int, int> > where[100100];
int dx[4] = {0, -1, 0, 1};
int dy[4] = {1, 0, -1, 0};
int mark[500][500];
int main(void) {
int n, m, p;
scanf("%d %d %d", &n, &m, &p);
int fx, fy;
int ans = 1e8;
for (int i = 1; i <= n; i... | ### Prompt
Construct a cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 305;
int n, m, p;
int dp[N][N];
vector<int> r[N];
vector<pair<int, int> > g[N * N];
int dis(int x1, int y1, int x2, int y2) { return abs(x1 - x2) + abs(y1 - y2); }
void gao(int x, int y) {
for (int i = 1; i <= n; i++) {
int v ... | ### Prompt
Your task is to create a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
queue<pair<int, int> > Q;
vector<pair<int, int> > T[301 * 301];
int R, C, P, A[301][301], D[301][301], RM[4] = {0, 0, 1, -1},
CM[4] = {1, -1, 0, 0};
bool valid(int r, int c) { return 0 <= r && r < R && 0 <= c && c < C; }
bool cmp(const... | ### Prompt
In Cpp, your task is to solve the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
struct node {
int x, y, dis;
node(int _x, int _y, int _dis) {
x = _x;
y = _y;
dis = _dis;
}
};
bool cmp(const node &a, const node &b) { return a.dis < b.dis; }
void bfs(int k, vector<vector<pair<int, int> > > &pst,
vector<vector<int> ... | ### Prompt
Construct a CPP code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 510;
int n, m, k;
int mov[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int a[N][N], dis[N][N];
struct node {
int x, y;
int dis;
};
vector<node> w[N * N];
void bfs(vector<node> &s) {
vector<node> q;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) d... | ### Prompt
Your task is to create a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
const int oo = 1 << 30;
struct BitTree {
int n, m, A[maxn][maxn];
void init(int a, int b) {
n = a;
m = b;
for (int i = (1), _i = (n); i <= _i; i++)
for (int j = (1), _j = (m); j <= _j; j++) A[i][j] = oo;
}
void add(int a,... | ### Prompt
Please create a solution in Cpp to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n, m;
cin >> n >> m;
int p;
cin >> p;
int a[n][m];
vector<pair<int, int>> v[p];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> a[i][j];
a[i][j]--;
... | ### Prompt
Please formulate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
struct POS {
int x, y;
POS(int x = 0, int y = 0) : x(x), y(y){};
};
vector<POS> s[90005];
int a[305][305];
int d[305][305];
bool vis[305][305];
int dp[305][305];
const int step[4][2] = {1, 0, 0, 1, -1, 0, 0, -1};
int get_distance(POS &a, POS &b) { return abs(a.x - b.x) ... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
long long int cons;
long long int check(long long int a) {
if (a >= cons) a %= cons;
return a;
}
long long int check2(long long int a) {
if (a > 0) return a;
long long int b = a / cons;
a -= b * cons;
if (a < 0) a += cons;
return a;
}
long long int GCD(long lo... | ### Prompt
Create a solution in Cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
int a[305][305] = {0};
struct node {
int x, y;
int d;
};
vector<node> adj[301 * 301];
vector<int> row[301], col[301];
int dp[301][301] = {0};
int main() {
int n, m, p, X, Y;
node tmp;
cin >> n >> m >> p;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j... | ### Prompt
Your task is to create a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open a... |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y, times;
};
int T, t, n, m, P, INF = 1e9;
int val[310][310];
long long num[90010];
vector<node> vc[90010];
int _x[4] = {0, 1, 0, -1}, _y[4] = {-1, 0, 1, 0};
int vis[310][310];
vector<node> vc2[610];
void bfs(int K) {
int i, j, k, k2, x, y, x2, y2, ... | ### Prompt
Generate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p, a[505][505], dp[505][505], d[505][505];
vector<pair<int, int> > indi[250505];
vector<pair<int, pair<int, int> > > bfs, lst;
int fx, fy;
int dir[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
int Abs(int x) { return x > 0 ? x : -x; }
int find_dist(int x1, int y1, i... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 7;
int mp[305][305];
int dp[305][305];
bool vis[305][305];
int ddx[4] = {1, -1, 0, 0};
int ddy[4] = {0, 0, 1, -1};
vector<pair<int, int> > v[305 * 305];
int pos;
const bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
int x1 = a.first;
i... | ### Prompt
Construct a CPP code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e2 + 10;
int n, m, p, a[maxn][maxn];
int dp[maxn][maxn], dis[maxn][maxn];
queue<pair<int, int> > q;
vector<pair<int, int> > vc[maxn * maxn], temp[2];
bool cmp(pair<int, int> x, pair<int, int> y) {
return dp[x.first][x.second] < dp[y.first][y.second];
}
b... | ### Prompt
Develop a solution in Cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
int n, m, p;
int dist[90055];
vector<int> vec[90055];
int main() {
scanf("%d %d %d", &n, &m, &p);
int x;
vec[0].emplace_back(0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d",... | ### Prompt
Please formulate a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
int chest[305][305];
vector<pair<int, int> > record[90005];
long long dp[305][305];
int xp, yp;
void input() {
scanf("%d %d %d", &n, &m, &p);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= m; j++) {
scanf("%d", &chest[i][j]);
if (chest[i]... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
struct s {
int x, y, v;
bool operator<(const s &a) const { return v < a.v; }
};
int n, m, p, x, ans = 1e9;
vector<s> f[309 * 309];
int main() {
scanf("%d%d%d", &n, &m, &p);
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
scanf("%d", &x), f[x].push_... | ### Prompt
Develop a solution in cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = 1;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return f ? -x : x;
}
void write(long long x) {
if (x < 0) putc... | ### Prompt
Create a solution in CPP for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int INF = 1e9 + 7;
const double PI = acos(-1);
const int maxn = 310;
int n, m, k;
int dp[maxn][maxn];
vector<pair<int, int> > a[maxn * maxn];
vector<int> b[2][maxn];
void init() {}
void solve() {}
int main() {
cin >> n >> m >> k;
int... | ### Prompt
Generate a Cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
const int N = 301;
int n, m, p, a[N][N];
vector<pair<int, int> > pos[N * N];
int cost[N][N];
int dr[] = {0, -1, 0, 1};
int dc[] = {-1, 0, 1, 0};
int vis[N][N];
class state {
public:
int x, y, cost;
state(int a, int b, int c) {
x = a;
y = b;
cost = c;
}
... | ### Prompt
Develop a solution in cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
int i, j, n, h, x, y, cur_h, k, m, p, fx, fy;
int a[505][505], dp[505][505], d[505][505];
int dir[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
vector<pair<int, int> > g[250505];
vector<pair<int, pair<int, int> > > lst, bfs;
int Abs(int x) { return x > 0 ? x : -x; }
int find_... | ### Prompt
In cpp, your task is to solve the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of... |
#include <bits/stdc++.h>
using namespace std;
int type[305][305], check[305];
long long int dp[305][305], tmp[305][305];
struct P {
int x, y;
};
vector<P> arr[305 * 305];
int main() {
int n, m, p;
scanf("%d%d%d", &n, &m, &p);
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &typ... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
int N, M, P;
inline int getid(pair<int, int> point) {
return (point.first - 1) * M + point.second;
}
inline int getDist(pair<int, int> a, pair<int, int> b) {
return abs(a.first - b.first) + abs(a.second -... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T abs(T x) {
return x > 0 ? x : -x;
}
template <class T>
T gcd(T a, T b) {
return a ? gcd(b % a, a) : b;
}
template <class T>
T sqr(T a) {
return a * a;
}
template <class T>
T sgn(T a) {
return a > 0 ? 1 : (a < 0 ? -1 : 0);
}
int n;
int m;
const i... | ### Prompt
Create a solution in Cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300;
struct Cood {
int x;
int y;
};
vector<Cood> G[maxn * maxn + 5];
queue<Cood> Q;
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int dp[maxn + 5][maxn + 5];
int temp[maxn + 5][maxn + 5];
bool book[maxn + 5][maxn + 5];
int main(void) {
int n, m,... | ### Prompt
Develop a solution in Cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
struct Coord {
int x, y;
Coord() {}
Coord(int _x, int _y) {
x = _x;
y = _y;
}
int distance(const Coord& other) {
return abs(other.x - x) + abs(other.y - y);
}
};
struct Node {
Node(){};
Node(int _x, int _y, int _l) {
x = _x;
y = _y;
l... | ### Prompt
Create a solution in cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 333;
vector<pair<int, pair<int, int> > > v[maxn * maxn];
int dist(pair<int, int> a, pair<int, int> b) {
return abs(a.first - b.first) + abs(a.second - b.second);
}
int n, m, p, w;
int main() {
scanf("%d%d%d", &m, &n, &p);
for (int i = 1; i <= m; ++i)
... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
const long long INF = (long long)1e18 + 123;
const int inf = (int)2e9 + 123;
const int mod = 1e9 + 7;
using namespace std;
int n, m, p, a[311][311];
int dp[311][311];
vector<pair<int, int> > c[300 * 300 + 123];
vector<int> col[311];
bool is[311];
int main() {
unsigned int FOR;
asm("rdtsc" :... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const int vc = 1e9 + 7;
const int maxN = 310;
const int maxM = maxN * maxN;
int r[maxN][maxN], le[maxN][maxN], ri[maxN][maxN], a[maxN][maxN];
int n, m, p;
int head[maxM], link[maxM], X[maxM], Y[maxM], W[maxM], Co[maxM];
void solve1(int i) {
for (int j = 1; j <= n; j++) {
... | ### Prompt
Please provide a CPP coded solution to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > adj[200005];
int dist[305][305], arr[305][305], n, m, di[305][305];
queue<pair<int, int> > q;
vector<pair<int, pair<int, int> > > v;
int dir[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
int distValue(pair<int, int> p1, pair<int, int> p2) {
return ab... | ### Prompt
Generate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MAXN = 2e5 + 5;
const int MAXM = 9e4 + 500;
const int N = 300 + 10;
const double EPS = 1e-5;
int i, j, d;
int n, k, m, p;
int a[N][N], dp[2][N][N], last[N][N];
vector<pair<int, int> > grid[MAXM];
int main() {
... | ### Prompt
Please create a solution in cpp to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 111111111;
void io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(15);
}
long long mulmod(long long a, long long b, long long m) {
long long q = (long long)(((long double)a * (long double)b) / (long double)m);
long ... | ### Prompt
Develop a solution in cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int Maxn = 305;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, -1, 1};
template <class T>
inline T Read(T& a) {
a = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') {
a = (a << 3) + (a << 1) + c - '0';
... | ### Prompt
Create a solution in cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
int n, m, p;
int a[305][305];
int cdst[305][305];
vector<pair<int, int> > vv[305 * 305];
void solve1(vector<pair<int, int> > &v1, vector<pair<int, int> > &v2) {
for (auto &i : v2) {
for (auto &j : v1) {
cdst[i.first][i.second] =
min(cdst[i.first][i.sec... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
vector<pair<pair<int, int>, int>> chests[90005];
inline int dist(pair<int, int> x, pair<int, int> y) {
return abs(x.first - y.first) + abs(x.second - y.second);
}
bool v[305][305];
int a[305][305];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n, ... | ### Prompt
Your challenge is to write a cpp solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const long double PI = 3.1415926535897932384626433832795;
const long double EPS = 1e-11;
int n, m, p;
int a[310][310];
vector<pair<int, int> > v[90900];
int d[310][310];
int td[310][310];
queue<pair<int, int> > q;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
void b... | ### Prompt
Construct a Cpp code solution to the problem outlined:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest ... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int n, m, p;
int a[305][305];
vector<pair<int, int> > v[90004];
int bit[5][305][305];
int dp[305][305];
void update0(int i, int j, int v, int t) {
for (int x = i; x <= 300; x += (x & (-x))) {
for (int y = j; y <= 300; y += (y & -y))
bit[0][x... | ### Prompt
Create a solution in Cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 330;
const int M = 4 * N;
const int Inf = 1e8;
int n, m, p;
int a[N][N];
int Dp[N][N];
vector<pair<int, int> > Idx[N * N];
int Dist(pair<int, int> x, pair<int, int> y) {
return abs(x.first - y.first) + abs(x.second - y.second);
}
struct SegTree {
int Tree[... | ### Prompt
Create a solution in cpp for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y, z;
bool operator<(const node &_) const { return z < _.z; }
};
const int MAXN = 300;
const int INF = 1 << 30;
const int stepx[4] = {1, 0, 0, -1};
const int stepy[4] = {0, 1, -1, 0};
int n, m, p;
vector<pair<int, int> > V[(MAXN + 10) * (MAXN + 10)]... | ### Prompt
Develop a solution in cpp to the problem described below:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any che... |
#include <bits/stdc++.h>
using namespace std;
const int N = (int)3e2 + 10;
const int INF = (int)0x3f3f3f3f;
struct Fenwick1D {
int n, type;
int ft[N];
Fenwick1D() {}
Fenwick1D(int n, int type) : n(n), type(type) {
for (int i = 1; i <= n; ++i) ft[i] = INF;
}
int Query(int i) {
int ans = INF;
if (... | ### Prompt
Create a solution in CPP for the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
char ch;
T n = 0;
bool ng = false;
while (1) {
ch = getchar();
if (ch == '-') {
ng = true;
ch = getchar();
break;
}
if (ch >= '0' && ch <= '9') break;
}
while (1) {
n = n * 10 + (ch - '0');
... | ### Prompt
Your challenge is to write a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can op... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 300 + 10;
int dp[maxn][maxn], vis[maxn][maxn], cnt[maxn * maxn], cn[maxn * maxn];
struct Poi {
int x, y, p;
Poi() {}
Poi(int x, int y, int p) : x(x), y(y), p(p) {}
bool operator<(const Poi &a) const { return p > a.p; }
} poi[maxn * maxn];
int dx[] =... | ### Prompt
In cpp, your task is to solve the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of... |
#include <bits/stdc++.h>
using namespace std;
const int kInf = numeric_limits<int>::max() / 32;
struct Item {
int x, value, left, right;
};
void MarkLeft(vector<Item>& items) {
int N = items.size();
items[0].left = items[0].value;
for (int i = 1; i < N; ++i) {
items[i].left =
min(items[i].value, ite... | ### Prompt
Generate a CPP solution to the following problem:
Vanya is in the palace that can be represented as a grid n × m. Each room contains a single chest, an the room located in the i-th row and j-th columns contains the chest of type aij. Each chest of type x ≤ p - 1 contains a key that can open any chest of ty... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b;
int o[15];
int mixn = 9999;
vector<int> V, V2;
void dfs(int goal, int times) {
if (times >= mixn) return;
if (goal == n) {
if (o[n] < 0) {
V2 = V;
mixn = times;
}
return;
}
for (int i = 0;
i <= max(o[goal - 1] / b + 1, max... | ### Prompt
Create a solution in Cpp for the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements»... |
#include <bits/stdc++.h>
using namespace std;
int dp[15][20][20][20];
int h[20];
struct Node {
int i, j, k, l;
} pre[15][20][20][20];
int main() {
int n, a, b;
scanf("%d %d %d", &n, &a, &b);
for (int i = 0; i < n; ++i) {
scanf("%d", &h[i]);
h[i]++;
}
memset(dp, 0x3f, sizeof(dp));
memset(pre, -1, s... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizard... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, mx = 1e9, v[20], x[20], sav[20];
void bkt(int k, int ant, int eu, int nr) {
int aux =
max(eu / a + (eu >= 0), max(ant / b + (ant >= 0), v[k + 1] / b + 1));
if (k == n - 1) {
x[n - 1] = aux;
nr += aux;
if (nr < mx) {
mx = nr;
me... | ### Prompt
Develop a solution in Cpp to the problem described below:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Base... |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
int x[100];
stack<int> st;
int n, a, b;
int best = 100000;
int nums[100], sum[100], best2[100];
bool z;
void rec(int k) {
if (k > n - 1) {
bool z = true;
int cnt = 0;
for (int i = 2; i <... | ### Prompt
In Cpp, your task is to solve the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 15, oo = 1 << 30;
int N, a, b, Ans;
int H[maxn], G[maxn], F[maxn];
int calc(int h, int b) {
if (h <= 0) return 0;
return h / b + (h % b != 0);
}
void Done1() {
memcpy(G, H, sizeof(H));
for (int i = (2), _i = (N - 1); i <= _i; i++) {
F[i] = calc(... | ### Prompt
Your challenge is to write a Cpp solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizard... |
#include <bits/stdc++.h>
using namespace std;
int a, b;
vector<int> solve(vector<int> cur) {
vector<int> res;
bool mret = true;
for (int i(0); i <= (((int)cur.size()) - 1); i++)
if (cur[i] > 0) mret = false;
if (mret) return res;
if (((int)cur.size()) == 0) return res;
if (((int)cur.size()) == 1) {
... | ### Prompt
Generate a cpp solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». ... |
#include <bits/stdc++.h>
using namespace std;
int dp[20][20][20];
int from[20][20][20];
int v[20];
int a, b, n;
int main() {
cin >> n >> a >> b;
for (int i(0); i < n; i++) {
cin >> v[i];
v[i]++;
}
n--;
for (int i(0); i <= 16; i++)
for (int j(0); j <= 16; j++)
for (int k(0); k <= 16; k++) dp[... | ### Prompt
Create a solution in CPP for the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements»... |
#include <bits/stdc++.h>
using namespace std;
int a, b, n, i, ans, arr[20], res[100];
bool dfs(int d, int x, int l) {
if (d == 0) {
for (int i = 1; i <= n; i++)
if (arr[i] >= 0) return false;
return true;
}
if (arr[x] < 0) return dfs(d, x + 1, l);
if (x == n) {
arr[n] -= b;
res[d] = n - 1;... | ### Prompt
Generate a Cpp solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». ... |
#include <bits/stdc++.h>
using namespace std;
int N, a, b;
int arr[15];
int dp[2][20][20][20];
vector<pair<int, int> > path[2][20][20][20];
inline void update(int now, int i, int j, int k, int pre, int i2, int j2,
int k2, int cnt, int pos) {
if (dp[pre][i2][j2][k2] == -1) return;
if (dp[now][i][j... | ### Prompt
Generate a CPP solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». ... |
#include <bits/stdc++.h>
using namespace std;
int n, a, b, h[20], f[20][20][20][20], g[20][20][20][20][5];
void update(int &f1, int f2, int p[5], int i, int j, int k, int l, int w) {
if (f2 < f1) {
f1 = f2;
p[0] = w;
p[1] = i;
p[2] = j;
p[3] = k;
p[4] = l;
}
}
int main() {
cin >> n >> a >>... | ### Prompt
In cpp, your task is to solve the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
if (p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, 100000, stdin);
if (pend ==... | ### Prompt
Please create a solution in CPP to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Base... |
#include <bits/stdc++.h>
int n, a, b, h[10], tmp[200], res[200], num = 0, ans = 0, sum[16];
void desc(int x) {
h[x] -= a;
h[x + 1] -= b;
h[x - 1] -= b;
tmp[num++] = x;
}
void back(int newNum) {
while (num > newNum) {
int x = tmp[--num];
h[x] += a;
h[x + 1] += b;
h[x - 1] += b;
}
}
void dfs(i... | ### Prompt
Generate a CPP solution to the following problem:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizards and Basements». ... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = (1e5) + 9;
int h[20];
int an[160];
int n, a, b;
bool dfs(int ans, int x, int l) {
if (ans == 0) {
for (int i = 1; i <= n; i++) {
if (h[i] >= 0) return false;
}
return true;
}
if (h[x] < 0) return dfs(ans, x + 1, l);
if (x == n) {
... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizard... |
#include <bits/stdc++.h>
using namespace std;
int ans = 9999999;
int h[100];
int a, b, n;
vector<int> V;
vector<int> V2;
void dfs(int x, int times) {
if (times >= ans) return;
if (x == n) {
if (h[x] < 0) {
V2 = V;
ans = times;
}
return;
}
for (int i = 0;
i <= max(h[x - 1] / b + 1,... | ### Prompt
Please provide a CPP coded solution to the problem described below:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizard... |
#include <bits/stdc++.h>
const int MAXN = 11;
using namespace std;
int hit[MAXN], n, a, b, h[MAXN], ans, fa[MAXN];
bool dfs(int l, int k, int last) {
if (k == 0) {
int flag = 0;
for (int i = 1; i <= n; i++)
if (h[i] >= 0) flag = 1;
if (!flag)
return 1;
else
return 0;
}
if (h[l] <... | ### Prompt
Please provide a Cpp coded solution to the problem described below:
This is simplified version of the problem used on the original contest. The original problem seems to have too difiicult solution. The constraints for input data have been reduced.
Polycarp likes to play computer role-playing game «Lizard... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.