oj.uz

Submission #844843

# Submission time Handle Problem Language Result Execution time Memory
844843 2023-09-06T03:53:35 Z 8pete8 Robot (JOI21_ho_t4) C++17
100 / 100
 520 ms 64240 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
//#include "supertrees.h"
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define pb push_back
#define all(x) x.begin(),x.end()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
#define int long long
const int mxn=1e5,mod=998244353,lg=20,root=80,inf=1e18;
void setIO(string name) {
	ios_base::sync_with_stdio(0); cin.tie(0);
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
map<int,int>mp[mxn+10];
map<int,int>mn[mxn+10];
vector<ppii>adj[mxn+10];
int dist[mxn+10];
bitset<mxn+10>vis;
int t[mxn+10];
int32_t main(){
    fastio
    int n,m;cin>>n>>m;
    for(int i=0;i<m;i++){
        int u,v,c,w;cin>>u>>v>>c>>w;
        adj[u].pb({v,{c,w}});
        adj[v].pb({u,{c,w}});
        mp[u][c]+=w;
        mp[v][c]+=w;
    }
    fill(dist,dist+n+1,inf);
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    pq.push({0,1});
    dist[1]=0;
    pii tmp;
    while(!pq.empty()){
        int cur=pq.top().s;
        if(vis[cur]){
            pq.pop();
            continue;
        }
        vis[cur]=true;
        pq.pop();
        //cout<<cur<<'\n';
        for(auto i:adj[cur]){
            if(mn[i.f].find(i.s.f)==mn[i.f].end())mn[i.f][i.s.f]=dist[cur];
            int cost=dist[cur];
            if(mn[cur].find(i.s.f)!=mn[cur].end())cost=mn[cur][i.s.f];
            cost+=(mp[cur][i.s.f]-i.s.s);
            cost=min(cost,dist[cur]+i.s.s);
            if(dist[i.f]>cost){
                dist[i.f]=cost;
                pq.push({dist[i.f],i.f});
            }
        }
    }
    cout<<((dist[n]==inf)?-1:dist[n]);
    return 0;
}

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:32:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:33:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13400 KB Output is correct
2 Correct 3 ms 13400 KB Output is correct
3 Correct 2 ms 13400 KB Output is correct
4 Correct 2 ms 13400 KB Output is correct
5 Correct 3 ms 13400 KB Output is correct
6 Correct 3 ms 13400 KB Output is correct
7 Correct 3 ms 13656 KB Output is correct
8 Correct 3 ms 13656 KB Output is correct
9 Correct 5 ms 13912 KB Output is correct
10 Correct 4 ms 13912 KB Output is correct
11 Correct 3 ms 13656 KB Output is correct
12 Correct 3 ms 13656 KB Output is correct
13 Correct 4 ms 13656 KB Output is correct
14 Correct 3 ms 13656 KB Output is correct
15 Correct 3 ms 13656 KB Output is correct
16 Correct 4 ms 13912 KB Output is correct
17 Correct 3 ms 13656 KB Output is correct
18 Correct 3 ms 13656 KB Output is correct
19 Correct 4 ms 13656 KB Output is correct
20 Correct 4 ms 13660 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 27596 KB Output is correct
2 Correct 34 ms 20816 KB Output is correct
3 Correct 71 ms 27348 KB Output is correct
4 Correct 57 ms 23784 KB Output is correct
5 Correct 500 ms 61828 KB Output is correct
6 Correct 365 ms 56800 KB Output is correct
7 Correct 159 ms 44204 KB Output is correct
8 Correct 172 ms 43932 KB Output is correct
9 Correct 181 ms 43856 KB Output is correct
10 Correct 133 ms 38224 KB Output is correct
11 Correct 53 ms 26704 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13400 KB Output is correct
2 Correct 3 ms 13400 KB Output is correct
3 Correct 2 ms 13400 KB Output is correct
4 Correct 2 ms 13400 KB Output is correct
5 Correct 3 ms 13400 KB Output is correct
6 Correct 3 ms 13400 KB Output is correct
7 Correct 3 ms 13656 KB Output is correct
8 Correct 3 ms 13656 KB Output is correct
9 Correct 5 ms 13912 KB Output is correct
10 Correct 4 ms 13912 KB Output is correct
11 Correct 3 ms 13656 KB Output is correct
12 Correct 3 ms 13656 KB Output is correct
13 Correct 4 ms 13656 KB Output is correct
14 Correct 3 ms 13656 KB Output is correct
15 Correct 3 ms 13656 KB Output is correct
16 Correct 4 ms 13912 KB Output is correct
17 Correct 3 ms 13656 KB Output is correct
18 Correct 3 ms 13656 KB Output is correct
19 Correct 4 ms 13656 KB Output is correct
20 Correct 4 ms 13660 KB Output is correct
21 Correct 63 ms 27596 KB Output is correct
22 Correct 34 ms 20816 KB Output is correct
23 Correct 71 ms 27348 KB Output is correct
24 Correct 57 ms 23784 KB Output is correct
25 Correct 500 ms 61828 KB Output is correct
26 Correct 365 ms 56800 KB Output is correct
27 Correct 159 ms 44204 KB Output is correct
28 Correct 172 ms 43932 KB Output is correct
29 Correct 181 ms 43856 KB Output is correct
30 Correct 133 ms 38224 KB Output is correct
31 Correct 53 ms 26704 KB Output is correct
32 Correct 75 ms 28752 KB Output is correct
33 Correct 60 ms 27344 KB Output is correct
34 Correct 145 ms 41836 KB Output is correct
35 Correct 106 ms 35012 KB Output is correct
36 Correct 136 ms 37196 KB Output is correct
37 Correct 146 ms 41512 KB Output is correct
38 Correct 145 ms 44456 KB Output is correct
39 Correct 75 ms 33360 KB Output is correct
40 Correct 195 ms 45136 KB Output is correct
41 Correct 206 ms 45200 KB Output is correct
42 Correct 238 ms 48580 KB Output is correct
43 Correct 73 ms 30992 KB Output is correct
44 Correct 142 ms 40912 KB Output is correct
45 Correct 140 ms 40272 KB Output is correct
46 Correct 149 ms 39248 KB Output is correct
47 Correct 149 ms 39856 KB Output is correct
48 Correct 520 ms 64240 KB Output is correct