oj.uz

Submission #260674

# Submission time Handle Problem Language Result Execution time Memory
260674 2020-08-10T17:31:20 Z caoash Flood (IOI07_flood) C++14
100 / 100
 242 ms 29032 KB 
#include <bits/stdc++.h> 
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

vector<pair<pi, int>> pt; vector<pi> adj[100005][4];

const int go[] = {1, 0, 3, 2};

int gdir (pi a, pi b) {
    if (a.f == b.f) {
        return (b.s > a.s ? 0 : 2);
    }
    else {
        return (b.f > a.f ? 1 : 3);
    }
}

bool vis[100005]; vi fans;

int dfs(int v, int d) {
    if (vis[v]) return v;
    vis[v] = true;
    for (int i = 0; i < 4; i++) {
        int nxt = (d + go[i]) % 4;
        if (adj[v][nxt].empty()) {
            continue;
        }
        pi to = adj[v][nxt].front();
        adj[v][nxt].clear();
        adj[to.f][(nxt + 2) % 4].clear(); 
        int ret = dfs(to.f, nxt);
        if (ret == -1) {
            fans.pb(to.s);
            continue;
        }
        if (ret != v) {
            vis[v] = false;
            return ret;
        }
    } 
    vis[v] = false;
    return -1;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n; cin >> n;
    for (int i = 0; i < n; i++) {
        pi curr;
        cin >> curr.f >> curr.s;
        pt.pb(mp(curr, i));
    }
    int w; cin >> w;
    for (int i = 0; i < w; i++) {
        int a, b; cin >> a >> b;
        a--, b--;
        adj[a][gdir(pt[a].f, pt[b].f)].pb(mp(b, i));
        adj[b][gdir(pt[b].f, pt[a].f)].pb(mp(a, i));
    }
    sort(all(pt));
    for (pair<pi, int> x : pt) {
        dfs(x.s, 0);
    }
    cout << sz(fans) << '\n';
    for (int x : fans) {
        cout << x + 1 << '\n';
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct

Subtask #4
3.0 / 3.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct
2 Correct 7 ms 9636 KB Output is correct

Subtask #6
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9728 KB Output is correct

Subtask #7
3.0 / 3.0

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

Subtask #8
3.0 / 3.0

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

Subtask #9
3.0 / 3.0

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

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 12156 KB Output is correct

Subtask #11
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 20072 KB Output is correct

Subtask #12
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 18792 KB Output is correct
2 Correct 237 ms 24044 KB Output is correct

Subtask #13
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 22252 KB Output is correct
2 Correct 242 ms 24292 KB Output is correct

Subtask #14
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 23784 KB Output is correct
2 Correct 171 ms 29032 KB Output is correct