oj.uz

답안 #136638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
136638 2019-07-25T23:13:39 Z jovan_b 열대 식물원 (Tropical Garden) (IOI11_garden) C++17
100 / 100
 4393 ms 96688 KB 
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>

using namespace std;

vector <pair <int, int>> dgraf[1000005];
int parent[1000005];
vector <int> graf[1000005];

bool resenje[1000005];

bool cmp(pair <int, int> a, pair <int, int> b){
    return a.second < b.second;
}

int n, m, p, q;
int depth[1000005][2];
int cycle_size[1000005];
bool visited[1000005][2];

void dfs(int v, int koji){
    visited[v][koji] = 1;
    for(auto c : graf[v]){
        if(visited[c][koji]){
            int x = v;
            queue <int> q;
            while(x != c){
                q.push(x);
                x = parent[x];
                if(x == c) break;
            }
            q.push(c);
            int g = q.size();
            while(!q.empty()){
                cycle_size[q.front()] = g;
                q.pop();
            }
        }
        else{
            depth[c][koji] = depth[v][koji] + 1;
            dfs(c, koji);
        }
    }
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
    n = N, m = M, p = P, q = Q;
    for(int i=0; i<m; i++){
        dgraf[R[i][0]].push_back({R[i][1], i});
        dgraf[R[i][1]].push_back({R[i][0], i});
    }
    for(int i=0; i<n; i++){
        sort(dgraf[i].begin(), dgraf[i].end(), cmp);
    }
    for(int i=0; i<n; i++){
        if(dgraf[i].size() == 1){
            if(dgraf[dgraf[i][0].first][0].first == i){
                parent[i] = dgraf[i][0].first + n;
                parent[i+n] = dgraf[i][0].first + n;
            }
            else{
                parent[i] = dgraf[i][0].first;
                parent[i+n] = dgraf[i][0].first;
            }
        }
        else{
            if(dgraf[dgraf[i][0].first][0].first == i) parent[i] = dgraf[i][0].first + n;
            else parent[i] = dgraf[i][0].first;
            if(dgraf[dgraf[i][1].first][0].first == i) parent[i+n] = dgraf[i][1].first + n;
            else parent[i+n] = dgraf[i][1].first;
        }
    }
    for(int i=0; i<2*n; i++){
        graf[parent[i]].push_back(i);
    }
    for(int i=0; i<2*n; i++){
        depth[i][0] = depth[i][1] = -1;
    }
    depth[p][0] = 0;
    dfs(p, 0);
    depth[p+n][1] = 0;
    dfs(p+n, 1);
    for(int query=0; query<q; query++){
        int k = G[query];
        int cnt = 0;
        for(int i=0; i<n; i++) resenje[i] = 0;
        for(int i=0; i<n; i++){
            if(depth[i][0] == -1) continue;
            if(depth[i][0] == k){
                resenje[i] = 1;
            }
            else if(cycle_size[p]){
                if(k > depth[i][0] && (k-depth[i][0])%cycle_size[p] == 0){
                    resenje[i] = 1;
                    //cout << i << " e1 " << endl;
                }
            }
        }
        /*for(int i=n; i<2*n; i++){
            if(dgraf[i-n].size() != 1){
                continue;
            }
            if(depth[i][0] == -1) continue;
            if(depth[i][0] == k){
                resenje[i-n] = 1;
            }
            else if(cycle_size[p]){
                if(k > depth[i][0] && (k-depth[i][0])%cycle_size[p] == 0){
                    resenje[i-n] = 1;
                    //cout << i << " e2 " << endl;
                }
            }
        }*/
        /// drugi
        for(int i=0; i<n; i++){
            if(depth[i][1] == -1) continue;
            if(depth[i][1] == k){
                resenje[i] = 1;
            }
            else if(cycle_size[p+n]){
                if(k > depth[i][1] && (k-depth[i][1])%cycle_size[p+n] == 0){
                    //cout << i << " e3 " << endl;
                    resenje[i] = 1;
                }
            }
        }
        /*for(int i=n; i<2*n; i++){
            if(dgraf[i-n].size() != 1){
                continue;
            }
            if(depth[i][1] == -1) continue;
            if(depth[i][1] == k){
                resenje[i-n] = 1;
            }
            else if(cycle_size[p+n]){
                if(k > depth[i][1] && (k-depth[i][1])%cycle_size[p+n] == 0){
                    resenje[i-n] = 1;
                    //cout << i << " e4 " << endl;
                }
            }
        }*/
        for(int i=0; i<n; i++){
            cnt += resenje[i];
        }
        answer(cnt);
    }
    return;
}
/*
2
1 0
0 1
5
1 2 3 4 5
sdgfhsdfgdfgds
*/

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 47864 KB Output is correct
2 Correct 46 ms 47612 KB Output is correct
3 Correct 45 ms 47580 KB Output is correct
4 Correct 45 ms 47480 KB Output is correct
5 Correct 45 ms 47356 KB Output is correct
6 Correct 55 ms 47864 KB Output is correct
7 Correct 53 ms 47352 KB Output is correct
8 Correct 46 ms 47480 KB Output is correct
9 Correct 58 ms 47708 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 47864 KB Output is correct
2 Correct 46 ms 47612 KB Output is correct
3 Correct 45 ms 47580 KB Output is correct
4 Correct 45 ms 47480 KB Output is correct
5 Correct 45 ms 47356 KB Output is correct
6 Correct 55 ms 47864 KB Output is correct
7 Correct 53 ms 47352 KB Output is correct
8 Correct 46 ms 47480 KB Output is correct
9 Correct 58 ms 47708 KB Output is correct
10 Correct 45 ms 47352 KB Output is correct
11 Correct 66 ms 50040 KB Output is correct
12 Correct 82 ms 51832 KB Output is correct
13 Correct 137 ms 91696 KB Output is correct
14 Correct 181 ms 62012 KB Output is correct
15 Correct 221 ms 62352 KB Output is correct
16 Correct 182 ms 59132 KB Output is correct
17 Correct 172 ms 57464 KB Output is correct
18 Correct 82 ms 51832 KB Output is correct
19 Correct 183 ms 61944 KB Output is correct
20 Correct 217 ms 62456 KB Output is correct
21 Correct 250 ms 58968 KB Output is correct
22 Correct 219 ms 57592 KB Output is correct
23 Correct 189 ms 63732 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 47864 KB Output is correct
2 Correct 46 ms 47612 KB Output is correct
3 Correct 45 ms 47580 KB Output is correct
4 Correct 45 ms 47480 KB Output is correct
5 Correct 45 ms 47356 KB Output is correct
6 Correct 55 ms 47864 KB Output is correct
7 Correct 53 ms 47352 KB Output is correct
8 Correct 46 ms 47480 KB Output is correct
9 Correct 58 ms 47708 KB Output is correct
10 Correct 45 ms 47352 KB Output is correct
11 Correct 66 ms 50040 KB Output is correct
12 Correct 82 ms 51832 KB Output is correct
13 Correct 137 ms 91696 KB Output is correct
14 Correct 181 ms 62012 KB Output is correct
15 Correct 221 ms 62352 KB Output is correct
16 Correct 182 ms 59132 KB Output is correct
17 Correct 172 ms 57464 KB Output is correct
18 Correct 82 ms 51832 KB Output is correct
19 Correct 183 ms 61944 KB Output is correct
20 Correct 217 ms 62456 KB Output is correct
21 Correct 250 ms 58968 KB Output is correct
22 Correct 219 ms 57592 KB Output is correct
23 Correct 189 ms 63732 KB Output is correct
24 Correct 46 ms 47420 KB Output is correct
25 Correct 197 ms 50204 KB Output is correct
26 Correct 269 ms 51932 KB Output is correct
27 Correct 1975 ms 91736 KB Output is correct
28 Correct 1717 ms 62084 KB Output is correct
29 Correct 2573 ms 62496 KB Output is correct
30 Correct 1391 ms 59284 KB Output is correct
31 Correct 1389 ms 57600 KB Output is correct
32 Correct 287 ms 51932 KB Output is correct
33 Correct 1679 ms 62048 KB Output is correct
34 Correct 2393 ms 62352 KB Output is correct
35 Correct 1366 ms 58876 KB Output is correct
36 Correct 2045 ms 57572 KB Output is correct
37 Correct 1334 ms 63640 KB Output is correct
38 Correct 4393 ms 96688 KB Output is correct