oj.uz

Submission #1011869

# Submission time Handle Problem Language Result Execution time Memory
1011869 2024-07-01T10:04:43 Z PenguinsAreCute Pipes (CEOI15_pipes) C++17
20 / 100
 1901 ms 65536 KB 
#include <vector>
#include <iostream>
#include <bitset>
using namespace std;
typedef vector<int> vi;
#define pb push_back
#define REP(i, a, b) for(int i = a; i < b; i++)
#define MAXN 100005
vi adj[MAXN], adj_dfs3[MAXN];
int h[MAXN], crossEdges[MAXN], par[MAXN];
bitset<MAXN> visited;
void dfs(int x) {
	visited[x] = true;
	for(auto i: adj[x]) if(!visited[i]) {
		par[i]=x;
		adj_dfs3[x].pb(i);
		h[i]=h[x]+1;
		dfs(i);
	}
}
int dp(int x) {
	if(visited[x]) return crossEdges[x];
	visited[x] = 1;
	//crossEdges[x]=bEdgeU[x]-bEdgeD[x];
	for(auto i:adj_dfs3[x]) if(h[i]>h[x]) crossEdges[x]+=dp(i);
	return crossEdges[x];
}
int main() {
	int N, E, A, B, ans; cin >> N >> E;
	REP(i,0,E) {
		cin >> A >> B;
		adj[A].pb(B);
		adj[B].pb(A);
	}
	REP(i,1,N+1)if(!visited[i]) dfs(i);
	REP(i,1,N+1) visited[i]=0;
	REP(i,1,N+1) for(auto j: adj[i]) {
		if(h[i]>h[j]) crossEdges[i]++;
		else crossEdges[i]--;
	}
	REP(i,1,N+1) if(par[i]&&dp(i)==1) cout << i << " " << par[i] << "\n";
}

Compilation message

pipes.cpp: In function 'int main()':
pipes.cpp:29:18: warning: unused variable 'ans' [-Wunused-variable]
   29 |  int N, E, A, B, ans; cin >> N >> E;
      |                  ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 2 ms 4956 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5724 KB Output is correct
2 Correct 6 ms 5468 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 16300 KB Output is correct
2 Runtime error 170 ms 18000 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 323 ms 21740 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 540 ms 35740 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 663 ms 43512 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1055 ms 65536 KB Memory limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1441 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1729 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1901 ms 65536 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -