oj.uz

답안 #245166

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
245166 2020-07-05T16:11:44 Z A02 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
69 / 100
 5000 ms 83220 KB 
#include "garden.h"
#include "gardenlib.h"
#include <vector>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <iostream>
#include <fstream>
#include <utility>

using namespace std;

void fill_iterated (int N, vector<vector<long long> > &iterated){

    for (int i = 1; i < iterated.size(); i++){

        for (int n = 0; n < 2 * N; n++){
            iterated[i][n] = iterated[i-1][iterated[i-1][n]];
        }

    }

}

vector<long long> iterate_function (int N, long long applications, vector<vector<long long> > &iterated){


    vector<long long> function_iterate (2 * N, 0);

    for (int i = 0; i < 2 * N; i++){
        function_iterate[i] = i;
    }

    for(int i = 0; i < 30; i++){

        if (applications & (1 << i)){

            for (int j = 0; j < 2 * N; j++){
                function_iterate[j] = iterated[i][function_iterate[j]];
            }

        }

    }

    return function_iterate;
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{

  vector<long long> vertex_image (2 * N, -1);
  //N + i is the trail going to vertex i that goes to i along the most beautiful trail

  vector<pair<long long, long long> > best_trail(N, make_pair(M + 1, -1));

    for (int i = 0; i < M; i++){
        long long s = R[i][0];
        long long e = R[i][1];
        if (best_trail[s].first > i){
            best_trail[s].first = i;
            best_trail[s].second = e;
        }
        if (best_trail[e].first > i){
            best_trail[e].first = i;
            best_trail[e].second = s;
        }
    }

    vector<pair<long, long> > second_best_trail(N, make_pair(M + 1, -1));

    for (int i = 0; i < M; i++){

        long long s = R[i][0];
        long long e = R[i][1];

        if (second_best_trail[s].first > i && i > best_trail[s].first){
            second_best_trail[s].first = i;
            second_best_trail[s].second = e;
        }

        if (second_best_trail[e].first > i && i > best_trail[e].first){
            second_best_trail[e].first = i;
            second_best_trail[e].second = s;
        }
    }

    for (int i = 0; i < N; i++){
        //cout << i << ' ' << best_trail[i].first << ' ' << best_trail[i].second << endl;
        //cout << second_best_trail[i].first << ' ' << second_best_trail[i].second << endl;

        if (second_best_trail[i].second == -1){
            second_best_trail[i] = best_trail[i];
        }
    }

    for (int i = 0; i < N; i++){
        long long new_fountain = best_trail[i].second;

        if (best_trail[i].first == best_trail[new_fountain].first){
            vertex_image[i] = new_fountain + N;
        } else {
            vertex_image[i] = new_fountain;
        }

        new_fountain = second_best_trail[i].second;

        if (second_best_trail[i].first == best_trail[new_fountain].first){
            vertex_image[i + N] = new_fountain + N;
        } else {
            vertex_image[i + N] = new_fountain;
        }
    }

    //target is p or p+N

//    for (int i = 0; i < N; i++){
//        cout << i << " : " << vertex_image[i] << ' ' << vertex_image[i + N] << endl;
//    }

    vector<vector<long long> > iterated (30, vector<long long> (2 * N, 0));

    iterated[0] = vertex_image;

    fill_iterated(N, iterated);
//
//    for (int i = 0; i < 30; i++){
//        cout << endl;
//        for (int j = 0; j < 2 * N; j++){
//            cout << iterated[i][j] << ' ';
//        }
//        cout << endl << endl;
//    }

//    vector<long long> function_iterate = iterate_function(N, 3, iterated);

//    for (int i = 0; i < 2 * N; i++){
//        cout << function_iterate[i] << ' ';
//    }

//    cout << endl;
    for(int i=0; i<Q; i++){

        vector<long long> function_iterate = iterate_function(N, G[i], iterated);
        int total = 0;
        for (int i = 0; i < N; i++){
            if (function_iterate[i] == P || function_iterate[i] == P + N){
                total++;
            }
        }


        answer(total);
    }
}

Compilation message

garden.cpp: In function 'void fill_iterated(int, std::vector<std::vector<long long int> >&)':
garden.cpp:15:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 1; i < iterated.size(); i++){
                     ~~^~~~~~~~~~~~~~~~~

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 7 ms 1024 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 7 ms 1024 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 24 ms 12800 KB Output is correct
12 Correct 45 ms 21368 KB Output is correct
13 Correct 77 ms 47352 KB Output is correct
14 Correct 132 ms 75212 KB Output is correct
15 Correct 119 ms 76024 KB Output is correct
16 Correct 94 ms 51704 KB Output is correct
17 Correct 88 ms 43700 KB Output is correct
18 Correct 42 ms 21384 KB Output is correct
19 Correct 119 ms 75128 KB Output is correct
20 Correct 120 ms 76024 KB Output is correct
21 Correct 96 ms 51788 KB Output is correct
22 Correct 89 ms 43696 KB Output is correct
23 Correct 136 ms 83220 KB Output is correct

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 6 ms 896 KB Output is correct
3 Correct 5 ms 896 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 896 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 896 KB Output is correct
9 Correct 7 ms 1024 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 24 ms 12800 KB Output is correct
12 Correct 45 ms 21368 KB Output is correct
13 Correct 77 ms 47352 KB Output is correct
14 Correct 132 ms 75212 KB Output is correct
15 Correct 119 ms 76024 KB Output is correct
16 Correct 94 ms 51704 KB Output is correct
17 Correct 88 ms 43700 KB Output is correct
18 Correct 42 ms 21384 KB Output is correct
19 Correct 119 ms 75128 KB Output is correct
20 Correct 120 ms 76024 KB Output is correct
21 Correct 96 ms 51788 KB Output is correct
22 Correct 89 ms 43696 KB Output is correct
23 Correct 136 ms 83220 KB Output is correct
24 Correct 8 ms 384 KB Output is correct
25 Correct 860 ms 12852 KB Output is correct
26 Correct 1535 ms 21456 KB Output is correct
27 Execution timed out 5062 ms 47456 KB Time limit exceeded
28 Halted 0 ms 0 KB -