제출 #526620

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526620		Lobo	Robot (JOI21_ho_t4)	C++17	0 / 100	2 ms	332 KiB

Main

#include<bits/stdc++.h>
using namespace std;

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

#define maxn 2100

int n, m, d[maxn][maxn], fq[maxn];
vector<pair<int,pair<int,int>>> g[maxn];

void shp() {
    for(int i = 1; i <= n; i++) {
        for(int j = 0; j <= n; j++) {
            d[i][j] = inf;
        }
    }
    d[1][0] = 0;
    priority_queue<pair<int,pair<int,int>>> pq;
    pq.push(mp(0,mp(1,0)));

    while(pq.size()) {
        int dist = -pq.top().fr;
        int u = pq.top().sc.fr;
        int ant = pq.top().sc.sc;
        pq.pop();

        if(dist != d[u][ant]) continue;

        for(int i = 0; i < g[u].size(); i++) {
            int v = g[u][i].fr;
            int c = g[u][i].sc.fr;
            int w = g[u][i].sc.sc;

            if(v == ant) w = 0;

            fq[c]+= w;
        }

        for(int i = 0; i < g[u].size(); i++) {
            int v = g[u][i].fr;
            int c = g[u][i].sc.fr;
            int w = g[u][i].sc.sc;
            // cout << " " << v << " " << d[v][0] << endl;

            if(v == ant) w = 0;

            //vai apagando todos com cor igual menos ele
            if(d[v][0] > d[u][ant] + fq[c]-w) {
                d[v][0] = d[u][ant] + fq[c]-w;
                pq.push(mp(-d[v][0],mp(v,0)));
            }

            //vai apagar somente ele mesmo
            if(d[v][u] > d[u][ant] + w) {
                d[v][u] = d[u][ant] + w;
                pq.push(mp(-d[v][u],mp(v,u)));
            }
        }

        for(int i = 0; i < g[u].size(); i++) {
            int v = g[u][i].fr;
            int c = g[u][i].sc.fr;
            int w = g[u][i].sc.sc;

            if(v == ant) w = 0;

            fq[c]-= w;
        }
    }
}

void solve() {
    cin >> n >> m;

    for(int i = 1; i <= m; i++) {
        int u, v, c, w;
        cin >> u >> v >> c >> w;

        g[u].pb(mp(v,mp(c,w)));
        g[v].pb(mp(u,mp(c,w)));
    }

    shp();

    int ans = inf;
    for(int i = 0; i <= n; i++) {
        ans = min(ans, d[n][i]);
    }

    // for(int i = 1; i <= n; i++) {
    //     for(int j = 0; j < g[i].size(); j++) {
    //         cout << i << " " << j << " " << d[i][j] << endl;
    //     }
    // }

    if(ans == inf) cout << -1 << endl;
    else cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    freopen("in.in", "r", stdin);
    //freopen("out.out", "w", stdout);
    
    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void shp()':
Main.cpp:38:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for(int i = 0; i < g[u].size(); i++) {
      |                        ~~^~~~~~~~~~~~~
Main.cpp:48:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         for(int i = 0; i < g[u].size(); i++) {
      |                        ~~^~~~~~~~~~~~~
Main.cpp:69:26: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i = 0; i < g[u].size(); i++) {
      |                        ~~^~~~~~~~~~~~~
Main.cpp: In function 'int32_t main()':
Main.cpp:112:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |     freopen("in.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 34
• Subtask 2: 0 / 24
• Subtask 3: 0 / 42