oj.uz

Submission #49785

# Submission time Handle Problem Language Result Execution time Memory
49785 2018-06-03T06:29:40 Z gs13105 Tropical Garden (IOI11_garden) C++17
49 / 100
 60 ms 12960 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)
{
    //assert(!chk[p % 2][x]);
    chk[p % 2][x] = 1;
    if(arr[x] == p)
    {
        //assert(!dis[p % 2][x]);
        dis[p % 2][x] = 1;
        return;
    }

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

    //assert(!dis[p % 2][x]);
    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++)
    {
        //assert(mem1[i] != -1);
        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])
                assert(dis[r][2 * i] <= 2 * N), 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];
    }

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

        if(t > 2 * N)
            answer(0);
        else
            answer(sum[0][t] + sum[1][t]);
    }
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 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 2780 KB Output is correct
7 Correct 4 ms 2684 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2780 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 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 2780 KB Output is correct
7 Correct 4 ms 2684 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2780 KB Output is correct
10 Correct 4 ms 2724 KB Output is correct
11 Correct 11 ms 3576 KB Output is correct
12 Correct 22 ms 4264 KB Output is correct
13 Correct 37 ms 11004 KB Output is correct
14 Correct 59 ms 7752 KB Output is correct
15 Correct 60 ms 8620 KB Output is correct
16 Correct 50 ms 6468 KB Output is correct
17 Correct 48 ms 5844 KB Output is correct
18 Correct 20 ms 3532 KB Output is correct
19 Correct 56 ms 8368 KB Output is correct
20 Correct 59 ms 8624 KB Output is correct
21 Correct 51 ms 5656 KB Output is correct
22 Runtime error 58 ms 12960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2780 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 2780 KB Output is correct
7 Correct 4 ms 2684 KB Output is correct
8 Correct 4 ms 2808 KB Output is correct
9 Correct 6 ms 2780 KB Output is correct
10 Correct 4 ms 2724 KB Output is correct
11 Correct 11 ms 3576 KB Output is correct
12 Correct 22 ms 4264 KB Output is correct
13 Correct 37 ms 11004 KB Output is correct
14 Correct 59 ms 7752 KB Output is correct
15 Correct 60 ms 8620 KB Output is correct
16 Correct 50 ms 6468 KB Output is correct
17 Correct 48 ms 5844 KB Output is correct
18 Correct 20 ms 3532 KB Output is correct
19 Correct 56 ms 8368 KB Output is correct
20 Correct 59 ms 8624 KB Output is correct
21 Correct 51 ms 5656 KB Output is correct
22 Runtime error 58 ms 12960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
23 Halted 0 ms 0 KB -