oj.uz

답안 #926792

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926792 2024-02-13T18:01:37 Z bachhoangxuan 철도 요금 (JOI16_ho_t3) C++17
100 / 100
 145 ms 31368 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=25;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=131;

int n,m,Q,R[maxn],U[maxn],V[maxn];
int d[2][maxn];
int check[maxn],res[maxn];
vector<pii> edge[maxn];

void bfs(int t){
    for(int i=1;i<=n;i++) d[t][i]=-1;
    queue<int> q;q.push(1);d[t][1]=0;
    while(!q.empty()){
        int u=q.front();q.pop();
        for(auto [v,id]:edge[u]){
            if(check[id]>t) continue;
            if(d[t][v]==-1){
                d[t][v]=d[t][u]+1;
                q.push(v);
            }
        }
    }
}

void solve(){
    cin >> n >> m >> Q;
    for(int i=1;i<=m;i++){
        cin >> U[i] >> V[i];
        edge[U[i]].push_back({V[i],i});
        edge[V[i]].push_back({U[i],i});
    }
    for(int i=1;i<=Q;i++){
        cin >> R[i];
        check[R[i]]=1;
    }
    int cnt=0;
    bfs(1);bfs(0);
    for(int i=1;i<=n;i++){
        //cout << d[0][i] << ' ' << d[1][i] << '\n';
        if(d[0][i]==d[1][i]) cnt++;
        vector<pii> adj;
        for(auto [v,id]:edge[i]){
            if(check[id]) continue;
            if(d[1][v]==d[1][i]+1) adj.push_back({v,id});
        }
        swap(edge[i],adj);
    }
    for(int i=Q;i>=1;i--){
        res[i]=n-cnt;
        int u=U[R[i]],v=V[R[i]];
        if(d[1][u]>d[1][v]) swap(u,v);
        if(d[1][v]!=d[1][u]+1) continue;
        edge[u].push_back({v,R[i]});
        if(d[0][u]!=d[1][u] || d[0][v]==d[1][v]) continue;
        function<void(int)> bfs2 = [&](int s){
            queue<int> q;q.push(s);
            d[0][s]=d[1][s];cnt++;
            while(!q.empty()){
                int x=q.front();q.pop();
                for(auto [v,id]:edge[x]){
                    if(d[0][v]!=d[1][v]){
                        d[0][v]=d[1][v];
                        q.push(v);cnt++;
                    }
                }
            }
        };
        bfs2(v);
    }
    for(int i=1;i<=Q;i++) cout << res[i] << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14984 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14948 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14984 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14948 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 100 ms 27732 KB Output is correct
10 Correct 85 ms 27984 KB Output is correct
11 Correct 84 ms 27108 KB Output is correct
12 Correct 79 ms 27344 KB Output is correct
13 Correct 93 ms 27576 KB Output is correct
14 Correct 85 ms 27288 KB Output is correct
15 Correct 47 ms 22484 KB Output is correct
16 Correct 50 ms 21324 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 27748 KB Output is correct
2 Correct 83 ms 27728 KB Output is correct
3 Correct 53 ms 26564 KB Output is correct
4 Correct 71 ms 27284 KB Output is correct
5 Correct 84 ms 27212 KB Output is correct
6 Correct 85 ms 27448 KB Output is correct
7 Correct 40 ms 21340 KB Output is correct
8 Correct 40 ms 21328 KB Output is correct
9 Correct 25 ms 21572 KB Output is correct
10 Correct 25 ms 23236 KB Output is correct
11 Correct 87 ms 27184 KB Output is correct
12 Correct 93 ms 26708 KB Output is correct
13 Correct 92 ms 26452 KB Output is correct
14 Correct 96 ms 27472 KB Output is correct
15 Correct 89 ms 26732 KB Output is correct
16 Correct 96 ms 26408 KB Output is correct
17 Correct 93 ms 27216 KB Output is correct
18 Correct 58 ms 23124 KB Output is correct
19 Correct 125 ms 30800 KB Output is correct
20 Correct 87 ms 27300 KB Output is correct
21 Correct 52 ms 22104 KB Output is correct
22 Correct 47 ms 21840 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 3 ms 15196 KB Output is correct
4 Correct 3 ms 14940 KB Output is correct
5 Correct 3 ms 14984 KB Output is correct
6 Correct 3 ms 14940 KB Output is correct
7 Correct 2 ms 14948 KB Output is correct
8 Correct 2 ms 15192 KB Output is correct
9 Correct 100 ms 27732 KB Output is correct
10 Correct 85 ms 27984 KB Output is correct
11 Correct 84 ms 27108 KB Output is correct
12 Correct 79 ms 27344 KB Output is correct
13 Correct 93 ms 27576 KB Output is correct
14 Correct 85 ms 27288 KB Output is correct
15 Correct 47 ms 22484 KB Output is correct
16 Correct 50 ms 21324 KB Output is correct
17 Correct 88 ms 27748 KB Output is correct
18 Correct 83 ms 27728 KB Output is correct
19 Correct 53 ms 26564 KB Output is correct
20 Correct 71 ms 27284 KB Output is correct
21 Correct 84 ms 27212 KB Output is correct
22 Correct 85 ms 27448 KB Output is correct
23 Correct 40 ms 21340 KB Output is correct
24 Correct 40 ms 21328 KB Output is correct
25 Correct 25 ms 21572 KB Output is correct
26 Correct 25 ms 23236 KB Output is correct
27 Correct 87 ms 27184 KB Output is correct
28 Correct 93 ms 26708 KB Output is correct
29 Correct 92 ms 26452 KB Output is correct
30 Correct 96 ms 27472 KB Output is correct
31 Correct 89 ms 26732 KB Output is correct
32 Correct 96 ms 26408 KB Output is correct
33 Correct 93 ms 27216 KB Output is correct
34 Correct 58 ms 23124 KB Output is correct
35 Correct 125 ms 30800 KB Output is correct
36 Correct 87 ms 27300 KB Output is correct
37 Correct 52 ms 22104 KB Output is correct
38 Correct 47 ms 21840 KB Output is correct
39 Correct 109 ms 31336 KB Output is correct
40 Correct 111 ms 31368 KB Output is correct
41 Correct 63 ms 26512 KB Output is correct
42 Correct 110 ms 30652 KB Output is correct
43 Correct 145 ms 30752 KB Output is correct
44 Correct 96 ms 30800 KB Output is correct
45 Correct 100 ms 30768 KB Output is correct
46 Correct 65 ms 23620 KB Output is correct
47 Correct 53 ms 22864 KB Output is correct
48 Correct 54 ms 22868 KB Output is correct
49 Correct 40 ms 21184 KB Output is correct
50 Correct 42 ms 22236 KB Output is correct
51 Correct 40 ms 22772 KB Output is correct
52 Correct 42 ms 23140 KB Output is correct
53 Correct 40 ms 21784 KB Output is correct
54 Correct 37 ms 21784 KB Output is correct