| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 122058 |
2019-06-27T13:26:57 Z |
win11905 |
Flood (IOI07_flood) |
C++11 |
|
479 ms |
26460 KB |
#include <bits/stdc++.h>
#define pii pair<int, int>
#define x first
#define y second
using namespace std;
const int N = 2e5+5;
int n, m;
int x[N>>1], y[N>>1];
int s[N], t[N];
int za[N], zb[N];
bitset<4> state[N];
bitset<N> check;
int idx;
vector<pii> coor;
vector<int> ss;
vector<vector<int> > zzz(N>>1);
int par[N<<1];
int find(int u) { return par[u] = par[u] == u ? u : find(par[u]); }
int Mp(pii x) {
return upper_bound(coor.begin(), coor.end(), x) - coor.begin();
}
void merge(int a, int b, int c, int d) {
int u = Mp(pii(a, b)), v = Mp(pii(c, d));
par[find(u)] = find(v);
}
int main() {
iota(par, par+(N<<1), 0);
scanf("%d", &n);
for(int i = 0; i < n; ++i) scanf("%d %d", x+i, y+i);
scanf("%d", &m);
for(int i = 0; i < m; ++i) scanf("%d %d", s+i, t+i), s[i]--, t[i]--;
for(int i = 0; i < m; ++i) zzz[s[i]].emplace_back(t[i]), zzz[t[i]].emplace_back(s[i]);
for(int i = 0; i < n; ++i) if(check[i] == false) {
queue<int> Q;
Q.emplace(i);
int mny = 1e9, st;
check[i] = true;
while(!Q.empty()) {
int u = Q.front(); Q.pop();
if(x[u] < mny) mny = x[u], st = u;
for(int v : zzz[u]) if(!check[v]) check[v] = true, Q.emplace(v);
}
ss.emplace_back(st);
}
zzz.clear();
for(int i = 0; i < n; ++i) {
check[i] = false;
coor.emplace_back(x[i], y[i]);
coor.emplace_back(x[i]+1, y[i]);
coor.emplace_back(x[i], y[i]+1);
coor.emplace_back(x[i]+1, y[i]+1);
}
sort(coor.begin(), coor.end());
coor.resize(unique(coor.begin(), coor.end()) - coor.begin());
for(int i = 0; i < m; ++i) {
if(x[s[i]] > x[t[i]]) swap(s[i], t[i]);
if(y[s[i]] > y[t[i]]) swap(s[i], t[i]);
if(x[s[i]] != x[t[i]]) {
state[s[i]][1] = state[t[i]][3] = true;
merge(x[s[i]]+1, y[s[i]], x[t[i]], y[t[i]]);
merge(x[s[i]]+1, y[s[i]]+1, x[t[i]], y[t[i]]+1);
} else {
state[s[i]][0] = state[t[i]][2] = true;
merge(x[s[i]], y[s[i]]+1, x[t[i]], y[t[i]]);
merge(x[s[i]]+1, y[s[i]]+1, x[t[i]]+1, y[t[i]]);
}
}
for(int i = 0; i < n; ++i) {
if(!state[i][0]) merge(x[i], y[i]+1, x[i]+1, y[i]+1);
if(!state[i][1]) merge(x[i]+1, y[i], x[i]+1, y[i]+1);
if(!state[i][2]) merge(x[i], y[i], x[i]+1, y[i]);
if(!state[i][3]) merge(x[i], y[i], x[i], y[i]+1);
}
for(int i = 0; i < m; ++i) {
int a, b;
if(x[s[i]] != x[t[i]])
a = find(Mp(pii(x[t[i]], y[t[i]]))), b = find(Mp(pii(x[t[i]], y[t[i]]+1)));
else
a = find(Mp(pii(x[t[i]], y[t[i]]))), b = find(Mp(pii(x[t[i]]+1, y[t[i]])));
za[i] = a, zb[i] = b;
}
for(auto &i : ss) i = find(Mp(pii(x[i], y[i])));
coor.clear();
vector<vector<int> > g(N<<1);
vector<int> lv(N<<1);
for(int i = 0; i < m; ++i)
g[za[i]].emplace_back(i), g[zb[i]].emplace_back(i);
int ans = 0;
for(auto i : ss) {
queue<int> Q;
if(lv[i]) continue;
lv[i] = 1, Q.emplace(i);
while(!Q.empty()) {
int u = Q.front(); Q.pop();
for(int x : g[u]) {
int v = za[x] ^ zb[x] ^ u;
if(lv[v] == 0) lv[v] = lv[u] + 1, Q.emplace(v);
if(lv[v] != lv[u] + 1 && lv[u] != lv[v] + 1) ans++, check[x] = true;
}
}
}
printf("%d\n", ans >> 1);
for(int i = 0; i < m; ++i) if(check[i]) printf("%d\n", i+1);
}
Compilation message
flood.cpp: In function 'int main()':
flood.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
~~~~~^~~~~~~~~~
flood.cpp:36:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 0; i < n; ++i) scanf("%d %d", x+i, y+i);
~~~~~^~~~~~~~~~~~~~~~~~~
flood.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &m);
~~~~~^~~~~~~~~~
flood.cpp:38:64: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
for(int i = 0; i < m; ++i) scanf("%d %d", s+i, t+i), s[i]--, t[i]--;
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15232 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15232 KB |
Output is correct |
| 2 |
Correct |
14 ms |
15232 KB |
Output is correct |
| 3 |
Correct |
14 ms |
15232 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
15232 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15232 KB |
Output is correct |
| 2 |
Correct |
15 ms |
15360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15232 KB |
Output is correct |
| 2 |
Correct |
15 ms |
15232 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15232 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
15332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15224 KB |
Output is correct |
| 2 |
Correct |
17 ms |
15360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
15360 KB |
Output is correct |
| 2 |
Correct |
15 ms |
15360 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
66 ms |
17440 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
164 ms |
22004 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
22364 KB |
Output is correct |
| 2 |
Correct |
419 ms |
25104 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
369 ms |
24036 KB |
Output is correct |
| 2 |
Correct |
479 ms |
25432 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
415 ms |
24820 KB |
Output is correct |
| 2 |
Correct |
272 ms |
26460 KB |
Output is correct |
