제출 #948428

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
948428		vjudge1	Pipes (CEOI15_pipes)	C++17	20 / 100	5060 ms	50788 KiB

pipes

#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
#define int int16_t
using namespace std;


const int N = 10000 + 2;

int tin[N], tout[N];
int low[N];
bool used[N];
vector <int> g[N];

int timer;
struct hash_pair {
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const
    {
        auto hash1 = hash<T1>{}(p.first);
        auto hash2 = hash<T2>{}(p.second);
 
        if (hash1 != hash2) {
            return hash1 ^ hash2;              
        }
         
        // If hash1 == hash2, their XOR is zero.
          return hash1;
    }
};
unordered_map <int,int> mp[N], cant[N];
//unordered_map<pair<int, int>, bool, hash_pair> mp, cant;
int n;
int32_t m;

void dfs_low(int v, int p = -1){
    used[v] = true;
    tin[v] = low[v] = ++timer;
    for (auto u : g[v]){
        if (u == p) continue;
        if (used[u]){
            low[v] = min(low[v], tin[u]);
        }else{
            dfs_low(u, v);
            low[v] = min(low[v], low[u]);
            if (low[u] > tin[v] &&  !cant[min(v, u)].count(max(v, u))){
				cout << min(v, u) <<" "<< max(v, u) << "\n";
			}
        }
    }
}

main(){
	iostream::sync_with_stdio(false);	
    cin.tie(nullptr);
	cout.tie(nullptr);
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		int a, b;
		cin >> a >> b;
		if(a > b)swap(a, b);
		if(mp[a].count(b)){
			cant[a][b] = 1;
			continue;
		}
		g[a].pb(b);
		g[b].pb(a);
		mp[a][b] = 1;
	}
	
	for(int i = 1; i <= n; i++){
		if(!used[i]){
			dfs_low(i);
		}
	}
}    
/*
 * Before implementing the problem:
	
	Do I understand the problem correctly?
	Which places are tricky? What do I need to remember to implement them correctly?
	Which place is the heaviest by implementation? Can I do it simpler?
	Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
	----------------------------------
	If not AC:
 
	Did you remember to do everything to handle the tricky places you thought about before?
	Is the solution correct?
	Do I understand the problem correctly?
	----------------------------------
	If you have a test on which the solution gives wrong answer:
 
	Is the solution doing what it was supposed to do?
	Is the problem in the code or in the idea?
*/

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

pipes.cpp:60:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   60 | main(){
      | ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 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