oj.uz

Submission #650572

# Submission time Handle Problem Language Result Execution time Memory
650572 2022-10-14T08:37:26 Z PoonYaPat Tropical Garden (IOI11_garden) C++14
0 / 100
 16 ms 23188 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;

int n,m,dis1[300001],dis2[300001],cycle1[300001],cycle2[300001];
vector<int> adj[150001],adj2[300001],rev[300001];
bool vis[300001];
stack<int> st;

void new_graph(int now) {
    if (now>=n) {
        if (adj[now-n].size()>1) { //go second best
            int des=adj[now-n][1];
            if (adj[des][0]==now-n) adj2[now].push_back(des+n);
            else adj2[now].push_back(des);
        } else { //go best
            int des=adj[now-n][0];
            if (adj[des][0]==now-n) adj2[now].push_back(des+n);
            else adj2[now].push_back(des);
        }
    } else { //go best
        int des=adj[now][0];
        if (adj[des][0]==now) adj2[now].push_back(des+n);
        else adj2[now].push_back(des);
    }
}

void dfs(int x, int step, int *dis, int * cycle_sz) {
    if (!vis[x]) {
        vis[x]=true;
        dis[x]=step;
        st.push(x);
        for (auto s : rev[x]) dfs(s,step+1,dis,cycle_sz);
    } else {
        while (!st.empty() && st.top()!=x) {
            cycle_sz[st.top()]=step-dis[x];
            st.pop();
        }
        cycle_sz[x]=step-dis[x];
        st.pop();
    }
}

void count_routes(int N, int M, int P, int R[][2], int q, int g[]) {
    n=N; m=M;
    for (int i=0; i<m; ++i) {
        adj[R[i][0]].push_back(R[i][1]);
        adj[R[i][1]].push_back(R[i][0]);
    }
    for (int i=0; i<2*n; ++i) new_graph(i);
    for (int i=0; i<2*n; ++i) for (auto s : adj2[i]) rev[s].push_back(i);
    memset(dis1,0x3f,sizeof(dis1));
    memset(dis2,0x3f,sizeof(dis2));
    memset(cycle1,-1,sizeof(cycle1));
    memset(cycle2,-1,sizeof(cycle2));

    dfs(P,0,dis1,cycle1);
    while (!st.empty()) st.pop();
    memset(vis,0,sizeof(vis));
    dfs(P+n,0,dis2,cycle2);

    for (int i=0; i<q; ++i) {
        int want=g[i],cnt=0;

        for (int node=0; node<n; ++node) {
            int have=false;

            if (dis1[node]==want) have=true;
            if (dis2[node]==want) have=true;
            if (cycle1[node]!=-1 && want>=dis1[node] && (want-dis1[node])%cycle1[node]==0) have=true;
            if (cycle2[node]!=-1 && want>=dis2[node] && (want-dis2[node])%cycle2[node]==0) have=true;

            if (have) ++cnt;
        }
        answer(cnt);
    }
}

Subtask #1
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23124 KB Output is correct
2 Correct 14 ms 22996 KB Output is correct
3 Correct 14 ms 23044 KB Output is correct
4 Correct 15 ms 22916 KB Output is correct
5 Correct 12 ms 22868 KB Output is correct
6 Correct 16 ms 23188 KB Output is correct
7 Correct 12 ms 22868 KB Output is correct
8 Incorrect 14 ms 22996 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23124 KB Output is correct
2 Correct 14 ms 22996 KB Output is correct
3 Correct 14 ms 23044 KB Output is correct
4 Correct 15 ms 22916 KB Output is correct
5 Correct 12 ms 22868 KB Output is correct
6 Correct 16 ms 23188 KB Output is correct
7 Correct 12 ms 22868 KB Output is correct
8 Incorrect 14 ms 22996 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23124 KB Output is correct
2 Correct 14 ms 22996 KB Output is correct
3 Correct 14 ms 23044 KB Output is correct
4 Correct 15 ms 22916 KB Output is correct
5 Correct 12 ms 22868 KB Output is correct
6 Correct 16 ms 23188 KB Output is correct
7 Correct 12 ms 22868 KB Output is correct
8 Incorrect 14 ms 22996 KB Output isn't correct
9 Halted 0 ms 0 KB -