oj.uz

Submission #433125

# Submission time Handle Problem Language Result Execution time Memory
433125 2021-06-18T21:50:35 Z someone Tropical Garden (IOI11_garden) C++14
100 / 100
 566 ms 48364 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;

struct Node {
    int i, t;
};

struct Req {
    bool add;
    int t, k, id;
};

const int N = 3e5 + 42, Q = 2e3 + 10, INF = 2e9;

bool b[N][2];
Node nex[N][2];
vector<int> adj[N];
vector<Node> pre[N][2];
int n, m, fin, q, step[Q], occ[N][2], arc[N], cycle[2], dist[N][2][2], ans[N];

void BFS(int k) {
    queue<Node> q;
    q.push({fin, k});
    dist[fin][k][k] = 0;
    while(!q.empty()) {
        Node act = q.front();
        q.pop();
        for(Node next : pre[act.i][act.t]) {
            if(dist[next.i][next.t][k] == INF) {
                dist[next.i][next.t][k] = dist[act.i][act.t][k] + 1;
                q.push(next);
            }
        }
    }
}

void count_routes(int N_, int M_, int P_, int R[][2], int Q_, int G[]) {
    n = N_, m = M_, fin = P_, q = Q_;
    for(int i = 0; i < m; i++)
        arc[i] = R[i][0] + R[i][1];
    for(int i = 0; i < m; i++) {
        if(adj[R[i][0]].size() < 2) {
            adj[R[i][0]].push_back(i);
        }
        if(adj[R[i][1]].size() < 2) {
            adj[R[i][1]].push_back(i);
        }
    }
    for(int i = 0; i < n; i++)
        if(adj[i].size() == 1)
            adj[i].push_back(adj[i][0]);

    for(int i = 0; i < n; i++)
        for(int j = 0; j < 2; j++) {
            int s = arc[adj[i][j]] - i;
            if(adj[i][j] == adj[s][0]) {
                nex[i][j] = {s, 1};
                pre[s][1].push_back({i, j});
            } else {
                nex[i][j] = {s, 0};
                pre[s][0].push_back({i, j});
            }
        }
    for(int i = 0; i < n; i++)
        for(int j = 0; j < 2; j++)
            for(int k = 0; k < 2; k++)
                dist[i][j][k] = INF;
    int i = fin, j = 0, nb = 0;
    cycle[0] = cycle[1] = -1;
    do {
        nb++;
        b[i][j] = true;
        Node next = nex[i][j];
        i = next.i;
        j = next.t;
    } while(!b[i][j]);
    if(i == fin && j == 0) {
        cycle[0] = nb;
    }
    for(int i = 0; i < n; i++)
        b[i][0] = b[i][1] = false;
    i = fin, j = 1, nb = 0;
    do {
        nb++;
        b[i][j] = true;
        Node next = nex[i][j];
        i = next.i;
        j = next.t;
    } while(!b[i][j]);
    if(i == fin && j == 1) {
        cycle[1] = nb;
    }
    BFS(0);
    BFS(1);
    vector<Req> req;
    for(int i = 0; i < n; i++)
        for(int k = 0; k < 2; k++)
            if(dist[i][0][k] != INF)
                req.push_back({true, dist[i][0][k], k, 0});
    for(int i = 0; i < q; i++)
        req.push_back({false, G[i], 0, i});
    sort(req.begin(), req.end(),
    [](Req a, Req b) {
        if(a.t == b.t)
            return a.add;
        return a.t < b.t;
    });

    for(Req r : req) {
        if(r.add) {
            if(cycle[r.k] == -1) {
                occ[r.t][r.k]++;
            } else {
                occ[r.t % cycle[r.k]][r.k]++;
            }
        } else {
            if(cycle[0] == -1) {
                if(r.t < N)
                    ans[r.id] += occ[r.t][0];
            } else {
                ans[r.id] += occ[r.t % cycle[0]][0];
            }
            if(cycle[1] == -1) {
                if(r.t < N)
                    ans[r.id] += occ[r.t][1];
            } else {
                ans[r.id] += occ[r.t % cycle[1]][1];
            }
        }
    }
    
    for(int i = 0; i < q; i++)
        answer(ans[i]);
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21580 KB Output is correct
2 Correct 13 ms 21580 KB Output is correct
3 Correct 13 ms 21580 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Correct 12 ms 21452 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 13 ms 21500 KB Output is correct
8 Correct 13 ms 21580 KB Output is correct
9 Correct 16 ms 21708 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21580 KB Output is correct
2 Correct 13 ms 21580 KB Output is correct
3 Correct 13 ms 21580 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Correct 12 ms 21452 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 13 ms 21500 KB Output is correct
8 Correct 13 ms 21580 KB Output is correct
9 Correct 16 ms 21708 KB Output is correct
10 Correct 12 ms 21500 KB Output is correct
11 Correct 24 ms 24340 KB Output is correct
12 Correct 41 ms 26060 KB Output is correct
13 Correct 72 ms 37444 KB Output is correct
14 Correct 182 ms 37660 KB Output is correct
15 Correct 502 ms 41580 KB Output is correct
16 Correct 157 ms 34840 KB Output is correct
17 Correct 359 ms 33388 KB Output is correct
18 Correct 41 ms 26564 KB Output is correct
19 Correct 152 ms 39404 KB Output is correct
20 Correct 478 ms 43252 KB Output is correct
21 Correct 202 ms 36416 KB Output is correct
22 Correct 289 ms 34960 KB Output is correct
23 Correct 181 ms 40728 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21580 KB Output is correct
2 Correct 13 ms 21580 KB Output is correct
3 Correct 13 ms 21580 KB Output is correct
4 Correct 12 ms 21452 KB Output is correct
5 Correct 12 ms 21452 KB Output is correct
6 Correct 15 ms 21580 KB Output is correct
7 Correct 13 ms 21500 KB Output is correct
8 Correct 13 ms 21580 KB Output is correct
9 Correct 16 ms 21708 KB Output is correct
10 Correct 12 ms 21500 KB Output is correct
11 Correct 24 ms 24340 KB Output is correct
12 Correct 41 ms 26060 KB Output is correct
13 Correct 72 ms 37444 KB Output is correct
14 Correct 182 ms 37660 KB Output is correct
15 Correct 502 ms 41580 KB Output is correct
16 Correct 157 ms 34840 KB Output is correct
17 Correct 359 ms 33388 KB Output is correct
18 Correct 41 ms 26564 KB Output is correct
19 Correct 152 ms 39404 KB Output is correct
20 Correct 478 ms 43252 KB Output is correct
21 Correct 202 ms 36416 KB Output is correct
22 Correct 289 ms 34960 KB Output is correct
23 Correct 181 ms 40728 KB Output is correct
24 Correct 14 ms 21588 KB Output is correct
25 Correct 25 ms 24652 KB Output is correct
26 Correct 42 ms 26688 KB Output is correct
27 Correct 70 ms 38564 KB Output is correct
28 Correct 181 ms 39456 KB Output is correct
29 Correct 550 ms 43352 KB Output is correct
30 Correct 144 ms 36536 KB Output is correct
31 Correct 345 ms 35000 KB Output is correct
32 Correct 44 ms 26772 KB Output is correct
33 Correct 162 ms 39388 KB Output is correct
34 Correct 566 ms 43436 KB Output is correct
35 Correct 161 ms 36436 KB Output is correct
36 Correct 371 ms 34984 KB Output is correct
37 Correct 152 ms 40776 KB Output is correct
38 Correct 161 ms 48364 KB Output is correct