oj.uz

Submission #445867

# Submission time Handle Problem Language Result Execution time Memory
445867 2021-07-20T02:54:35 Z cpp219 Robot (JOI21_ho_t4) C++14
0 / 100
 3000 ms 49500 KB 
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 1e5 + 9;
const ll Log2 = 20;
const ll inf = 1e16 + 7;

map<LL,ll> mp,All;
vector<ll> d[N][2];

ll n,m,x,y,c,p,ans = inf;
struct Edge{
    ll to,c,p;
};
vector<Edge> g[N];

struct Node{
    ll val,i,prv,change;
};

bool operator < (Node a,Node b){
    return a.val > b.val;
}
priority_queue<Node> pq;

int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
    #define task "tst"
    if (fopen(task".INP","r")){
        freopen(task".INP","r",stdin);
        //freopen(task".OUT","w",stdout);
    }
    cin>>n>>m;
    while(m--){
        cin>>x>>y>>c>>p;
        mp[{x,y}] = g[x].size(); mp[{y,x}] = g[y].size();
        g[x].push_back({y,c,p}); g[y].push_back({x,c,p});
    }
    for (ll i = 1;i <= n;i++){
        d[i][0].resize(g[i].size() + 3); d[i][1].resize(g[i].size() + 3);
        for (ll j = 0;j < d[i][0].size();j++){
            d[i][0][j] = d[i][1][j] = inf;
            if (i == 1) d[i][0][j] = d[i][1][j] = 0;
        }
        for (auto j : g[i]) All[{i,j.c}] += j.p;
    }
    pq.push({0,1,inf,0});
    while(!pq.empty()){
        //cout<<"?";
        Node t = pq.top(); pq.pop();
        ll u = t.i;
        if (u == n){
            ans = min(ans,t.val);
        }
        for (ll i = 0;i < g[u].size();i++){
            if (i == t.prv) continue;
            ll curC = g[u][i].c,v = g[u][i].to,L = g[u][i].p,change;
            ll cost = All[{u,curC}] - L;
            if (t.prv != inf && g[u][i].c == g[u][t.prv].c && t.change)
                cost -= g[u][t.prv].p;
            change = (L <= cost); cost = min(cost,L);
            assert(t.change <= 1); assert(cost >= 0);
            ll id = mp[{v,u}];
            if (d[v][change][id] > t.val + cost){
                d[v][change][id] = t.val + cost;
                pq.push({t.val + cost,v,id,change});
            }
        }
    }
    if (ans != inf) cout<<ans;
    else cout<<-1;
}

Compilation message

Main.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
Main.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
Main.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
Main.cpp: In function 'int main()':
Main.cpp:49:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (ll j = 0;j < d[i][0].size();j++){
      |                       ~~^~~~~~~~~~~~~~~~
Main.cpp:63:25: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (ll i = 0;i < g[u].size();i++){
      |                       ~~^~~~~~~~~~~~~
Main.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7304 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 4 ms 7404 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 12 ms 7688 KB Output is correct
8 Correct 7 ms 7472 KB Output is correct
9 Correct 298 ms 8132 KB Output is correct
10 Correct 206 ms 8012 KB Output is correct
11 Correct 250 ms 8032 KB Output is correct
12 Incorrect 74 ms 7884 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1216 ms 35316 KB Output is correct
2 Correct 335 ms 19644 KB Output is correct
3 Execution timed out 3084 ms 49500 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7244 KB Output is correct
2 Correct 4 ms 7304 KB Output is correct
3 Correct 4 ms 7244 KB Output is correct
4 Correct 4 ms 7244 KB Output is correct
5 Correct 4 ms 7404 KB Output is correct
6 Correct 4 ms 7372 KB Output is correct
7 Correct 12 ms 7688 KB Output is correct
8 Correct 7 ms 7472 KB Output is correct
9 Correct 298 ms 8132 KB Output is correct
10 Correct 206 ms 8012 KB Output is correct
11 Correct 250 ms 8032 KB Output is correct
12 Incorrect 74 ms 7884 KB Output isn't correct
13 Halted 0 ms 0 KB -