結果

問題 No.416 旅行会社
ユーザー tottoripaper
提出日時 2016-10-01 22:33:26
言語 C++11
(gcc 13.3.0)
結果
AC  
実行時間 196 ms / 4,000 ms
コード長 1,866 bytes
コンパイル時間 1,593 ms
コンパイル使用メモリ 168,632 KB
実行使用メモリ 13,764 KB
最終ジャッジ日時 2024-12-14 20:17:43
合計ジャッジ時間 4,711 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:39:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   39 |     scanf("%d %d %d", &N, &M, &Q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:42:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   42 |         scanf("%d %d", &fst(bridge[i]), &snd(bridge[i]));
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:51:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   51 |         scanf("%d %d", &fst(brokenBridge), &snd(brokenBridge));
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
using ll = long long;
using P = std::tuple<int,int>;
const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
int N, M, Q;
P bridge[200000];
bool broken[200000], used[200000];
int id[200000];
vector<int> graph[100000];
int res[100000];
void dfs(int u, int tag){
    used[u] = true;
    res[u] = tag;
    
    for(int v : graph[u]){
        if(!used[v]){
            dfs(v, tag);
        }
    }
}
int main(){
    //*
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);
    /*/
      /*/
    scanf("%d %d %d", &N, &M, &Q);
    for(int i=0;i<M;++i){
        scanf("%d %d", &fst(bridge[i]), &snd(bridge[i]));
        --fst(bridge[i]);
        --snd(bridge[i]);
    }
    sort(bridge, bridge+M);
    
    for(int i=0;i<Q;++i){
        P brokenBridge;
        scanf("%d %d", &fst(brokenBridge), &snd(brokenBridge));
        --fst(brokenBridge);
        --snd(brokenBridge);
        
        auto it = lower_bound(bridge, bridge+M, brokenBridge);
        if(it != bridge + M && *it == brokenBridge){
            broken[it-bridge] = true;
            id[i] = it - bridge;
        }
    }
    for(int i=0;i<M;++i){
        if(!broken[i]){
            graph[fst(bridge[i])].emplace_back(snd(bridge[i]));
            graph[snd(bridge[i])].emplace_back(fst(bridge[i]));
        }
    }
    dfs(0, -1);
    
    for(int i=Q-1;i>=0;--i){
        P b = bridge[id[i]];
        int u, v;
        tie(u, v) = b;
        graph[u].emplace_back(v);
        graph[v].emplace_back(u);
        
        if(used[u] && !used[v]){
            dfs(v, i+1);
        }else if(used[v] && !used[u]){
            dfs(u, i+1);
        }
    }
    for(int i=1;i<N;++i){
        printf("%d\n", res[i]);
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0