提出 #28653786

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) (int)x.size()
//#define sqr(x) x*x
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
using namespace std;
using namespace __gnu_pbds;

//#define int long long

template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

vector<vector<pair<int, int> > > g;

void solve()
{
    int n, m;
    cin >> n >> m;
    g.resize(3 * n);
    int a[n], b[n];
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        a[i] = (m - a[i]) % m;
    }
    for (int i = 0; i < n; i++)
    {
        cin >> b[i];
    }
    map<int, int> mp;
    int C = 0;
    for (int i = 0; i < n; i++)
    {
        if (!mp.count(a[i]))
        {
            mp[a[i]] = C++;
        }
        if (!mp.count(b[i]))
        {
            mp[b[i]] = C++;
        }
    }
    for (int i = 0; i < n; i++)
    {
        g[i].push_back({n + mp[a[i]], 0});
        g[n + mp[b[i]]].push_back({i, 0});
    }
    vector<pair<int, int> > v;
    for (auto& p : mp)
        v.push_back(p);
    for (int i = 0; i < v.size(); i++)
    {
        int x = v[i].second + n;
        int y = v[(i + 1) % v.size()].second + n;
        int w = (v[(i + 1) % v.size()].first - v[i].first + m) % m;
        g[x].push_back({y, w});
    }
    vector<int> d(3 * n, INT_MAX);
    d[0] = 0;
    set<pair<int, int> > st;
    st.insert({0, 0});
    while (!st.empty())
    {
        auto [dist, v] = *st.begin();
        st.erase(st.begin());
        for (auto& [u, w] : g[v])
        {
            if (d[v] + w < d[u])
            {
                d[u] = d[v] + w;
                st.insert({d[u], u});
            }
        }
    }
    cout << d[n - 1];
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
//    cin >> t;
    t = 1;
    while (t--)
    {
        solve();
    }
    return 0;
}


/*
4 4
1 2 1 3
1 1
1 2
1 3
1 4
*/

提出情報

コンパイルエラー

./Main.cpp: In function ‘void solve()’:
./Main.cpp:55:23: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<int, int> >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   55 |     for (int i = 0; i < v.size(); i++)
      |                     ~~^~~~~~~~~~

ジャッジ結果