oj.uz

답안 #948423

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948423 2024-03-18T05:43:57 Z vjudge1 Pipes (CEOI15_pipes) C++17
20 / 100
 5000 ms 51036 KB 
#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;
unordered_map <int, unordered_map <int,int> > mp;
unordered_map <int, unordered_map <int,int> > 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.count(min(v, u)) || !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) == 1){
			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?
*/

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 2212 KB Output is correct
2 Correct 6 ms 2136 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 860 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 1116 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -