oj.uz

답안 #969843

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
969843 2024-04-25T16:44:57 Z codefox 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
100 / 100
 2163 ms 13904 KB 
#include "garden.h"
#include "gardenlib.h"
#include<bits/stdc++.h>

using namespace std;

#pragma GCC optimize("Ofast")

#define arr array<int, 2>

vector<arr> graph;
vector<arr> vis;
vector<arr> dist1;
vector<arr> dist2;
int starti, starts;

int next(int i, int state)
{
    if (state==0) 
    {
        int b = 0;
        if (i==graph[graph[i][0]][0]) b= 1;
        return b;
    }
    else 
    {
        int b = 0;
        if (i==graph[graph[i][1]][0]) b= 1;
        return b;
    }
}

int fcycle(int i, int state)
{
    if (vis[i][state])
    {
        if (i == starti && state == starts) return 0;
        else return 2*-1e9;
    }
    vis[i][state] = 1;
    if (state==0) return fcycle(graph[i][0], next(i,state))+1;
    else return fcycle(graph[i][1], next(i,state))+1;
}

int dfs1(int i, int state)
{
    if (vis[i][state]) return dist1[i][state];
    vis[i][state] = 1;
    if (state==0) dist1[i][state] = dfs1(graph[i][0], next(i,state))+1;
    else dist1[i][state] = dfs1(graph[i][1], next(i,state))+1;
    return dist1[i][state];
}

int dfs2(int i, int state)
{
    if (vis[i][state]) return dist2[i][state];
    vis[i][state] = 1;
    if (state==0) dist2[i][state] = dfs2(graph[i][0], next(i,state))+1;
    else dist2[i][state] = dfs2(graph[i][1], next(i,state))+1;
    return dist2[i][state];
}

const int K = 2*1e9;

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    graph.assign(N, {-1, -1});
    dist1.assign(N, {K, K});
    dist2.assign(N, {K, K});
    for (int i = 0; i < M; i++)
    {
        int r1 = R[i][0];
        int r2 = R[i][1];
        if (graph[r1][0]==-1) graph[r1][0] = r2;
        else if (graph[r1][1]==-1) graph[r1][1] = r2;

        if (graph[r2][0]==-1) graph[r2][0] = r1;
        else if (graph[r2][1]==-1) graph[r2][1] = r1;
    }
    for (int i = 0; i < N; i++)
    {
        if (graph[i][1]==-1) graph[i][1] = graph[i][0];
    }

    vis.assign(N, {0,0});
    starti = P;
    starts = 0;
    int f = fcycle(starti, starts);
    vis.assign(N, {0,0});
    starts = 1;
    int s = fcycle(starti, starts);    

    vis.assign(N, {0,0});
    dist1[P][0] = 0;
    vis[P][0] = 1;
    for (int i = 0; i < N; i++)
    {
        dfs1(i, 0);
    }
    vis.assign(N, {0,0});
    dist2[P][1] = 0;
    vis[P][1] = 1;
    for (int i = 0; i < N; i++)
    {
        dfs2(i, 0);
    }

    for (int i = 0; i < Q; i++)
    {
        int ans=0;
        for (int j = 0; j < N; j++)
        {
            int b = 0;
            if (G[i]-dist1[j][0]>=0 && (G[i]-dist1[j][0])%f==0) b=1;
            if (G[i]-dist2[j][0]>=0 && (G[i]-dist2[j][0])%s==0) b=1;
            ans +=b;
        }
        answer(ans);
        //cout << ans;
    }
}

/*
int main()
{
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);

    int n, m, p, q;
    cin >> n >> m >> p >> q;
    int R[m][2];
    int G[q];
    for (int i = 0; i < m; i++) cin >> R[i][0] >> R[i][1];
    for (int i = 0; i < q; i++) cin >> G[i];
    count_routes(n, m, p, R, q, G);

    return 0;
}
*/

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 3676 KB Output is correct
12 Correct 10 ms 4440 KB Output is correct
13 Correct 21 ms 11612 KB Output is correct
14 Correct 28 ms 8536 KB Output is correct
15 Correct 29 ms 8528 KB Output is correct
16 Correct 25 ms 6996 KB Output is correct
17 Correct 24 ms 6484 KB Output is correct
18 Correct 10 ms 4444 KB Output is correct
19 Correct 28 ms 8388 KB Output is correct
20 Correct 28 ms 8672 KB Output is correct
21 Correct 28 ms 6884 KB Output is correct
22 Correct 27 ms 6488 KB Output is correct
23 Correct 28 ms 9048 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 5 ms 3676 KB Output is correct
12 Correct 10 ms 4440 KB Output is correct
13 Correct 21 ms 11612 KB Output is correct
14 Correct 28 ms 8536 KB Output is correct
15 Correct 29 ms 8528 KB Output is correct
16 Correct 25 ms 6996 KB Output is correct
17 Correct 24 ms 6484 KB Output is correct
18 Correct 10 ms 4444 KB Output is correct
19 Correct 28 ms 8388 KB Output is correct
20 Correct 28 ms 8672 KB Output is correct
21 Correct 28 ms 6884 KB Output is correct
22 Correct 27 ms 6488 KB Output is correct
23 Correct 28 ms 9048 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 77 ms 3784 KB Output is correct
26 Correct 108 ms 4588 KB Output is correct
27 Correct 2032 ms 11828 KB Output is correct
28 Correct 747 ms 8580 KB Output is correct
29 Correct 2163 ms 8704 KB Output is correct
30 Correct 1257 ms 7188 KB Output is correct
31 Correct 1250 ms 6876 KB Output is correct
32 Correct 108 ms 4444 KB Output is correct
33 Correct 800 ms 8532 KB Output is correct
34 Correct 2157 ms 8792 KB Output is correct
35 Correct 1348 ms 7248 KB Output is correct
36 Correct 1473 ms 6632 KB Output is correct
37 Correct 581 ms 9308 KB Output is correct
38 Correct 1764 ms 13904 KB Output is correct