oj.uz

Submission #1092982

# Submission time Handle Problem Language Result Execution time Memory
1092982 2024-09-25T15:03:26 Z Aviansh Tropical Garden (IOI11_garden) C++17
100 / 100
 1228 ms 22840 KB 
#include <bits/stdc++.h>
#include "garden.h"
#include "gardenlib.h"

using namespace std;

void dfs(int st, int dep, vector<int>(&g)[], int f[], int t, int n){
    f[st]=dep;
    for(int i : g[st]){
        if(i==t){
            f[t]=dep+1;
            continue;
        }
        if(i==st+n||i==st-n){
            dfs(i,dep,g,f,t, n);
            continue;
        }
        dfs(i,dep+1,g,f,t, n);
    }
}

void count_routes(int n, int m, int t, int edges[][2], int q, int G[])
{
    vector<int>g[2*n];
    int cn[n];
    fill(cn,cn+n,0);
    for(int i = 0;i<m;i++){
        int u1=edges[i][0];
        int v1=edges[i][1];
        if(cn[u1]>cn[v1]){
            swap(u1,v1);
        }
        int u2 = u1+n;
        int v2 = v1+n;
        if(cn[u1]==0&&cn[v1]==0){
            g[v2].push_back(u1);
            g[u2].push_back(v1);
        }
        else if(cn[u1]==0&&cn[v1]==1){
            g[v1].push_back(u1);
            g[u2].push_back(v2);
        }
        else if(cn[u1]==0&&cn[v1]>1){
            g[v1].push_back(u1);
        }
        else if(cn[u1]==1&&cn[v1]==1){
            g[v1].push_back(u2);
            g[u1].push_back(v2);
        }
        else if(cn[u1]==1&&cn[v1]>1){
            g[v1].push_back(u2);
        }
        cn[u1]++;
        cn[v1]++;
    }
    for(int i = 0;i<n;i++){
        if(cn[i]==1){
            g[i].push_back(i+n);
        }
    }    int f1[2*n];
    fill(f1,f1+2*n,-1);
    queue<pair<int,int>>qu;
    qu.push({t,0});
    while(!qu.empty()){
        pair<int,int>p=qu.front();
        qu.pop();
        f1[p.first]=p.second;
        //cout << p.first << " " << f1[p.first] << "\n";
        if(p.first==t&&p.second!=0)
            continue;
        for(int v : g[p.first]){
            if(v==p.first+n||v==p.first-n){
                qu.push({v,p.second});
                continue;
            }
            qu.push({v,p.second+1});
        }
    }
    //dfs(t,0,g,f1,t,-1, n);
    int f2[2*n];
    fill(f2,f2+2*n,-1);
    qu.push({n+t,0});
    while(!qu.empty()){
        pair<int,int>p=qu.front();
        qu.pop();
        f2[p.first]=p.second;
        //cout << p.first << " " << f2[p.first] << "\n";
        if(p.first==n+t&&p.second!=0)
            continue;
        for(int v : g[p.first]){
            if(v==p.first+n||v==p.first-n){
                qu.push({v,p.second});
                continue;
            }
            qu.push({v,p.second+1});
        }
    }
    //dfs(t+n,0,g,f2,t+n,-1, n);
    auto t1 = [&] (int u, int D) -> bool{
        if(f1[u]==-1) return 0;
        if(f1[u]==D) return 1;
        if(f1[u]>D) return 0;
        return f1[t] && (D-f1[u])%f1[t]==0;
    };

    auto t2 = [&] (int u, int D) -> bool{
        if(f2[u]==-1) return 0;
        if(f2[u]==D) return 1;
        if(f2[u]>D) return 0;
        return f2[t+n] && (D-f2[u])%f2[t+n]==0;
    };
    for(int i = 0;i<q;i++){
        int ans = 0;
        for(int j = 0;j<n;j++){
            //cout << f1[j] << " " << f2[j] << "\n";
            if(t1(j,G[i])||t2(j,G[i])){
                ans++;
            }
        }
        answer(ans);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 3328 KB Output is correct
12 Correct 16 ms 5468 KB Output is correct
13 Correct 26 ms 12880 KB Output is correct
14 Correct 43 ms 18484 KB Output is correct
15 Correct 52 ms 18760 KB Output is correct
16 Correct 38 ms 12808 KB Output is correct
17 Correct 38 ms 11344 KB Output is correct
18 Correct 15 ms 5496 KB Output is correct
19 Correct 49 ms 18448 KB Output is correct
20 Correct 56 ms 18772 KB Output is correct
21 Correct 39 ms 12996 KB Output is correct
22 Correct 41 ms 11188 KB Output is correct
23 Correct 47 ms 20240 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 448 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 440 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 3328 KB Output is correct
12 Correct 16 ms 5468 KB Output is correct
13 Correct 26 ms 12880 KB Output is correct
14 Correct 43 ms 18484 KB Output is correct
15 Correct 52 ms 18760 KB Output is correct
16 Correct 38 ms 12808 KB Output is correct
17 Correct 38 ms 11344 KB Output is correct
18 Correct 15 ms 5496 KB Output is correct
19 Correct 49 ms 18448 KB Output is correct
20 Correct 56 ms 18772 KB Output is correct
21 Correct 39 ms 12996 KB Output is correct
22 Correct 41 ms 11188 KB Output is correct
23 Correct 47 ms 20240 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 68 ms 3568 KB Output is correct
26 Correct 106 ms 5560 KB Output is correct
27 Correct 706 ms 13104 KB Output is correct
28 Correct 685 ms 18516 KB Output is correct
29 Correct 768 ms 18772 KB Output is correct
30 Correct 393 ms 12880 KB Output is correct
31 Correct 439 ms 11352 KB Output is correct
32 Correct 107 ms 5464 KB Output is correct
33 Correct 688 ms 18516 KB Output is correct
34 Correct 753 ms 18772 KB Output is correct
35 Correct 424 ms 12884 KB Output is correct
36 Correct 765 ms 11348 KB Output is correct
37 Correct 520 ms 20524 KB Output is correct
38 Correct 1228 ms 22840 KB Output is correct