# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
844790 |
2023-09-06T00:39:19 Z |
8pete8 |
Robot (JOI21_ho_t4) |
C++17 |
|
827 ms |
25872 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=1e9;
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];
vector<ppii>adj[mxn+10];
int dist[mxn+10],dist2[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}});
//cout<<u<<" "<<v<<" "<<c<<","<<w<<'\n';
mp[u][c]+=w;
mp[v][c]+=w;
}
fill(dist,dist+n+1,-1);
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';
//dist cur ++all-cost-mx
fill(t,t+m+1,INT_MAX);
for(auto i:adj[cur]){
if(!vis[i.f])continue;
t[i.s.f]=min(t[i.s.f],dist[i.f]+mp[cur][i.s.f]);
}
// max thats not the next node and the taken node
for(auto i:adj[cur]){
if(vis[i.f])continue;
int cost=min({t[i.s.f]-i.s.s,dist[cur]+i.s.s,dist[cur]+mp[cur][i.s.f]-i.s.s});
if(mp[cur][i.s.f]==i.s.s)cost=dist[cur];
if(dist[i.f]==-1||dist[i.f]>cost){
dist[i.f]=cost;
pq.push({dist[i.f],i.f});
}
}
}
cout<<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);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
9560 KB |
Output is correct |
2 |
Correct |
2 ms |
9564 KB |
Output is correct |
3 |
Correct |
2 ms |
9564 KB |
Output is correct |
4 |
Correct |
2 ms |
9564 KB |
Output is correct |
5 |
Correct |
2 ms |
9688 KB |
Output is correct |
6 |
Correct |
2 ms |
9564 KB |
Output is correct |
7 |
Correct |
2 ms |
9820 KB |
Output is correct |
8 |
Correct |
2 ms |
9564 KB |
Output is correct |
9 |
Correct |
4 ms |
9816 KB |
Output is correct |
10 |
Correct |
4 ms |
9912 KB |
Output is correct |
11 |
Correct |
3 ms |
9820 KB |
Output is correct |
12 |
Correct |
3 ms |
9820 KB |
Output is correct |
13 |
Correct |
3 ms |
9820 KB |
Output is correct |
14 |
Correct |
3 ms |
9820 KB |
Output is correct |
15 |
Incorrect |
3 ms |
9820 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
719 ms |
21604 KB |
Output is correct |
2 |
Correct |
211 ms |
15196 KB |
Output is correct |
3 |
Incorrect |
827 ms |
25872 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
3 ms |
9560 KB |
Output is correct |
2 |
Correct |
2 ms |
9564 KB |
Output is correct |
3 |
Correct |
2 ms |
9564 KB |
Output is correct |
4 |
Correct |
2 ms |
9564 KB |
Output is correct |
5 |
Correct |
2 ms |
9688 KB |
Output is correct |
6 |
Correct |
2 ms |
9564 KB |
Output is correct |
7 |
Correct |
2 ms |
9820 KB |
Output is correct |
8 |
Correct |
2 ms |
9564 KB |
Output is correct |
9 |
Correct |
4 ms |
9816 KB |
Output is correct |
10 |
Correct |
4 ms |
9912 KB |
Output is correct |
11 |
Correct |
3 ms |
9820 KB |
Output is correct |
12 |
Correct |
3 ms |
9820 KB |
Output is correct |
13 |
Correct |
3 ms |
9820 KB |
Output is correct |
14 |
Correct |
3 ms |
9820 KB |
Output is correct |
15 |
Incorrect |
3 ms |
9820 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |