oj.uz

Submission #349986

# Submission time Handle Problem Language Result Execution time Memory
349986 2021-01-18T19:34:34 Z Sara Flood (IOI07_flood) C++14
26 / 100
 337 ms 32868 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef long double ld;
#define pb push_back
#define mp make_pair
#define pii pair <int, int>
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define F first
#define S second
 
const int maxn = 4e5 + 10;
int x[maxn], y[maxn], a[maxn], b[maxn];
int dis[maxn], ty[maxn][5];
vector <pii> adj[maxn];
int inf = 1e8;
 
int dir(int u, int v){
//	left = 0, down = 1, right = 2, up = 3;
	if(x[u] == x[v]){
		if(y[u] < y[v]){
			return 2;
		}
		return 0;
	}
	if(x[u] < x[v])
		return 1;
	return 3;
}
 
void add_edge(int x, int y){
	adj[x].pb({y, 0});
	adj[y].pb({x, 0});
	return;
}
 
void bfs(int v){
	deque <int> q;
	dis[v] = 0;
	q.pb(v);
	while(q.size()){
		int x = q.front();
		q.pop_front();
		for(auto u : adj[x]){
			if(dis[u.F] > dis[x] + u.S){
				dis[u.F] = dis[x] + u.S;
				if(u.S){
					q.pb(u.F);
				}else
					q.push_front(u.F);
			}	
		}
	}
}
 
int main(){
	fast_io;
	int n;
	cin >> n;
	for(int i = 1; i <= n; i ++){
		cin >> x[i] >> y[i];
	}
	int m;
	cin >> m;
	//find lines for each point
	for(int i = 1; i <= m; i ++){
		ty[i][0] = ty[i][1] = ty[i][2] = ty[i][3] = -1;	
		adj[2 * i].pb({2 * i + 1, 1});
		adj[2 * i + 1].pb({2 * i, 1});
	}

	for(int i = 1; i <= m; i ++){
		cin >> a[i] >> b[i];
		ty[a[i]][dir(a[i], b[i])] = i;
		ty[b[i]][dir(b[i], a[i])] = i;
	}
	//put edges of the graph!
	for(int i = 1; i <= n; i ++){
		for(int j = 0; j < 4; j ++){
			if(ty[i][j] != -1){
				int k = (j + 1) % 4;
				while(ty[i][k] == -1){
					k = (k + 1) % 4;
				}
				int x = 2 * ty[i][j] + ((j == 0) || (j == 3));
				int y = 2 * ty[i][k] + ((k == 1) || (k == 2));
				
				add_edge(x, y);
			}
		}
	}
	
	for(int i = 0; i <= 2 * m + 3; i ++)
		dis[i] = inf;
		
	vector <pii> v;
	for(int i = 1; i <= m; i ++){
		if(x[a[i]] == x[b[i]])
			v.pb({min(y[a[i]], y[b[i]]), i});
	}
	sort(v.begin(), v.end());
	for(auto u : v){
		if(dis[2 * u.S + 1] >= inf){
			bfs(2 * u.S + 1);
		}
	}
	int cnt = 0;
	for(int i = 1; i <= m; i ++){
		if(dis[2 * i] == dis[2 * i + 1])
			cnt ++;
	}	
	cout << cnt << '\n';
	for(int i = 1; i <= m; i ++){
		if(dis[2 * i] == dis[2 * i + 1])
			cout << i << '\n';
	}
	
	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 9708 KB Output isn't correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 7 ms 9708 KB Output is correct
3 Correct 7 ms 9708 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9836 KB Output is correct

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 9836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 9836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9836 KB Output is correct

Subtask #7
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9836 KB Output is correct

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 9836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 9836 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 13292 KB Output isn't correct

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 81 ms 21692 KB Output isn't correct

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 78 ms 22828 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 285 ms 29604 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 9.0

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