제출 #1022311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1022311		vjudge1	Pipes (CEOI15_pipes)	C++17	30 / 100	721 ms	59300 KiB

pipes

#include <bits/stdc++.h>

#define ll long long
using namespace std;
const int N = 1e5 + 2;
int  dp[N + 2];
int par[N + 2];
vector < int > adj[N + 2];
int find_par(int u){
    if(par[u]  < 0)return u;
    par[u] = find_par(par[u]);
    return par[u];
}
bool union_set(int u , int v){
    u = find_par(u);
    v = find_par(v);
    if(u != v){
        if(par[u] > par[v])swap(u , v);
        par[u] += par[v];
        par[v] = u;
        return true;
    }
    return false;
}
void dfs(int u , int p ){
    par[u] = 1;
    for(auto v: adj[u]){
        if(par[v])continue;
        dfs(v , u);
        dp[u] ^= dp[v];
    }
    if(dp[u] == 0 && p != -1)cout << u << ' ' << p << '\n';
}
void solve() {
    int n, m;
    cin >> n >> m;
    memset(par , -1 , sizeof(par));
    for(int i = 1; i <= m ;i ++){
        int u , v;
        cin >> u >> v;
        if(union_set(u , v)){
            adj[u].push_back(v);
            adj[v].push_back(u);
        }
        else{
            dp[u] ^= i;
            dp[v] ^= i;
        }
    }
    memset(par , 0 , sizeof(par));
    for(int i = 1; i <= n ; i ++){
        if(!par[i])dfs(i , -1);
    }
    
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    
    #define _ "maxseq."
    if (fopen(_ "inp", "r")) {
        freopen(_ "inp", "r", stdin);
        freopen(_ "out", "w", stdout);
    }
    
    solve();
}

컴파일 시 표준 에러 (stderr) 메시지

pipes.cpp: In function 'int main()':
pipes.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen(_ "inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
pipes.cpp:63:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |         freopen(_ "out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10