oj.uz

Submission #494195

# Submission time Handle Problem Language Result Execution time Memory
494195 2021-12-14T18:20:27 Z Carmel_Ab1 Crocodile's Underground City (IOI11_crocodile) C++17
100 / 100
 573 ms 89656 KB 
#include <bits/stdc++.h>
//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld, ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T>
ostream &operator<<(ostream &os, vector<T> &a) {
    os << "[";
    for (int i = 0; i < ll(a.size()); i++) { os << a[i] << ((i != ll(a.size() - 1) ? " " : "")); }
    os << "]\n";
    return os;
}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> &p) {
    os << "" << p.first << " " << p.second << "";
    return os;
}

void usaco(string taskname) {
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char *FIN = fin.c_str();
    const char *FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}

template<typename T>
void read(vector<T> &v) {
    int n = v.size();
    for (int i = 0; i < n; i++)
        cin >> v[i];
}

template<typename T>
vector<T> UNQ(vector<T> a) {
    vector<T> ans;
    for (T t: a)
        if (ans.empty() || t != ans.back())
            ans.push_back(t);
    return ans;
}

ll ceil(ll a, ll b) {
    ll ans = a / b;
    if (a % b)ans++;
    return ans;
}

ld log(ld a, ld b) { return log(b) / log(a); }

ll power(ll base, ll exp, ll M = 1e18) {//(base^exp)%M
    ll ans = 1;
    while (exp) {
        if (exp % 2 == 1)ans = ((ans % M) * (base % M)) % M;
        base = ((base % M) * (base % M)) % M;
        exp /= 2;
    }
    return ans;
}

string to_base(int n, int new_base) {
    string s;
    int nn = n;
    while (nn) {
        s += to_string(nn % new_base);
        nn /= new_base;
    }
    reverse(all(s));
    return s;
}

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    ll x = (a / gcd(a, b));
    return b * x;
}

vl generate_array(ll n, ll mn = 1, ll mx = 1e18 + 1) {
    if (mx == 1e18 + 1)
        mx = n;
    vl ans(n);
    for (int i = 0; i < n; i++)
        ans[i] = (mn + rand() % (mx - mn + 1));
    return ans;
}

string substr(string s, int l, int r) {
    string ans;
    for (int i = l; i <= r; i++)
        ans += s[i];
    return ans;
}


#include "crocodile.h"

vector<vpl> g;



int travel_plan(int N, int M, int R[][2], int L[], int K, int P[]){
    g.resize(N);

    for(int i=0; i<M;i++){
        ll u=R[i][0],v=R[i][1],w=L[i];
        g[u].pb({v,w});
        g[v].pb({u,w});
    }

    vi vis(N);
    vl dp1(N,1e9),dp2(N,1e9);
    priority_queue<pl,vpl,greater<pl>>pq;

    for(int i=0; i<K; i++)
        dp1[P[i]]=dp2[P[i]] = 0, pq.push({0, P[i]});



    while(pq.size()){
        pl p=pq.top();
        pq.pop();

        ll src=p.second,w=p.first;

        if(dp2[src]<w)
            continue;

        for(pl nbr:g[src]){
            ll cur=nbr.second+w;
            if(cur<dp1[nbr.first])
                swap(cur,dp1[nbr.first]);
            if(cur<dp2[nbr.first]){
                dp2[nbr.first]=cur;
                pq.push({dp2[nbr.first],nbr.first});
            }
        }


    }

    return dp2[0];
}

Compilation message

crocodile.cpp: In function 'void usaco(std::string)':
crocodile.cpp:54:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
crocodile.cpp:55:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
46.0 / 46.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct

Subtask #2
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 3 ms 1100 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 436 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 460 KB Output is correct
12 Correct 3 ms 972 KB Output is correct
13 Correct 3 ms 1100 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 436 KB Output is correct
16 Correct 412 ms 81652 KB Output is correct
17 Correct 84 ms 17920 KB Output is correct
18 Correct 99 ms 20440 KB Output is correct
19 Correct 573 ms 89656 KB Output is correct
20 Correct 275 ms 65612 KB Output is correct
21 Correct 33 ms 8120 KB Output is correct
22 Correct 292 ms 62480 KB Output is correct