oj.uz

답안 #837137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837137 2023-08-25T02:48:21 Z TS_2392 Robot (JOI21_ho_t4) C++17
100 / 100
 1321 ms 113892 KB 
#include <bits/stdc++.h>
using namespace std;

#define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
#define SPEED {ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);}
#define fi first
#define se second

template<class T1, class T2> bool minimize(T1 &a, T2 b){return a > b ? a = b, true : false;}
template<class T1, class T2> bool maximize(T1 &a, T2 b){return a < b ? a = b, true : false;}
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 3;
const ll oo = 1e18;
struct adjNode{
    pii v;
    int c, p;
};
struct elem_in_PQ{
    ll dist;
    int vtx, c;
    bool operator < (const elem_in_PQ &oth) const{
        return dist > oth.dist;
    }
};
int n, m;
map<int, ll> sump[N], d[N];
priority_queue<elem_in_PQ> pq;
map<int, vector<adjNode> > adj[N];
void add_edge(pii a, pii b, int c, int p){
    adj[a.fi][a.se].push_back({b, c, p});
    adj[b.fi][b.se].push_back({a, c, p});
}
int main(){
   	SPEED; fileIO("text");
    cin >> n >> m;
    for(int i = 1; i <= m; ++i){
        int u, v, c, p;
        cin >> u >> v >> c >> p;

        add_edge({u, 0}, {v, 0}, c, p);
        add_edge({u, 0}, {v, c}, c, p);
        add_edge({u, c}, {v, 0}, c, p);

        d[u][c] = oo; d[v][c] = oo;
        sump[u][c] += p; sump[v][c] += p;
    }
    for(int u = 1; u <= n; ++u) d[u][0] = oo;
    d[1][0] = 0; pq.push({0LL, 1, 0});
    while(!pq.empty()){
        pii u = {pq.top().vtx, pq.top().c};
        ll du = pq.top().dist; pq.pop();
        if(du != d[u.fi][u.se]) continue;
        for(auto [v, c, p] : adj[u.fi][u.se]){
            if(u.se == 0){
                if(v.se == 0 && minimize(d[v.fi][v.se], min(1LL * p, sump[u.fi][c] - p) + du)) pq.push({d[v.fi][v.se], v.fi, v.se});
                if(v.se != 0 && minimize(d[v.fi][v.se], du)) pq.push({d[v.fi][v.se], v.fi, v.se});
            }
            else if(minimize(d[v.fi][v.se], sump[u.fi][c] - p + du)) pq.push({d[v.fi][v.se], v.fi, v.se});
        }
    }
    cout << (d[n][0] == oo ? -1 : d[n][0]);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:4:57: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                                  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:35:12: note: in expansion of macro 'fileIO'
   35 |     SPEED; fileIO("text");
      |            ^~~~~~
Main.cpp:4:90: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    4 | #define fileIO(name) if(fopen(name".inp", "r")) {freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);}
      |                                                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:35:12: note: in expansion of macro 'fileIO'
   35 |     SPEED; fileIO("text");
      |            ^~~~~~

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 6 ms 14292 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14676 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 10 ms 15316 KB Output is correct
10 Correct 10 ms 15188 KB Output is correct
11 Correct 9 ms 15004 KB Output is correct
12 Correct 8 ms 14996 KB Output is correct
13 Correct 9 ms 15060 KB Output is correct
14 Correct 8 ms 15060 KB Output is correct
15 Correct 8 ms 14804 KB Output is correct
16 Correct 8 ms 15060 KB Output is correct
17 Correct 9 ms 15064 KB Output is correct
18 Correct 7 ms 14804 KB Output is correct
19 Correct 9 ms 14932 KB Output is correct
20 Correct 8 ms 14932 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 44748 KB Output is correct
2 Correct 77 ms 29824 KB Output is correct
3 Correct 189 ms 46976 KB Output is correct
4 Correct 122 ms 35712 KB Output is correct
5 Correct 1218 ms 112112 KB Output is correct
6 Correct 951 ms 101664 KB Output is correct
7 Correct 481 ms 82484 KB Output is correct
8 Correct 509 ms 81468 KB Output is correct
9 Correct 528 ms 81492 KB Output is correct
10 Correct 404 ms 67552 KB Output is correct
11 Correct 185 ms 56256 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 14292 KB Output is correct
2 Correct 6 ms 14292 KB Output is correct
3 Correct 7 ms 14420 KB Output is correct
4 Correct 6 ms 14292 KB Output is correct
5 Correct 7 ms 14420 KB Output is correct
6 Correct 8 ms 14420 KB Output is correct
7 Correct 8 ms 14676 KB Output is correct
8 Correct 7 ms 14420 KB Output is correct
9 Correct 10 ms 15316 KB Output is correct
10 Correct 10 ms 15188 KB Output is correct
11 Correct 9 ms 15004 KB Output is correct
12 Correct 8 ms 14996 KB Output is correct
13 Correct 9 ms 15060 KB Output is correct
14 Correct 8 ms 15060 KB Output is correct
15 Correct 8 ms 14804 KB Output is correct
16 Correct 8 ms 15060 KB Output is correct
17 Correct 9 ms 15064 KB Output is correct
18 Correct 7 ms 14804 KB Output is correct
19 Correct 9 ms 14932 KB Output is correct
20 Correct 8 ms 14932 KB Output is correct
21 Correct 244 ms 44748 KB Output is correct
22 Correct 77 ms 29824 KB Output is correct
23 Correct 189 ms 46976 KB Output is correct
24 Correct 122 ms 35712 KB Output is correct
25 Correct 1218 ms 112112 KB Output is correct
26 Correct 951 ms 101664 KB Output is correct
27 Correct 481 ms 82484 KB Output is correct
28 Correct 509 ms 81468 KB Output is correct
29 Correct 528 ms 81492 KB Output is correct
30 Correct 404 ms 67552 KB Output is correct
31 Correct 185 ms 56256 KB Output is correct
32 Correct 130 ms 42476 KB Output is correct
33 Correct 172 ms 43124 KB Output is correct
34 Correct 496 ms 68720 KB Output is correct
35 Correct 354 ms 57880 KB Output is correct
36 Correct 398 ms 70252 KB Output is correct
37 Correct 425 ms 76600 KB Output is correct
38 Correct 477 ms 84376 KB Output is correct
39 Correct 147 ms 51820 KB Output is correct
40 Correct 504 ms 82764 KB Output is correct
41 Correct 558 ms 83080 KB Output is correct
42 Correct 638 ms 91136 KB Output is correct
43 Correct 248 ms 50472 KB Output is correct
44 Correct 432 ms 65232 KB Output is correct
45 Correct 442 ms 74212 KB Output is correct
46 Correct 396 ms 72912 KB Output is correct
47 Correct 430 ms 74060 KB Output is correct
48 Correct 1321 ms 113892 KB Output is correct