結果
問題 | No.2325 Skill Tree |
ユーザー |
|
提出日時 | 2023-05-28 14:42:01 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 654 ms / 3,000 ms |
コード長 | 2,968 bytes |
コンパイル時間 | 3,673 ms |
コンパイル使用メモリ | 180,432 KB |
実行使用メモリ | 25,208 KB |
最終ジャッジ日時 | 2024-12-27 02:35:56 |
合計ジャッジ時間 | 24,700 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 36 |
コンパイルメッセージ
main.cpp: In function 'std::vector<long long int> dijkstra(int, std::vector<std::vector<std::pair<int, long long int> > >)': main.cpp:58:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 58 | auto [d, t] = que.top(); | ^ main.cpp:61:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions] 61 | for(auto [e, c] : edge[t]) | ^
ソースコード
#include <algorithm>#include <iomanip>#include <array>#include <bitset>#include <cassert>#include <cmath>#include <cstdio>#include <deque>#include <functional>#include <iostream>#include <iterator>#include <map>#include <queue>#include <set>#include <list>#include <string>#include <sstream>#include <unordered_map>#include <unordered_set>#include <utility>#include <numeric>#include <vector>#include <climits>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using i64 = long long;template<class T, class U>bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }template<class T, class U>bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}template<class T> using pq = priority_queue<T, vector<T>, greater<T>>;const i64 INF = 1e18;vector<i64> dijkstra(int r, vector<vector<pair<int,i64>>> edge){vector<i64> dist(edge.size(), INF);pq<pair<i64, int>> que;dist[r] = 0;que.push({0, r});while(!que.empty()){auto [d, t] = que.top();que.pop();if(d > dist[t]) continue;for(auto [e, c] : edge[t]){if(chmin(dist[e], max(dist[t], c))){que.push({max(dist[t], c), e});}}}return dist;}int main() {i64 n;cin >> n;vector<vector<pair<int, i64>>> edge(n);rep(i, n - 1) {i64 l, a;cin >> l >> a;// cout << "l : " << l << " a : " << a << endl;a--;edge[a].emplace_back(i + 1, l);}vector<i64> dist = dijkstra(0, edge);// cout << "dijkstra end" << endl;vector<i64> dist_copy = dist;sort(all(dist_copy));int q;cin >> q;while(q--) {int query, num;cin >> query >> num;if(query == 1) {int index = upper_bound(all(dist_copy), num) - dist_copy.begin();cout << index << endl;}else{if(dist[num - 1] != INF) cout << dist[num - 1] << endl;else cout << -1 << endl;}}return 0;}