oj.uz

Submission #1108132

# Submission time Handle Problem Language Result Execution time Memory
1108132 2024-11-02T23:58:25 Z laight Tropical Garden (IOI11_garden) C++17
100 / 100
 706 ms 29124 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pi pair<int, int>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pll pair<ll, ll>
#define umi unordered_map<int, int>
#define umll unordered_map<ll, ll>
#define umllv unordered_map<ll, vector<ll>>
 
#define getchar() (*_pinp?*_pinp++:(_inp[fread(_pinp=_inp, 1, 4096, stdin)]='\0', *_pinp++))
char _inp[4097], *_pinp=_inp;
#define scan(x) do{while((x=getchar())<'-'); _ssign=x=='-'; if(_ssign) while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0'); x=_ssign?-x:x;}while(0)
char _; bool _ssign;
 
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
 
using namespace std; using namespace __gnu_pbds;
 
const int MM = 1e5+5e4+5;
const ll inf = 2e15+1;
const int lg = 17; // 17 for 1e5, 31 for 1e9
 
int n, m, p, a, b, lv, cycl, cl1, cl2, q, inp; bool cvis[2*MM], vis[2*MM], hcy, cy1, cy2;
vector<int> g(2005), ans(2005), to(2*MM), rev[2*MM], graph[MM], dis, dis2;
 
void g_f(int c, vector<int> &dv){
    queue<pi> q; q.push({0, c}); vis[c] = 1;
    while (!q.empty()){
        int cur = q.front().se, cd = q.front().fi;
        q.pop();
        if (cur < n) dv.pb(cd);
        for (int i : rev[cur]){
            if (!vis[i]){
                vis[i] = 1;
                q.push({cd+1, i});
            }
        }
    }
}
void cyc_f(int c, int d, int pe){
    if (cvis[c]){
        if (c == pe) {hcy = 1; cycl = d;}
        return;
    }
    cvis[c] = 1; cyc_f(to[c], d+1, pe);
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
    // cin.tie(0); cin.sync_with_stdio(0);
    // freopen("changyue_tst.txt", "r", stdin);
    n = N; m = M; p = P;
    for (int i=0; i<m; ++i){
        graph[R[i][0]].pb(R[i][1]); graph[R[i][1]].pb(R[i][0]);
    }
    q = Q; for (int i=0; i<q; i++) {g[i] = G[i];}
    for (int i=0; i<n; ++i){
        int oth = graph[i][0];
        if (i == graph[oth][0]){
            to[i] = n+oth;
        }
        else {to[i] = oth;}
        if (graph[i].size() >= 2){
            int oth2 = graph[i][1];
            if (i == graph[oth2][0]){
                to[n+i] = n+oth2;
            }
            else {to[n+i] = oth2;}
        }
        else{
            if (i == graph[oth][0]){
                to[n+i] = n+oth;
            }
            else {to[n+i] = oth;}
        }
    }
    for (int i=0; i<2*n; i++){
        rev[to[i]].pb(i);
    }
    cl1 = cl2 = 0;
    hcy = 0; cycl = 0;
    cyc_f(p, 0, p);
    cl1 = cycl; cy1 = hcy;
    memset(cvis, 0, sizeof(cvis));
    hcy = 0; cycl = 0;
    cyc_f(n+p, 0, n+p);
    cl2 = cycl; cy2 = hcy;
    g_f(p, dis); memset(vis, 0, sizeof(vis)); g_f(n+p, dis2);
    for (int i=0; i<q; ++i){
        int tv=g[i], ca=0;
        for (int j : dis){
            if (j > tv) break;
            if (cl1){
                if ((tv-j)%cl1 == 0) ++ca;
            }
            else{
                if (tv == j) ++ca;
            }
        }
        for (int j : dis2){
            if (j > tv) break;
            if (cl2){
                if ((tv-j)%cl2 == 0) ++ca;
            }
            else{
                if (tv == j) ++ca;
            }
        }
        answer(ca);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14160 KB Output is correct
2 Correct 4 ms 14160 KB Output is correct
3 Correct 3 ms 14160 KB Output is correct
4 Correct 4 ms 14112 KB Output is correct
5 Correct 3 ms 13904 KB Output is correct
6 Correct 3 ms 14160 KB Output is correct
7 Correct 3 ms 13904 KB Output is correct
8 Correct 4 ms 14160 KB Output is correct
9 Correct 4 ms 14124 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14160 KB Output is correct
2 Correct 4 ms 14160 KB Output is correct
3 Correct 3 ms 14160 KB Output is correct
4 Correct 4 ms 14112 KB Output is correct
5 Correct 3 ms 13904 KB Output is correct
6 Correct 3 ms 14160 KB Output is correct
7 Correct 3 ms 13904 KB Output is correct
8 Correct 4 ms 14160 KB Output is correct
9 Correct 4 ms 14124 KB Output is correct
10 Correct 3 ms 13904 KB Output is correct
11 Correct 10 ms 15652 KB Output is correct
12 Correct 18 ms 16720 KB Output is correct
13 Correct 35 ms 22988 KB Output is correct
14 Correct 60 ms 23112 KB Output is correct
15 Correct 78 ms 24260 KB Output is correct
16 Correct 54 ms 21200 KB Output is correct
17 Correct 49 ms 20420 KB Output is correct
18 Correct 18 ms 16720 KB Output is correct
19 Correct 58 ms 23124 KB Output is correct
20 Correct 68 ms 23748 KB Output is correct
21 Correct 47 ms 21188 KB Output is correct
22 Correct 50 ms 20296 KB Output is correct
23 Correct 54 ms 23880 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 14160 KB Output is correct
2 Correct 4 ms 14160 KB Output is correct
3 Correct 3 ms 14160 KB Output is correct
4 Correct 4 ms 14112 KB Output is correct
5 Correct 3 ms 13904 KB Output is correct
6 Correct 3 ms 14160 KB Output is correct
7 Correct 3 ms 13904 KB Output is correct
8 Correct 4 ms 14160 KB Output is correct
9 Correct 4 ms 14124 KB Output is correct
10 Correct 3 ms 13904 KB Output is correct
11 Correct 10 ms 15652 KB Output is correct
12 Correct 18 ms 16720 KB Output is correct
13 Correct 35 ms 22988 KB Output is correct
14 Correct 60 ms 23112 KB Output is correct
15 Correct 78 ms 24260 KB Output is correct
16 Correct 54 ms 21200 KB Output is correct
17 Correct 49 ms 20420 KB Output is correct
18 Correct 18 ms 16720 KB Output is correct
19 Correct 58 ms 23124 KB Output is correct
20 Correct 68 ms 23748 KB Output is correct
21 Correct 47 ms 21188 KB Output is correct
22 Correct 50 ms 20296 KB Output is correct
23 Correct 54 ms 23880 KB Output is correct
24 Correct 4 ms 13904 KB Output is correct
25 Correct 19 ms 15696 KB Output is correct
26 Correct 20 ms 16852 KB Output is correct
27 Correct 706 ms 22980 KB Output is correct
28 Correct 156 ms 23112 KB Output is correct
29 Correct 635 ms 23760 KB Output is correct
30 Correct 431 ms 21148 KB Output is correct
31 Correct 363 ms 20420 KB Output is correct
32 Correct 19 ms 16720 KB Output is correct
33 Correct 153 ms 23112 KB Output is correct
34 Correct 615 ms 24268 KB Output is correct
35 Correct 422 ms 21188 KB Output is correct
36 Correct 392 ms 20576 KB Output is correct
37 Correct 112 ms 23932 KB Output is correct
38 Correct 657 ms 29124 KB Output is correct