oj.uz

답안 #587002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587002 2022-07-01T08:00:09 Z keertan Robot (JOI21_ho_t4) C++17
100 / 100
 785 ms 82020 KB 
// GH SAI KEERTAN
#include <bits/stdc++.h>

using namespace std;
#define int  int64_t
#define rep(Begin,End) for (Begin=0;Begin<(End);Begin++)
#define all(x) x.begin(), x.end()
#define all1(x) x.rbegin(), x.rend()
#define sz(x) (int32_t)(x.size())
const int32_t N = 1e5+4, mod =1e9+7;
const int64_t N1=1e18;
const double eps=1e-6,cmp=1e-3;

void solve(){
    int n,m;
    cin>>n>>m;
    int gh=n;
    vector<vector<pair<int,int>>> adj(n+2*m);
    map<pair<int,int>,int> mid;
    vector<int> sum(n+2*m);
    int cur=n;
    auto id=[&](int v,int c)->int{
        auto it=mid.insert({{v,c},n});
        n+=it.second;
        return it.first->second;
    };

    for (int i=1,u,v,c,p;i<=m;i++){
        cin>>u>>v>>c>>p;
        u--,v--;
        adj[u].emplace_back(v,p);
        adj[v].emplace_back(u,p);
        int uid=id(u,c),vid=id(v,c);

        sum[uid]+=p;
        sum[vid]+=p;

        adj[uid].emplace_back(v,-p);
        adj[vid].emplace_back(u,-p);

        adj[u].emplace_back(vid,0);
        adj[v].emplace_back(uid,0);
    }
    for (auto it:mid){
        int par=it.first.first;
        adj[par].emplace_back(it.second,0);
        for (pair<int,int>& jt:adj[it.second]){
            jt.second+=sum[it.second];
        }
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
    vector<int> dis(n,1e18);
    dis[0]=0;
    q.emplace(0,0);
    while(!q.empty()){
        int w,u;
        tie(w,u)=q.top();
        q.pop();
        if (dis[u]!=w){continue;}
        for (pair<int,int>& it:adj[u]){
            if (dis[it.first]>it.second+w){
                dis[it.first]=w+it.second;
                q.emplace(dis[it.first],it.first);
            }
        }
    }
    cout<<(dis[gh-1]==1e18?-1:dis[gh-1]);
}

int32_t main(){
  ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
  int tq = 1;
  //cin>>tq;
  for (;tq--;){solve();}
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:21:9: warning: unused variable 'cur' [-Wunused-variable]
   21 |     int cur=n;
      |         ^~~

Subtask #1
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 2 ms 932 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 4 ms 980 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 2 ms 724 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 192 ms 26180 KB Output is correct
2 Correct 68 ms 12384 KB Output is correct
3 Correct 299 ms 35132 KB Output is correct
4 Correct 126 ms 17560 KB Output is correct
5 Correct 785 ms 82000 KB Output is correct
6 Correct 644 ms 72636 KB Output is correct
7 Correct 404 ms 62576 KB Output is correct
8 Correct 593 ms 60428 KB Output is correct
9 Correct 594 ms 60456 KB Output is correct
10 Correct 375 ms 42312 KB Output is correct
11 Correct 247 ms 32616 KB Output is correct

Subtask #3
42.0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 3 ms 980 KB Output is correct
11 Correct 2 ms 932 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 2 ms 980 KB Output is correct
14 Correct 4 ms 980 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 3 ms 852 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 4 ms 852 KB Output is correct
20 Correct 2 ms 724 KB Output is correct
21 Correct 192 ms 26180 KB Output is correct
22 Correct 68 ms 12384 KB Output is correct
23 Correct 299 ms 35132 KB Output is correct
24 Correct 126 ms 17560 KB Output is correct
25 Correct 785 ms 82000 KB Output is correct
26 Correct 644 ms 72636 KB Output is correct
27 Correct 404 ms 62576 KB Output is correct
28 Correct 593 ms 60428 KB Output is correct
29 Correct 594 ms 60456 KB Output is correct
30 Correct 375 ms 42312 KB Output is correct
31 Correct 247 ms 32616 KB Output is correct
32 Correct 150 ms 33216 KB Output is correct
33 Correct 227 ms 30664 KB Output is correct
34 Correct 407 ms 45296 KB Output is correct
35 Correct 386 ms 35476 KB Output is correct
36 Correct 339 ms 46424 KB Output is correct
37 Correct 417 ms 55076 KB Output is correct
38 Correct 424 ms 64672 KB Output is correct
39 Correct 246 ms 43724 KB Output is correct
40 Correct 569 ms 60468 KB Output is correct
41 Correct 616 ms 60500 KB Output is correct
42 Correct 591 ms 58176 KB Output is correct
43 Correct 236 ms 30528 KB Output is correct
44 Correct 413 ms 51916 KB Output is correct
45 Correct 463 ms 47708 KB Output is correct
46 Correct 429 ms 44500 KB Output is correct
47 Correct 354 ms 51180 KB Output is correct
48 Correct 753 ms 82020 KB Output is correct