oj.uz

Submission #49789

# Submission time Handle Problem Language Result Execution time Memory
49789 2018-06-03T06:42:49 Z gs13105 Tropical Garden (IOI11_garden) C++17
100 / 100
 69 ms 13788 KB 
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <iterator>

using namespace std;

void answer(int x);

const int MAXN = 150000;
const int MAXN2 = MAXN * 2;

int arr[MAXN2 + 10];
int dis[2][MAXN2 + 10];
bool chk[2][MAXN2 + 10];

void f(int x, int p)
{
    chk[p % 2][x] = 1;
    if(arr[x] == p)
    {
        dis[p % 2][x] = 1;
        return;
    }

    if(!chk[p % 2][arr[x]])
        f(arr[x], p);

    if(dis[p % 2][arr[x]])
        dis[p % 2][x] = dis[p % 2][arr[x]] + 1;
}

int mem1[MAXN + 10];
int mem2[MAXN + 10];
int sum[2][MAXN2 + 10];

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    memset(mem1, -1, sizeof mem1);
    memset(mem2, -1, sizeof mem2);
    memset(arr, -1, sizeof arr);
    for(int i = 0; i < M; i++)
    {
        int x = R[i][0];
        int y = R[i][1];

        if(mem1[x] == -1)
            mem1[x] = y;
        else if(mem2[x] == -1)
            mem2[x] = y;

        if(mem1[y] == -1)
            mem1[y] = x;
        else if(mem2[y] == -1)
            mem2[y] = x;
    }

    for(int i = 0; i < N; i++)
    {
        if(mem1[mem1[i]] == i && mem2[mem1[i]] != -1)
            arr[2 * i] = 2 * mem1[i] + 1;
        else
            arr[2 * i] = 2 * mem1[i];

        if(mem2[i] != -1)
        {
            if(mem1[mem2[i]] == i && mem2[mem2[i]] != -1)
                arr[2 * i + 1] = 2 * mem2[i] + 1;
            else
                arr[2 * i + 1] = 2 * mem2[i];
        }
    }

    for(int r = 0; r < 2; r++)
        for(int i = 0; i < 2 * N; i++)
            if(!chk[r][i] && arr[i] != -1)
                f(i, 2 * P + r);

    for(int r = 0; r < 2; r++)
        for(int i = 0; i < N; i++)
            if(dis[r][2 * i])
                sum[r][dis[r][2 * i]]++;

    for(int r = 0; r < 2; r++)
    {
        int c = dis[r][2 * P + r];
        if(!c)
            continue;

        for(int i = 1; i <= 2 * N; i++)
            if(i - c >= 1)
                sum[r][i] += sum[r][i - c];
    }

    int c[2] = { dis[0][2 * P], dis[1][2 * P + 1] };
    if(!c[0])
        c[0] = c[1];
    if(!c[1])
        c[1] = c[0];
    for(int i = 0; i < Q; i++)
    {
        int ans = 0;
        for(int r=0;r<2;r++)
        {
            int t = G[i];
            if(t > 2 * N && c[r])
                t -= ((t - 2 * N + c[r] - 1) / c[r]) * c[r];

            if(t <= 2 * N)
                ans += sum[r][t];
        }
        answer(ans);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2800 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2948 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2800 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2948 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 11 ms 3832 KB Output is correct
12 Correct 22 ms 4660 KB Output is correct
13 Correct 37 ms 11484 KB Output is correct
14 Correct 69 ms 8324 KB Output is correct
15 Correct 66 ms 9060 KB Output is correct
16 Correct 51 ms 7012 KB Output is correct
17 Correct 51 ms 6716 KB Output is correct
18 Correct 21 ms 4044 KB Output is correct
19 Correct 56 ms 9156 KB Output is correct
20 Correct 59 ms 9396 KB Output is correct
21 Correct 44 ms 6408 KB Output is correct
22 Correct 50 ms 7240 KB Output is correct
23 Correct 56 ms 8568 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2800 KB Output is correct
2 Correct 4 ms 2680 KB Output is correct
3 Correct 4 ms 2808 KB Output is correct
4 Correct 4 ms 2680 KB Output is correct
5 Correct 4 ms 2680 KB Output is correct
6 Correct 5 ms 2808 KB Output is correct
7 Correct 4 ms 2680 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2948 KB Output is correct
10 Correct 4 ms 2680 KB Output is correct
11 Correct 11 ms 3832 KB Output is correct
12 Correct 22 ms 4660 KB Output is correct
13 Correct 37 ms 11484 KB Output is correct
14 Correct 69 ms 8324 KB Output is correct
15 Correct 66 ms 9060 KB Output is correct
16 Correct 51 ms 7012 KB Output is correct
17 Correct 51 ms 6716 KB Output is correct
18 Correct 21 ms 4044 KB Output is correct
19 Correct 56 ms 9156 KB Output is correct
20 Correct 59 ms 9396 KB Output is correct
21 Correct 44 ms 6408 KB Output is correct
22 Correct 50 ms 7240 KB Output is correct
23 Correct 56 ms 8568 KB Output is correct
24 Correct 4 ms 2808 KB Output is correct
25 Correct 9 ms 3856 KB Output is correct
26 Correct 20 ms 4556 KB Output is correct
27 Correct 37 ms 11464 KB Output is correct
28 Correct 54 ms 9140 KB Output is correct
29 Correct 59 ms 9180 KB Output is correct
30 Correct 52 ms 7056 KB Output is correct
31 Correct 50 ms 6444 KB Output is correct
32 Correct 21 ms 3880 KB Output is correct
33 Correct 55 ms 8560 KB Output is correct
34 Correct 58 ms 9140 KB Output is correct
35 Correct 51 ms 6364 KB Output is correct
36 Correct 52 ms 6344 KB Output is correct
37 Correct 56 ms 8236 KB Output is correct
38 Correct 68 ms 13788 KB Output is correct