Submission #961797

#	Time	Username	Problem	Language	Result	Execution time	Memory
961797		ErJ	Shortcut (IOI16_shortcut)	C++17	0 / 100	2066 ms	604 KiB

shortcut

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define vi vector<ll>
#define pp pair<ll, ll>
#define inf 1000000000000000
#define vvi vector<vi>
#define vp vector<pp>
#define vvp vector<vp>
#define rep(i, n) for(int i = 0; i < n; i++)
#define mod 1000000007

vvp edges;
vi dist;
void dijkstra(ll u) {
    dist[u] = 0;
    priority_queue<pp> pq;
    pq.push({ 0, u });
    while (!pq.empty()) {
        ll d = -pq.top().first;
        ll v = pq.top().second;
        pq.pop();
        if (dist[v] < d) {
            continue;
        }
        for (int i = 0; i < edges[v].size(); i++) {
            ll w = edges[v][i].first;
            ll dw = edges[v][i].second;
            if (dist[w] > dw + dist[v]) {
                pq.push({ -dw - dist[v], w });
                dist[w] = dw + dist[v];
            }
        }
    }
}

ll diameter() {
    ll maxdist = -1;
    rep(i, edges.size()) {
        dist.clear();
        dist.resize(edges.size());
        rep(i, dist.size()) {
            dist[i] = inf;
        }
        dijkstra(i);
        rep(i, dist.size()) {
            maxdist = max(maxdist, dist[i]);
        }
    }
    return maxdist;
}

ll find_shortcut(int n, vector<int> l, vector<int> d, int c) {
    ll ans = inf;   
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            edges.clear();
            edges.resize(2 * n);
            rep(k, l.size()) {
                edges[k].push_back({ k + 1, l[k] });
                edges[k + 1].push_back({ k, l[k] });
            }
            rep(k, n) {
                edges[k].push_back({ k + n, d[k] });
                edges[k + n].push_back({ k, d[k] });
            }
            edges[i].push_back({ j, c });
            edges[j].push_back({ i, c });
            ans = min(ans, diameter());
        }
    }
    return ans;
}

Compilation message (stderr)

shortcut.cpp: In function 'void dijkstra(long long int)':
shortcut.cpp:27:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |         for (int i = 0; i < edges[v].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
shortcut.cpp: In function 'long long int diameter()':
shortcut.cpp:11:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define rep(i, n) for(int i = 0; i < n; i++)
......
   40 |     rep(i, edges.size()) {
      |         ~~~~~~~~~~~~~~~             
shortcut.cpp:40:5: note: in expansion of macro 'rep'
   40 |     rep(i, edges.size()) {
      |     ^~~
shortcut.cpp:11:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define rep(i, n) for(int i = 0; i < n; i++)
......
   43 |         rep(i, dist.size()) {
      |             ~~~~~~~~~~~~~~          
shortcut.cpp:43:9: note: in expansion of macro 'rep'
   43 |         rep(i, dist.size()) {
      |         ^~~
shortcut.cpp:11:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define rep(i, n) for(int i = 0; i < n; i++)
......
   47 |         rep(i, dist.size()) {
      |             ~~~~~~~~~~~~~~          
shortcut.cpp:47:9: note: in expansion of macro 'rep'
   47 |         rep(i, dist.size()) {
      |         ^~~
shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:11:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | #define rep(i, n) for(int i = 0; i < n; i++)
......
   60 |             rep(k, l.size()) {
      |                 ~~~~~~~~~~~         
shortcut.cpp:60:13: note: in expansion of macro 'rep'
   60 |             rep(k, l.size()) {
      |             ^~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 14
• Subtask 3: 0 / 8
• Subtask 4: 0 / 7
• Subtask 5: 0 / 33
• Subtask 6: 0 / 22
• Subtask 7: 0 / 4
• Subtask 8: 0 / 3