oj.uz

Submission #936146

# Submission time Handle Problem Language Result Execution time Memory
936146 2024-03-01T09:10:05 Z yeediot Robot (JOI21_ho_t4) C++14
34 / 100
 3000 ms 77524 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
const int mxn=6e5+5;
vector<tuple<int,int,int>>adj[mxn];
map<int,int>mp[mxn];
int k,n;
int dij(){
    vector<int>dis(k+1,1e18);
    dis[1]=0;
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    pq.push({0,1});
    while(sz(pq)){
        auto [d,v]=pq.top();
        pq.pop();
        if(d>dis[v])continue;
        for(auto [u,c,w]:adj[v]){
            if(dis[u]>dis[v]+w){
                dis[u]=dis[v]+w;
                pq.push({dis[u],u});
            }
        }
    }
    return dis[n];
}
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int m;
    cin>>n>>m;
    k=n;
    for(int i=0;i<m;i++){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        //debug(a,b);
        adj[a].pb({b,c,d});
        adj[b].pb({a,c,d});
    }

    for(int v=1;v<=n;v++){
        vector<int>sum(m+1),num(m+1),vir(m+1);
        for(auto [u,c,d]:adj[v]){
            if(!c)continue;
            num[c]++;
            sum[c]+=d;
        }
        vector<int>tmp;
        for(auto &[u,c,d]:adj[v]){
            if(c==0)continue;
            if(num[c]==1)d=0;
            else{
                if(!vir[c]){
                    vir[c]=++k;
                    tmp.pb(k);
                }
                //debug(vir[c],u,c);
                adj[vir[c]].pb({u,0,sum[c]-d});
                adj[u].pb({vir[c],0,0});
            }
        }
        for(auto x:tmp){
            //debug(v,x);
            adj[v].pb({x,0,0});
        }
    }
    int ans=dij();
    if(ans==1e18){
        cout<<-1<<'\n';
    }
    else{
        cout<<dij()<<'\n';
    }
}
 /*
 input:
 [v,k] = [1, 6]
[vir[c],u] = [6, 4]
[u,vir[c]] = [4, 6]
[v,k] = [2, 7]
[vir[c],u] = [7, 3]
[u,vir[c]] = [3, 7]
[v,k] = [2, 8]
[vir[c],u] = [8, 4]
[u,vir[c]] = [4, 8]
[v,k] = [3, 9]
[vir[c],u] = [9, 2]
[u,vir[c]] = [2, 9]
[v,k] = [4, 10]
[vir[c],u] = [10, 1]
[u,vir[c]] = [1, 10]
[v,k] = [4, 11]
[vir[c],u] = [11, 5]
[u,vir[c]] = [5, 11]
[v,k] = [4, 12]
[vir[c],u] = [12, 3]
[u,vir[c]] = [3, 12]
[v,k] = [5, 13]
[vir[c],u] = [13, 4]
[u,vir[c]] = [4, 13]
[v,k] = [5, 14]
[vir[c],u] = [14, 3]
[u,vir[c]] = [3, 14]
 */

Compilation message

Main.cpp: In function 'long long int dij()':
Main.cpp:64:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   64 |         auto [d,v]=pq.top();
      |              ^
Main.cpp:67:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   67 |         for(auto [u,c,w]:adj[v]){
      |                  ^
Main.cpp: In function 'int main()':
Main.cpp:93:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   93 |         for(auto [u,c,d]:adj[v]){
      |                  ^
Main.cpp:99:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |         for(auto &[u,c,d]:adj[v]){
      |                   ^
Main.cpp: In function 'void setIO(std::string)':
Main.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 42588 KB Output is correct
2 Correct 9 ms 42724 KB Output is correct
3 Correct 11 ms 42588 KB Output is correct
4 Correct 10 ms 42588 KB Output is correct
5 Correct 9 ms 42756 KB Output is correct
6 Correct 9 ms 42692 KB Output is correct
7 Correct 9 ms 42844 KB Output is correct
8 Correct 9 ms 42844 KB Output is correct
9 Correct 11 ms 43100 KB Output is correct
10 Correct 11 ms 43100 KB Output is correct
11 Correct 11 ms 43164 KB Output is correct
12 Correct 13 ms 43100 KB Output is correct
13 Correct 12 ms 43112 KB Output is correct
14 Correct 11 ms 43332 KB Output is correct
15 Correct 10 ms 42844 KB Output is correct
16 Correct 12 ms 43196 KB Output is correct
17 Correct 11 ms 43096 KB Output is correct
18 Correct 10 ms 42584 KB Output is correct
19 Correct 10 ms 43356 KB Output is correct
20 Correct 11 ms 43352 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 859 ms 61604 KB Output is correct
2 Correct 234 ms 50512 KB Output is correct
3 Correct 983 ms 77524 KB Output is correct
4 Correct 565 ms 55964 KB Output is correct
5 Execution timed out 3015 ms 73812 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 42588 KB Output is correct
2 Correct 9 ms 42724 KB Output is correct
3 Correct 11 ms 42588 KB Output is correct
4 Correct 10 ms 42588 KB Output is correct
5 Correct 9 ms 42756 KB Output is correct
6 Correct 9 ms 42692 KB Output is correct
7 Correct 9 ms 42844 KB Output is correct
8 Correct 9 ms 42844 KB Output is correct
9 Correct 11 ms 43100 KB Output is correct
10 Correct 11 ms 43100 KB Output is correct
11 Correct 11 ms 43164 KB Output is correct
12 Correct 13 ms 43100 KB Output is correct
13 Correct 12 ms 43112 KB Output is correct
14 Correct 11 ms 43332 KB Output is correct
15 Correct 10 ms 42844 KB Output is correct
16 Correct 12 ms 43196 KB Output is correct
17 Correct 11 ms 43096 KB Output is correct
18 Correct 10 ms 42584 KB Output is correct
19 Correct 10 ms 43356 KB Output is correct
20 Correct 11 ms 43352 KB Output is correct
21 Correct 859 ms 61604 KB Output is correct
22 Correct 234 ms 50512 KB Output is correct
23 Correct 983 ms 77524 KB Output is correct
24 Correct 565 ms 55964 KB Output is correct
25 Execution timed out 3015 ms 73812 KB Time limit exceeded
26 Halted 0 ms 0 KB -