| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 445895 |
2021-07-20T05:34:31 Z |
blue |
Flood (IOI07_flood) |
C++17 |
|
340 ms |
10320 KB |
#include <iostream>
#include <vector>
#include <deque>
#include <algorithm>
using namespace std;
const int maxN = 100'000;
const int maxW = 200'000;
vector<int> X(1+maxN), Y(1+maxN);
vector<int> A(1+maxW), B(1+maxW);
int N;
int W;
vector<int> T(1+maxN, 0), L(1+maxN, 0), D(1+maxN, 0), R(1+maxN, 0);
const int maxR = 4*maxN + 4;
// vector< vector<int> > R_edge(1+maxR, vector<int>(0));
// vector< vector<int> > R_wt(1+maxR, vector<int>(0));
//
// void add_R_edge(int u, int v, int w)
// {
// R_edge[u].push_back(v);
// R_wt[u].push_back(w);
//
// R_edge[v].push_back(u);
// R_wt[v].push_back(w);
// }
/*
0 1
P
3 2
4*i + 0
4*i + 1
4*i + 2
4*i + 3
*/
const int TL = 0;
const int TR = 1;
const int DR = 2;
const int DL = 3;
const int INF = 1e9;
int main()
{
cin >> N;
for(int i = 1; i <= N; i++)
cin >> X[i] >> Y[i];
cin >> W;
for(int j = 1; j <= W; j++)
{
cin >> A[j] >> B[j];
if(X[ A[j] ] == X[ B[j] ])
{
if(Y[ A[j] ] > Y[ B[j] ])
swap(A[j], B[j]);
D[ A[j] ] = B[j];
T[ B[j] ] = A[j];
// add_R_edge(4*A[j] + DL, 4*B[j] + TL, 0);
// add_R_edge(4*A[j] + DR, 4*B[j] + TR, 0);
}
else //if(Y[ A[j] ] == Y[ B[j] ])
{
if(X[ A[j] ] > X[ B[j] ])
swap(A[j], B[j]);
R[ A[j] ] = B[j];
L[ B[j] ] = A[j];
// add_R_edge(4*A[j] + TR, 4*B[j] + TL, 0);
// add_R_edge(4*A[j] + DR, 4*B[j] + DL, 0);
}
}
// for(int i = 1; i <= N; i++)
// {
// add_R_edge(4*i + TL, 4*i + TR, T[i]);
// add_R_edge(4*i + TL, 4*i + DL, L[i]);
// add_R_edge(4*i + TR, 4*i + DR, R[i]);
// add_R_edge(4*i + DL, 4*i + DR, D[i]);
// }
// cerr << "check\n";
vector<int> outside_dist(1+maxR, INF);
deque<int> tbv;
vector<int> O(N);
for(int i = 0; i < N; i++) O[i] = i+1;
sort(O.begin(), O.end(), [] (int a1, int a2)
{
return X[a1] < X[a2];
});
for(int U: O)
{
// cerr << "U = " << U << '\n';
if(outside_dist[4*U + TL] != INF) continue;
outside_dist[4*U + TL] = 0;
tbv.push_front(4*U + TL);
while(!tbv.empty())
{
int u = tbv.front();
tbv.pop_front();
vector<int> R_edge;
vector<int> R_wt;
int point = u/4;
if(u % 4 == TL)
{
R_edge.push_back(4 * point + (u+1)%4);
R_wt.push_back(bool(T[point]));
R_edge.push_back(4 * point + (u+3)%4);
R_wt.push_back(bool(L[point]));
if(T[point] != 0)
{
R_edge.push_back(4 * T[point] + DL);
R_wt.push_back(0);
}
if(L[point] != 0)
{
R_edge.push_back(4 * L[point] + TR);
R_wt.push_back(0);
}
}
else if(u % 4 == TR)
{
R_edge.push_back(4 * point + (u+1)%4);
R_wt.push_back(bool(R[point]));
R_edge.push_back(4 * point + (u+3)%4);
R_wt.push_back(bool(T[point]));
if(T[point] != 0)
{
R_edge.push_back(4 * T[point] + DR);
R_wt.push_back(0);
}
if(R[point] != 0)
{
R_edge.push_back(4 * R[point] + TL);
R_wt.push_back(0);
}
}
else if(u % 4 == DR)
{
R_edge.push_back(4 * point + (u+1)%4);
R_wt.push_back(bool(D[point]));
R_edge.push_back(4 * point + (u+3)%4);
R_wt.push_back(bool(R[point]));
if(D[point] != 0)
{
R_edge.push_back(4 * D[point] + TR);
R_wt.push_back(0);
}
if(R[point] != 0)
{
R_edge.push_back(4 * R[point] + DL);
R_wt.push_back(0);
}
}
else //if(u % 4 == DL)
{
R_edge.push_back(4 * point + (u+1)%4);
R_wt.push_back(bool(L[point]));
R_edge.push_back(4 * point + (u+3)%4);
R_wt.push_back(bool(D[point]));
if(D[point] != 0)
{
R_edge.push_back(4 * D[point] + TL);
R_wt.push_back(0);
}
if(L[point] != 0)
{
R_edge.push_back(4 * L[point] + DR);
R_wt.push_back(0);
}
}
for(int e = 0; e < R_edge.size(); e++)
{
int v = R_edge[e];
int w = R_wt[e];
if(outside_dist[v] <= outside_dist[u] + w) continue;
outside_dist[v] = outside_dist[u] + w;
if(w == 0) tbv.push_front(v);
else tbv.push_back(v);
}
}
}
// cerr << "check\n";
vector<int> res;
for(int j = 1; j <= W; j++)
{
if(X[ A[j] ] == X[ B[j] ])
{
if(outside_dist[4*A[j] + DL] == outside_dist[4*A[j] + DR])
{
res.push_back(j);
}
}
else //if(Y[ A[j] ] == Y[ B[j] ])
{
if(outside_dist[4*A[j] + TR] == outside_dist[4*A[j] + DR])
{
res.push_back(j);
}
}
}
cout << res.size() << '\n';
for(int r:res) cout << r << '\n';
}
Compilation message
flood.cpp: In function 'int main()':
flood.cpp:225:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
225 | for(int e = 0; e < R_edge.size(); e++)
| ~~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
5708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
5708 KB |
Output is correct |
| 2 |
Correct |
3 ms |
5708 KB |
Output is correct |
| 3 |
Correct |
4 ms |
5768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
5708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
5708 KB |
Output is correct |
| 2 |
Correct |
4 ms |
5780 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
5708 KB |
Output is correct |
| 2 |
Correct |
3 ms |
5764 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5708 KB |
Output is correct |
| 2 |
Correct |
4 ms |
5708 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
5708 KB |
Output is correct |
| 2 |
Correct |
5 ms |
5768 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
6500 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
209 ms |
7492 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
202 ms |
7100 KB |
Output is correct |
| 2 |
Correct |
312 ms |
9692 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
299 ms |
7808 KB |
Output is correct |
| 2 |
Correct |
338 ms |
9892 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
340 ms |
7732 KB |
Output is correct |
| 2 |
Correct |
308 ms |
10320 KB |
Output is correct |
