Submission #961807

#	Time	Username	Problem	Language	Result	Execution time	Memory
961807		ErJ	Shortcut (IOI16_shortcut)	C++17	23 / 100	2041 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 1000000000000000000
#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 DFS(int w) {
    queue<int> q;
    q.push(w);
    dist[w] = 0;
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int i = 0; i < edges[u].size(); i++) {
            int v = edges[u][i].first;
            int dv = edges[u][i].second;
            if (dist[v] > dv + dist[u]) {
                dist[v] = dv + dist[u];
                q.push(v);
            }
        }
    }

}

ll diameter() {
    ll maxdist = -1;
    dist.clear();
    dist.resize(edges.size());
    for (int i = edges.size() / 2; i < edges.size(); i++) {
        for (int j = 0; j < dist.size(); j++) {
            dist[j] = inf;
        }
        DFS(i);
        for (int j = 0; j < dist.size(); j++) {
            maxdist = max(maxdist, dist[j]);
        }
    }
    return maxdist;
}

ll find_shortcut(int n, vector<int> l, vector<int> d, int c) {
    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] });
    }
    ll ans = inf;   
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            edges[i].push_back({ j, c });
            edges[j].push_back({ i, c });
            ans = min(ans, diameter());
            edges[i].pop_back();
            edges[j].pop_back();
        }
    }
    return ans;
}

Compilation message (stderr)

shortcut.cpp: In function 'void DFS(int)':
shortcut.cpp:24: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]
   24 |         for (int i = 0; i < edges[u].size(); i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
shortcut.cpp: In function 'long long int diameter()':
shortcut.cpp:40:38: 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]
   40 |     for (int i = edges.size() / 2; i < edges.size(); i++) {
      |                                    ~~^~~~~~~~~~~~~~
shortcut.cpp:41:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for (int j = 0; j < dist.size(); j++) {
      |                         ~~^~~~~~~~~~~~~
shortcut.cpp:45:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for (int j = 0; j < dist.size(); j++) {
      |                         ~~^~~~~~~~~~~~~
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++)
......
   55 |     rep(k, l.size()) {
      |         ~~~~~~~~~~~                 
shortcut.cpp:55:5: note: in expansion of macro 'rep'
   55 |     rep(k, l.size()) {
      |     ^~~

• Subtask 1: 9 / 9
• Subtask 2: 14 / 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