id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n int q = queries.size();\n vector<int> ans(q,0);\n\n\n for(int k=0; k<q; k++) {\n int d[n];\n d[0] = 0;\n for(int i=1; i<n; i++) {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "constexpr int MAX = 512;\n\nint dis[MAX], que[MAX];\nvector<int> adj[MAX];\n\nint BFS(int n, int src, int dst) {\n int l = 0, r = 0;\n fill(dis, dis + n, -1);\n dis[src] = 0;\n que[r++] = src;\n while (l < r) {\n int x = que[l++];\n for (int y : adj[x]) {\n if (dis[y] == -1) {\n dis[... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void adjust(vector<vector<int>> &adj, int u, int v, vector<int> &distance){\n if(distance[v]>distance[u]+1){\n distance[v]=distance[u]+1;\n for(auto it:adj[v]){\n adjust(adj,v,it,distance);\n }\n }\n return;... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void dfs(vector<vector<int>> &graph, vector<int> &dist, int curr){\n for(int next:graph[curr]){\n if(dist[next] > 1+dist[curr]){\n dist[next] = 1+dist[curr];\n dfs(graph, dist, next);\n }\n }\n }\n vector... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n unordered_map<int,vector<int>> m1;\n vector<int> v(n);\n vector<int> res;\n // int x=n-1;\n for(int i=0;i<n;i++){\n v[i]=n-(i+1);\n // co... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n unordered_map<int,vector<int>> m1;\n vector<int> v(n);\n vector<int> res;\n // int x=n-1;\n for(int i=0;i<n;i++){\n v[i]=n-(i+1);\n // co... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\ntypedef pair<int,int> pii;\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> dist(n,0);\n vector<unordered_set<int>> neighbours(n);\n for(int i=0;i<n;i++)\n {\n dist[i]=i;\n if(i!=n... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "/*\nclass Solution {\n int bfs( vector<vector<int>>& graph, int n){\n vector<int> visited(n, false);\n queue<pair<int, int> > q;\n visited[0] = true;\n q.push(make_pair(0, 0));\n while(!q.empty()){\n int node = q.front().first;\n int l = q.front()... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void findShortPath(vector<vector<int>>&adj, int s, int t, vector<int>&dist){\n queue<int>q;\n q.push(s);\n int l = 0;\n while(!q.empty()){\n// \n int s = q.size();\n while(s--){\n int tp = q.front();... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void updated(int &u,int &v, vector<int> adj[], vector<int> &dist, int &n)\n {\n if(dist[u]+1 < dist[v])\n {\n dist[v]=dist[u]+1;\n queue<int> qq;\n qq.push(v);\n while(!qq.empty()){\n int vv=qq.front();qq... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "#define ll long long\n#define rep(i, a, b) for (int i = a; i <= b; i++)\n#define repL(i, a, b) for (ll i = a; i <= b; i++)\n#define nl '\\n'\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pll;\n#define all(v) v.begin(), v.end()\n#define YES cout << \"YES... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n vector<vector<int>>adj(n);\n \n for(int i=0;i<n-1;i++)\n {\n adj[i].push_back(i+1);\n }\n \n vector<int>distance(n,0),ret;\n... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> dist(n,0);\n for(int i=0;i<n;i++){\n dist[i]=i;\n }\n vector<int> adj[n];\n for(int i=0;i<n-1;i++){\n adj[i].push_back(i+1... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "#include <vector>\nusing namespace std;\n\nclass Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n \n \n \n int N=n;\n constexpr int X = 501;\n int lookup[X][X] = {0};\n \n \n vecto... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n\n int m=queries.size();\n\n vector<vector<int>> mp(n);\n\n for(int i=0;i<n-1;i++){\n\n mp[i].push_back(i+1);\n }\n\n vector<int> ans(m,INT_MAX);\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n\n int n;\n unordered_map<int, vector<int>> adj_map;\n\n vector<int> shortestDistanceAfterQueries(int m, vector<vector<int>>& queries) {\n n = m;\n\n for (int i = 1; i < n; i++) \n adj_map[i-1].push_back(i);\n\n vector<int> res;\n f... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void bfs(vector<vector<int>>& graph, vector<int>& dist) {\n queue<pair<int,int>> q;\n int src = 0;\n \n q.push({src, 0});\n while(!q.empty()) {\n auto front = q.front();\n q.pop();\n\n int curNode = front.fir... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> helper(int n, vector<vector<int>>& queries) {\n \n unordered_map<int, vector<pair<int, int>>> graph;\n for (int i = 0; i < n - 1; ++i) {\n graph[i].push_back({i + 1, 1});\n }\n\n\n vector<int> dist = dijkstra(graph, n, 0)... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\n void dijkstra(vector<vector<int>>&adj, vector<int>&dist, int n) {\n priority_queue <int, vector<int>, greater<int>>pq;\n dist.assign(n, INT_MAX);\n pq.push(0);\n dist[0]=0;\n while (!pq.empty()) {\n int u = pq.top();\n pq.po... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries_BellanFord(int n, vector<vector<int>>& queries)\n {\n vector<int> result;\n vector<int> dist(n, INT_MAX);\n vector<vector<int>> adjList(n, vector<int>(n, 0));\n\n for(int i=0; i<n-1; i++)\n {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n void dijk(int src,vector<int>&dist,vector<vector<int>>&adj){\n priority_queue<vector<int>,vector<vector<int>>,greater<vector<int>>>pq;\n dist[0]=0;\n pq.push({0,src});\n while(!pq.empty()){\n auto it=pq.top();\n pq.pop();\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "auto optimize_cpp_stdio = []()\n{\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n return 0;\n}();\nclass Solution\n{\npublic:\n const static int maxn = 1e5 + 10;\n const static int maxm = 1e5 + 10;\n const static long long mod = 1e9 + 7;\n co... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> ans, dist(n, INT_MAX);\n vector<vector<int>> adj(n);\n\n for(int i=0; i<n-1; i++){\n adj[i].push_back(i+1);\n }\n\n int idx = 0, m = que... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<long long int> >dist(n,vector<long long int>(n,INT_MAX));\n int i,j,k;\n for(i=0;i<n;i++)\n {\n dist[i][i]=0;\n }\n for(i=0;i<n... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "// class Solution {\n// public:\n// int dfs(int i, int n, vector<vector<int>>&adj){\n// if(i==n-1) return 0;\n// int ans = INT_MAX;\n// for(auto nb:adj[i]){\n// ans = min(ans, 1+dfs(nb,n,adj));\n// }\n// return ans;\n// }\n// vector<int> short... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> ans;\n\n vector<vector<int>> paths;\n\n for (int i=0;i<n;i++) {\n vector<int> v(n,0);\n for (int j=i;j<n;j++) {\n v[j]=j-i;\... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector <int> ans;\n vector <int> dist(n);\n vector <int> adj[n];\n for(int i = 0; i < n; i++){\n dist[i] = i;\n if(i < n-1)adj[i].push_back(i+1)... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\nvoid findDist(int src, int d, vector<int>&dist, unordered_map<int, vector<int>>&adj){\n \n int n=dist.size();\n queue<int>q;\n q.push(src);\n while(!q.empty()){\n int sz=q.size();\n while(sz--){\n int node=q.front();\n q.pop();\... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n,\n vector<vector<int>>& queries) {\n\n vector<vector<int>> net(n);\n\n for (int i = 0; i < n - 1; i++) {\n net[i].push_back(i + 1);\n }\n\n int nn... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 0 | {
"code": "class Solution {\npublic:\n\n int BFS(vector<vector<int>>&list){\n queue<int>q;\n q.push(0);\n int count=0;\n vector<bool>visited(list.size(),0);\n // for(int i=0;i<list.size();i++){\n // for(int j=0;j<list[i].size();j++){\n // cout<<list[i][j... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "class Solution {\npublic:\n int dijkstra(map<int,vector<int>> & mp, int n){\n\n vector<int> dist(n, INT_MAX);\n dist[0] = 0;\n\n //min heap to store // distance, node\n priority_queue<pair<int,int> , vector<pair<int,int>> , greater<pair<int,int>>> pq;\n\n pq.push({0,0... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int>ans;\n vector<int>temp(n,0);\n unordered_map<int,vector<int>>mp;\n for(int i=1;i<n;i++)\n {\n mp[i].push_back(i-1);\n temp[i]+... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "\n#pragma GCC optimize('O3,unroll-loops')\n#pragma GCC target('avx2,bmi,bmi2,lzcnt,popcnt')\nstatic const bool __boost = []()\n{\n cin.tie(nullptr);\n cout.tie(nullptr);\n return std::ios_base::sync_with_stdio(false);\n}();\n\nclass Solution {\npublic:\n \n int shorestDistance(int n , unordered_ma... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adj(n);\n for(int i=0;i<n-1;i++)\n adj[i].push_back(i+1);\n int q=queries.size();\n vector<int> ans;\n int i=0;\n while(i... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "class Solution {\npublic:\n int N ; \n int func(map<int,vector<int>> &m){\n\n int ans = 0 ; \n\n queue<int> q;\n vector<int> visi(N); ; \n q.push(0); \n visi[0]=1;\n while(!q.empty()){\n int s = q.size();\n for(int i=0;i<s ; i++){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 2 | {
"code": "class Solution {\npublic:\n // Function to perform BFS and find the shortest path\n void findDist(int start, int end, vector<int> adj[], vector<int>& dist) {\n queue<int> q;\n dist[start] = 0; // Starting node has a distance of 0\n q.push(start);\n\n // Perform BFS\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int solve(vector<vector<int>>&adj,int n){\n queue<pair<int,int>>q;\n vector<int>vis(n+1,0);\n q.push({0,0});\n while(!q.empty()){\n int k=q.size();\n while(k--){\n int node=q.front().first;\n int ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<vector<int>>&adj,int n){\n vector<int>dist(n,INT_MAX);\n dist[0]=0;\n queue<int>q;\n q.push(0);\n while(!q.empty()){\n auto x=q.front();\n q.pop();\n for(auto y:adj[x]){\n if(dis... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n unordered_map<int, list<int>> adj;\n int bfs(int n) {\n vector<int> dist(n, INT_MAX);\n queue<int> q;\n q.push(0);\n dist[0] = 0;\n\n while (!q.empty()) {\n int node = q.front();\n q.pop();\n\n for (int ne... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n #define pi pair<int, int>\n vector<list<pi>> graph;\n int dijkstra(int n){\n vector<int> dist(n, 1e9);\n dist[0] = 0;\n queue<pi> pq;\n pq.push({0, 0});\n\n while(! pq.empty()){\n auto ele = pq.front();\n int cd =... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n void bfs(vector<int> adj[],int src,vector<int>& dist)\n {\n queue<pair<int,int>> q;\n dist[src]=0;\n q.push({dist[src],src});\n while(!q.empty())\n {\n int d=q.front().first;\n int u=q.front().second;\n q.... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n \nqueue<pair<int,int>> q;\n\n int bfs(vector<vector<int>> &graph , int src , int des){\n\n int n = graph.size();\n vector<int> vis(n,0);\n q.push({0, 0});\n vis[0] = 1;\n vector<int> distance(n , 1e9);\n distance[0] =0 ;\n\n while(!q.empty()){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> adj[n];\n\n for(int i = 0; i < n-1; i++){\n adj[i].push_back(i+1);\n }\n\n vector<int> result;\n vector<int> distance(n,0);\n for... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int solve(int n,vector<int> adj[]){\n vector<int> vis(n+1,0);\n queue<pair<int,int>> q;\n // dis, node\n q.push({0,0});\n vis[0]=1;\n\n int ans = INT_MAX;\n while(!q.empty()){\n auto node = q.front();\n q... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adjacencyList(n);\n for(int i{0}; i < n-1; i++) {\n adjacencyList[i].push_back(i+1);\n }\n\n vector<int> ans;\n for(vector<int> ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<vector<int>> &adj, int src, int dest, int n) {\n vector<int> visited(n, 0);\n vector<int> distance(n, -1); // To store the distances from the source\n\n queue<int> q;\n q.push(src);\n visited[src] = 1;\n distance[src] = 0; // Distance from the... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n void dfs(int node, vector<vector<int>>&adj, vector<int>&vis, stack<int>&st){\n vis[node] = 1;\n for(auto it:adj[node]){\n if(!vis[it]){\n dfs(it, adj, vis, st);\n }\n }\n st.push(node);\n }\n vector<int> s... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "#define ll long long\n\nclass Solution {\npublic:\n ll solve(ll s, ll e, const vector<vector<ll>>& adj,ll n) {\n vector<ll> d(n, -1);\n d[s] = 0;\n queue<ll> q;\n q.push(s);\n while (!q.empty()) {\n ll f = q.front();\n q.pop();\n if (f ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n unordered_map<int, vector<int>> mp;\n vector<int> res;\n for(int i=0; i<n-1; ++i)\n mp[i].push_back(i+1);\n for(auto query : queries){\n mp[quer... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "#define lli long long int\n#define VROOM_VROOM ios_base::sync_with_stdio(false);cin.tie(NULL);\n#define vi vector<long long int>\n#define smol INT_LEAST64_MIN\n#define thicc INT_LEAST64_MAX\n#define space <<\" \"<< \n#define all(x) x.begin(),x.end()\n#define yes cout<<\"YES\\n\" \n#define no cout<<\"NO\\n\... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n \n void bfs(int src,vector<unordered_set<int>> &graph,vector<int> &dist,vector<int> &par){\n queue<int> q;\n q.push(src);\n dist[src]=0;\n while(!q.empty()){\n int parent=q.front();\n q.pop();\n for(int nbr:graph... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> res;\n vector<int> graph[n];\n\n for(int i=0; i<n; ++i){\n if(i < n-1) graph[i].push_back(i+1);\n }\n for(auto q: queries){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> adj;\n int n;\n int bfs(){\n queue<pair<int,int>> st;\n st.push({0,0});\n vector<int> vis(n,0);\n while(st.size()){\n int x=st.front().first;\n int d=st.front().second;\n st.pop();\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> adj;\n int n;\n int f() {\n vector<int> v(n);\n vector<int> d(n);\n\n queue<pair<int, int>> q;\n v[0]=0;\n q.push({0, 0});\n \n int ans = 0;\n \n while(!q.empty()) {\n auto it ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "template <typename DistanceType, typename Comp = std::greater<>>\nclass Dijkstra {\npublic:\n constexpr static DistanceType INF =\n std::numeric_limits<DistanceType>::max();\n\n typedef std::pair<DistanceType, int> Edge;\n typedef std::pair<DistanceType, int> Node;\n\npublic:\n Dijkstra(... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\nprivate:\n vector<vector<int>> mp;\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n mp = vector<vector<int>>(n);\n vector<int> res;\n for (int i = 0; i < n; i++)\n mp[i].push_back(i + 1);\n for (vecto... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\n public:\n vector<int> shortestDistanceAfterQueries(int n,\n vector<vector<int>>& queries) {\n vector<vector<int>> nexts(n, vector<int>());\n for (int i = 1; i < n; i++) nexts[i - 1].push_back(i);\n vector<int> ans;\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "#include <bits/stdc++.h>\nusing namespace std;\n#define vii vector<vector<int>>\n#define vi vector<int>\n#define pb push_back\n#define fi first\n#define se second\n#define s(v) sort(v.begin(), v.bpp())\n#define r(v) reverse(v.begin(), v.bpp())\n\nclass Solution {\nprivate:\nvoid dij(int src, vector<vector<... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int> ans;\n vector<vector<pair<int,int>>> adj(n);\n vector<int> dist(n, INT_MAX);\n vector<int> vis(n, 0);\n\n // Initial graph\n for (int i = 0; i < n - 1; ++i) {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n// vector<vector<int>> graph(n);\n// vector<int> dist(n, n);\n// dist[0] = 0;\n// auto bfs = [&](int start) {\n// vector<int> newDist(n, n);\... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "typedef pair<int, int> pii;\nstruct compare {\n bool operator()(pii p1, pii p2) {\n return p1.first > p2.first;\n }\n};\nclass Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) { \n vector<int> result(queries.size());\n vector<... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int distance(vector <vector <int>> &adj) {\n queue <pair <int,int>> q;\n vector <int> dis;\n for(int i = 0;i<adj.size();i++) dis.push_back(i+1);\n q.push({0,0});\n while(!q.empty()) {\n int path = q.front().second;\n in... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<int> adj[],int n){\n int cnt=0;\n queue<int> q;\n q.push(0);\n vector<int> vis(n,0);\n vis[0]=1;\n while(!q.empty()){\n int c=q.size();\n cnt++;\n while(c--){\n int node=q... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<int>*adj, int n)\n {\n queue<int> q;\n q.push(0);\n vector<int> vis(n,0);\n int steps=0;\n while (!q.empty())\n {\n \n int xx = q.size();\n for (int i=0 ; i<xx ;i++)\n {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adj(n , vector<int>(n)) ;\n for(int i = 0 ; i < n - 1 ; i ++) adj[i].push_back(i + 1) ;\n vector<int> ans ;\n for(vector<int> i : queries){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n template <typename T>\n class graph {\n public:\n struct edge {\n int from;\n int to;\n T cost;\n };\n\n vector<edge> edges;\n vector<vector<int>> g;\n vector<int> degree;\n int n;\n\n exp... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n void topo(vector<int>* adj, vector<int>in, vector<int>& toposort){\n\n queue<int> q;\n q.push(0);\n\n while(!q.empty()){\n int node = q.front();\n toposort.push_back(node);\n q.pop();\n\n for(auto i : adj[node])... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int dijisktra(vector<vector<int>>& adjList, int src, int n) {\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n pq.push({0, src});\n vector<bool> vis(n, false);\n while(!pq.empty()) {\n int wei = pq.top... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<int> adj[], int start, int end) {\n queue<int>q;\n\n if(start == end) return 0;\n\n q.push(start);\n\n unordered_set<int>seen;\n\n int ans = 1;\n\n while(!q.empty()) {\n int sz = q.size();\n for(in... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& q) {\n vector<int>adj[n];\n for(int i=0; i<n-1; i++){\n adj[i].push_back(i+1);\n }\n vector<int>ans;\n for(int i=0; i<q.size(); i++){\n adj[q[i][0]].p... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n vector<int> dis(n, 0);\n for (int i = 0; i < n; i++) {\n dis[i] += i;\n }\n\n vector<vector<int>> graph(n, vector<int>{});\n for (int i = ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int callBfs(vector<vector<int>>&v){\n queue<int>q;\n vector<int>seen(v.size(),0);\n \n int ans = 1e9;\n int depth = 0;\n \n q.push(0);\n seen[0]++;\n \n while(!q.empty()){\n int sz = q.size();\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "\n\n\n// COPY ALL MACROS BELOW\n\ntypedef long long LL;\n#define MP make_pair\n#define PB push_back\n#define F first\n#define S second\n#define LB lower_bound\n#define UB upper_bound\n#define SZ(x) ((int)x.size())\n#define LEN(x) ((int)x.length())\n#define ALL(x) begin(x), end(x)\n#define RSZ resize\n#defi... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\nprivate:\n void bfs_traversal(vector<vector<int>>& adjList,vector<int>& paths,vector<int>& query){\n set<int>visited;\n paths[query[1]]=min(paths[query[1]],paths[query[0]]+1);\n int dist=paths[query[1]];\n queue<int>q;\n q.push(query[1]);\n vis... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n vector<int> res;\n vector<vector<pair<int, int>>> graph(n + 1);\n \n for (int i = 0 ; i < n ; ++i) {\n graph[i].emplace_back(i + 1, 1);\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adjL(n);\n for(int i = 0; i < n - 1; i++)\n adjL[i].push_back(i + 1);\n vector<int> ans;\n for(vector<int> &q: queries)\n {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n unordered_map<int, int> memo;\n\n int helper(int root, int end, vector<vector<int>>& adj) {\n if (root == end) {\n return 0;\n }\n if (memo.find(root) != memo.end()) {\n return memo[root];\n }\n int minDist = end;\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(const vector<vector<int>>& neighbors) {\n vector<int> visited;\n for(int i = 0; i < neighbors.size(); ++i) {\n visited.push_back(false);\n }\n queue<int> q;\n q.push(0);\n queue<int> dist;\n dist.push(0);\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\nprivate:\n vector<vector<int>> neighbors;\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n // neighbors[i] is the neighbors of city i (directed)\n vector<vector<int>> neighbors(n, vector<int>());\n for (int i = 0; i < ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int>adj[n];\n vector<int>ans;\n for(int i=0;i<n-1;i++)\n {\n adj[i].push_back(i+1);\n \n }\n for(int i=0;i<queries.size();... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& qu) {\n int q = qu.size();\n vector<int> v;\n vector<vector<int>> adj(n);\n for(int i = 1; i < n; i ++) adj[i - 1].push_back(i);\n for(int i = 0; i < q; i ++){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> graph;\n vector<int> ans;\n graph.assign(n, {});\n for(int i = 1 ; i < n ; i++){\n graph[i-1].push_back(i);\n }\n int q =... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int solve(map<int,set<int>> &mp,int n,int i,unordered_map<int, int>& memo){\n if(i==n){\n return -1;\n }\n\n if (memo.find(i) != memo.end()) {\n return memo[i];\n }\n\n int val = INT_MAX;\n for(auto s : mp[i]){\n... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adjList(n, vector<int>());\n for(int i = 0; i < n-1; i++){\n adjList[i].push_back(i+1);\n }\n\n vector<int> ans;\n for(auto &que... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int>ans;\n map<int, vector<int>>adj_list;\n for(int i=0; i<n-1; i++){\n adj_list[i].push_back(i+1);\n }\n for(auto x: queries){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int path(vector<vector<int>> &g) {\n vector<bool> v(g.size(), false);\n queue<vector<int>> q;\n q.push({0, 0});\n while(!q.empty()) {\n int x = q.front()[0], d = q.front()[1];\n q.pop();\n for(int y: g[x]) {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& q) {\n \n vector<int> ans;vector<int> dp(n,INT_MAX);dp[0]=0;\n\n vector<int> graph[n];\n \n for(int i=0;i<n-1;i++)\n {\n graph[i+1].push_back(i);\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int bfs(vector<vector<int>>&adj, int curr,int n){\n queue<pair<int,int>>q;\n q.push({0,0});\n vector<int>is_visited(n,0);\n \n while(q.size()>0){\n int par=q.front().first;\n int wt=q.front().second;\n q.pop(... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n \n vector<vector<int>>arr(n);\n for(int i=0; i<n-1; i++)\n arr[i].push_back(i+1);\n \n vector<int>res;\n for(vector<int>x:queries)\n {... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adj(n);\n for(int i=0; i<n-1; i++) {\n adj[i].push_back(i+1);\n }\n vector<int> ans;\n for(auto x: queries) {\n adj[x... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<int>adj[n];\n for(int i=0;i<n;i++){\n adj[i].push_back(i+1);\n }\n vector<int>ans;\n int m=queries.size();\n for(int i=0;i<m;i++){\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <climits>\n\nusing namespace std;\n\nclass Solution {\npublic:\n // Function to perform BFS and find the shortest path\n int bfs(int start, int end, unordered_map<int, vector<int>>& adj) {\n queue... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> prev(n);\n for(int i = 1; i < n; i++) {\n prev[i].push_back(i-1);\n }\n vector<int> result;\n for(auto& query: queries) {\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n int solve(int n,map<int,vector<int>>&mp,vector<int>&dp)\n {\n if(n == 0)return 0;\n\n if(dp[n] !=-1)return dp[n];\n int maxi = INT_MAX;\n vector<int>v = mp[n];\n for(int i = 0;i<v.size();i++)\n {\n int ans = solve(v[i],mp,dp);\n... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n unordered_map<int, vector<int>> graph;\n \n // Initialize the graph with initial unidirectional roads\n for (int i = 0; i < n - 1; ++i) {\n graph[i].push_b... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\nint bfs(int source, int target, unordered_map<int, vector<int>>& graph, int n) {\n queue<pair<int, int>> q; \n unordered_set<int> visited;\n q.push({source, 0});\n while (!q.empty()) {\n auto [current_node, current_distance] = q.front();\n q.pop();\n ... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adj(n);\n for (int i = 0; i < n - 1; ++i) {\n adj[i].push_back(i + 1); \n }\n\n unordered_set<int> visited; \n vector<int> answe... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>>& queries) {\n vector<vector<int>> adj(n);\n for (int i = 0; i < n - 1; ++i) {\n adj[i].push_back(i + 1); \n }\n\n unordered_set<int> visited; \n vector<int> answe... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "class Solution {\npublic:\n\n vector<int> dij(vector<vector<int>> &adj)\n{\n int n=adj.size();\n vector<int> d(n,INT_MAX);\n vector<bool> visited(n,false);\n\n d[0] = 0;\n int cur = 0;\n \n unordered_set<int> store;\n while (true) {\n visited[cur] = true;\n for (auto v... |
3,517 | <p>You are given an integer <code>n</code> and a 2D integer array <code>queries</code>.</p>
<p>There are <code>n</code> cities numbered from <code>0</code> to <code>n - 1</code>. Initially, there is a <strong>unidirectional</strong> road from city <code>i</code> to city <code>i + 1</code> for all <code>0 <= i < ... | 3 | {
"code": "#include <vector>\n#include <queue>\n#include <climits>\n\nusing namespace std;\n\nclass Solution {\n int bfs(int dest, vector<vector<int>>& adj, int last) {\n queue<pair<int, int>> q;\n q.push({0, 0});\n vector<int> distance(501, INT_MAX);\n distance[0] = 0;\n\n while... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.