oj.uz

답안 #857875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
857875 2023-10-07T06:21:22 Z UmairAhmadMirza Pipes (CEOI15_pipes) C++17
20 / 100
 1027 ms 860 KB 
//In the name of Allah the most beneficent, the most merciful.
#include <bits/stdc++.h>

using namespace std;

#pragma GCC optimize("Ofast,unroll-loops") 
// #pragma GCC target("avx,avx2,avx512,fma") 
// #define int long long
#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()

#define PI 3.1415926535897932384626433832795l 
const int N = 5005;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

// -------------------------<RNG>------------------------- 
// RANDOM NUMBER GENERATOR
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
#define SHUF(v) shuffle(all(v), RNG); 
// Use mt19937_64 for 64 bit random numbers.
//--------------------------------------------------------
vector<int> adj[N];
int e1,e2;
bool vis[N];
int n,m;
void dfs(int node){
	if(vis[e2])
		return;
	vis[node]=1;
	bool b=0;
	for(auto i:adj[node]){
		if((b==0) && (((node==e1)&&(i==e2)) || ((node==e2)&&(i==e1)))){
			b=1;
			continue;
		}
		if(vis[i]==0)
			dfs(i);
	}
}
bool check(pair<int,int> e){
	e1=e.first;
	e2=e.second;
	for(int i=0;i<=n;i++)
		vis[i]=0;
	dfs(e1);
	return !(vis[e2]);
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>m;
    if(n>5000||m>15000)
    	return 0;
    vector<pair<int,int>> ed;
    for(int i=0;i<m;i++){
    	int a,b;
    	cin>>a>>b;
    	adj[a].push_back(b);
    	adj[b].push_back(a);
    	ed.push_back({a,b});
    }
    for(auto e:ed)
    	if(check(e))
    		cout<<e.first<<' '<<e.second<<endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 848 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Wrong number of edges
3 Halted 0 ms 0 KB -