oj.uz

답안 #364484

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364484 2021-02-09T10:17:57 Z cpp219 Olympic Bus (JOI20_ho_t4) C++14
26 / 100
 1000 ms 7020 KB 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

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

struct edge{
    ll v,c,id;
};
vector<edge> g[N],rg[N];
ll n,m,u,v,c,inv,d[N],D[4][N],ans = inf,banned;
bool dd[N],spec[100000];
void cond_to_all(ll scr,ll cond,ll Is_in){
    memset(dd,0,sizeof(dd)); fill(d,d + n + 1,inf);
    d[scr] = 0;
    while(1){
        ll x = inf,u = -1;
        for (ll i = 1;i <= n;i++) if (d[i] < x && !dd[i]) x = d[i],u = i;
        if (u == -1) break; dd[u] = 1;
        for (auto i : g[u]){
            ll v = i.v,L = i.c;
            if (d[v] > d[u] + L && i.id != banned){
                d[v] = d[u] + L;
                if (Is_in) spec[i.id] = 1;
            }
        }
    }
    for (ll i = 1;i <= n;i++) D[cond][i] = d[i];
}

void all_to_cond(ll scr,ll cond,ll Is_in){
    memset(dd,0,sizeof(dd)); fill(d,d + n + 1,inf);
    d[scr] = 0;
    while(1){
        ll x = inf,u = -1;
        for (ll i = 1;i <= n;i++) if (d[i] < x && !dd[i]) x = d[i],u = i;
        if (u == -1) break; dd[u] = 1;
        for (auto i : rg[u]){
            ll v = i.v,L = i.c;
            if (d[v] > d[u] + L && i.id != banned){
                d[v] = d[u] + L;
                if (Is_in) spec[i.id] = 1;
            }
        }
    }
    for (ll i = 1;i <= n;i++) D[cond][i] = d[i];
}

struct Road{
    ll u,v,c,inv;
};
Road a[100000];

void Rev(ll id){
    banned = id;
    u = a[id].u; v = a[id].v; c = a[id].c;
    g[v].push_back({u,c,m + 1}); rg[u].push_back({v,c,m + 1});
    cond_to_all(1,0,0); cond_to_all(n,2,0); all_to_cond(1,1,0); all_to_cond(n,3,0);
    ans = min(ans,D[0][n] + D[2][1] + a[id].inv);
    g[v].pop_back(); rg[u].pop_back(); banned = 0;
    cond_to_all(1,0,0); cond_to_all(n,2,0); all_to_cond(1,1,0); all_to_cond(n,3,0);
}
/// 0 : 1 to all    1 : all to 1    2 : n to all    3 : all to n
int main(){
    ios_base::sync_with_stdio(0);
    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;
    for (ll i = 1;i <= m;i++){
        cin>>u>>v>>c>>inv; a[i] = {u,v,c,inv};
        g[u].push_back({v,c,i}); rg[v].push_back({u,c,i});
    }
    cond_to_all(1,0,1); cond_to_all(n,2,1); all_to_cond(1,1,1); all_to_cond(n,3,1);
    ans = D[0][n] + D[2][1];
    for (ll i = 1;i <= m;i++){
        u = a[i].u; v = a[i].v; c = a[i].c;
        if (!spec[i]){
            //cout<<D[2][1]; return 0;
            ll p = min(D[0][n],D[0][v] + c + D[3][u]),q = min(D[2][1],D[2][v] + c + D[1][u]);
            ans = min(ans,p + q + a[i].inv); //cout<<p<<" x "<<D[2][v]; return 0;
        }
        else Rev(i);
    }
    cout<<(ans >= inf ? -1 : ans);
}

Compilation message

ho_t4.cpp:2: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    2 | #pragma GCC optimization ("O3")
      | 
ho_t4.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("unroll-loops")
      | 
ho_t4.cpp: In function 'void cond_to_all(long long int, long long int, long long int)':
ho_t4.cpp:27:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   27 |         if (u == -1) break; dd[u] = 1;
      |         ^~
ho_t4.cpp:27:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   27 |         if (u == -1) break; dd[u] = 1;
      |                             ^~
ho_t4.cpp: In function 'void all_to_cond(long long int, long long int, long long int)':
ho_t4.cpp:45:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   45 |         if (u == -1) break; dd[u] = 1;
      |         ^~
ho_t4.cpp:45:29: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   45 |         if (u == -1) break; dd[u] = 1;
      |                             ^~
ho_t4.cpp: In function 'int main()':
ho_t4.cpp:77:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   77 |         freopen(task".INP","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 492 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 578 ms 620 KB Output is correct
4 Correct 600 ms 620 KB Output is correct
5 Correct 12 ms 492 KB Output is correct
6 Correct 23 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 742 ms 620 KB Output is correct
11 Correct 797 ms 492 KB Output is correct
12 Correct 768 ms 492 KB Output is correct
13 Correct 146 ms 492 KB Output is correct
14 Correct 448 ms 620 KB Output is correct
15 Correct 383 ms 620 KB Output is correct
16 Correct 385 ms 824 KB Output is correct

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 5964 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 230 ms 624 KB Output is correct
2 Correct 49 ms 364 KB Output is correct
3 Correct 649 ms 4460 KB Output is correct
4 Correct 28 ms 460 KB Output is correct
5 Correct 765 ms 6448 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 236 ms 6500 KB Output is correct
9 Correct 236 ms 6508 KB Output is correct
10 Correct 510 ms 6508 KB Output is correct
11 Correct 487 ms 6892 KB Output is correct
12 Correct 484 ms 7020 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 504 ms 6628 KB Output is correct
20 Correct 501 ms 6764 KB Output is correct
21 Correct 531 ms 6636 KB Output is correct
22 Correct 483 ms 6380 KB Output is correct

Subtask #4
0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 228 ms 492 KB Output is correct
2 Correct 7 ms 364 KB Output is correct
3 Correct 578 ms 620 KB Output is correct
4 Correct 600 ms 620 KB Output is correct
5 Correct 12 ms 492 KB Output is correct
6 Correct 23 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 742 ms 620 KB Output is correct
11 Correct 797 ms 492 KB Output is correct
12 Correct 768 ms 492 KB Output is correct
13 Correct 146 ms 492 KB Output is correct
14 Correct 448 ms 620 KB Output is correct
15 Correct 383 ms 620 KB Output is correct
16 Correct 385 ms 824 KB Output is correct
17 Execution timed out 1092 ms 5964 KB Time limit exceeded
18 Halted 0 ms 0 KB -