Submission #659136

#TimeUsernameProblemLanguageResultExecution timeMemory
659136ssenseCrocodile's Underground City (IOI11_crocodile)C++14
100 / 100
612 ms81088 KiB
#include <bits/stdc++.h> #include "crocodile.h" #define startt ios_base::sync_with_stdio(false);cin.tie(0); typedef long long ll; using namespace std; #define vint vector<int> #define all(v) v.begin(), v.end() #define MOD 1000000007 #define MOD2 998244353 #define MX 1000000000 #define MXL 1000000000000000000 #define PI (ld)2*acos(0.0) #define pb push_back #define sc second #define fr first //#define int long long #define endl '\n' #define ld long double #define NO cout << "NO" << endl #define YES cout << "YES" << endl int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu int travel_plan(int n, int m, int r[][2], int l[], int k, int p[]) { vector<vector<pair<int, ll>>> adj(n, vector<pair<int, ll>>()); vector<pair<ll, ll>> certified(n, {MXL, MXL}); for(int i = 0; i < m; i++) { adj[r[i][1]].pb({r[i][0], l[i]}); adj[r[i][0]].pb({r[i][1], l[i]}); } priority_queue<pair<pair<ll, ll>, int>> q; for(int i = 0; i < k; i++) { certified[p[i]].fr = 0; certified[p[i]].sc = 0; q.push({{0, 0}, p[i]}); } while(!q.empty()) { int u = q.top().sc; pair<ll, ll> dist = q.top().fr; dist.fr*=-1; dist.sc*=-1; q.pop(); if(dist.fr != certified[u].sc || dist.sc != certified[u].fr) { continue; } for(auto edge : adj[u]) { int v = edge.fr; ll len = edge.sc+dist.fr; if(len < certified[v].sc) { certified[v].sc = len; if(len < certified[v].fr) { swap(certified[v].sc, certified[v].fr); } q.push({{-certified[v].sc, -certified[v].fr}, v}); } } } return certified[0].sc; } //int32_t main(){ // startt // int n, m, k; // cin >> n >> m; // int r[m][2], l[m]; // for(int i = 0; i < m; i++) // { // cin >> r[i][0] >> r[i][1]; // } // for(int i = 0; i < m ; i++) // { // cin >> l[i]; // } // cin >> k; // int p[k]; // for(int i = 0; i < k; i++) // { // cin >> p[i]; // } // cout << travel_plan(n, m, r, l, k, p) << endl; //} /* 5 4 0 1 0 2 3 2 2 4 2 3 1 4 3 1 3 4 */

Compilation message (stderr)

crocodile.cpp: In member function 'void prefix_sum::build(std::vector<int>)':
crocodile.cpp:21:667: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...