oj.uz

Submission #434186

# Submission time Handle Problem Language Result Execution time Memory
434186 2021-06-20T17:14:18 Z Tiago_Marques Werewolf (IOI18_werewolf) C++17
0 / 100
 4000 ms 27116 KB 
#include "werewolf.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;

#define REP(i, a, b) for (ll i=a; i<b; i++)
#define pb push_back

int ordem[200000];
vector<int> graph[200000];
int seg_tree_maximo[800000];
int seg_tree_minimo[800000];
int posicao[200000];

void create (int i, int minimo, int maximo)
{
    if (minimo == maximo)
    {
        seg_tree_maximo[i] = ordem[minimo];
        seg_tree_minimo[i] = ordem[minimo];
        return;
    }
    int med = (minimo + maximo)/2;
    create (2*i+1, minimo, med);
    create (2*i+2, med+1, maximo);
    seg_tree_maximo[i] = max (seg_tree_maximo[2*i+1], seg_tree_maximo[2*i+2]);
    seg_tree_minimo[i] = min (seg_tree_minimo[2*i+1], seg_tree_minimo[2*i+2]);
    return;
}

int minimizar (int i, int minimo, int maximo, int menor, int maior)
{
    if (minimo == menor && maximo == maior)
        return seg_tree_minimo[i];
    int med = (minimo + maximo)/2;
    if (maior <= med)
        return minimizar(2*i+1, minimo, med, menor, maior);
    if (menor > med)
        return minimizar(2*i+2, med+1, maximo, menor, maior);
    return min (minimizar(2*i+1, minimo, med, menor, med), minimizar(2*i+2, med+1, maximo, med+1, maximo));
}

int maximizar (int i, int minimo, int maximo, int menor, int maior)
{
    if (minimo == menor && maximo == maior)
        return seg_tree_maximo[i];
    int med = (minimo + maximo)/2;
    if (maior <= med)
        return maximizar(2*i+1, minimo, med, menor, maior);
    if (menor > med)
        return maximizar(2*i+2, med+1, maximo, menor, maior);
    return min (maximizar(2*i+1, minimo, med, menor, med), maximizar(2*i+2, med+1, maximo, med+1, maximo));
}

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R)
{
    int Q = S.size();
    vector<int> ans(Q);
    REP(i, 0, X.size())
    {
        graph[X[i]].pb (Y[i]);
        graph[Y[i]].pb (X[i]);
    }
    REP(i, 0, N)
    {
        if (graph[i].size() == 1)
        {
            ordem[0] = i;
            posicao[i] = 0;
            break;
        }
    }
    ordem[1] = graph[ordem[0]][0];
    posicao[ordem[1]] = 1;
    REP(i, 2, N)
    {
        if (graph[ordem[i-1]][0] == ordem[i-2])
            ordem[i] = graph[ordem[i-1]][1];
        else
            ordem[i] = graph[ordem[i-1]][0];
        posicao[ordem[i]] = i;
    }
    create(0, 0, N-1);
    REP(i, 0, Q)
    {
        int inicio = posicao[S[i]];
        int fim = posicao[E[i]];
        if (S[i] < L[i] || E[i] > R[i])
        {
            ans[i] = 0;
            continue;
        }
        if (inicio < fim)
        {
            int melhor1, melhor2, minimo = inicio, maximo = fim;
            while (minimo != maximo)
            {
                int med = (minimo + maximo + 1)/2;
                if (minimizar(0, 0, N-1, inicio, med) < L[i])
                    maximo = med - 1;
                else
                    minimo = med;
            }
            melhor1 = minimo;
            minimo = inicio, maximo = fim;
            while (minimo != maximo)
            {
                int med = (minimo + maximo)/2;
                if (maximizar(0, 0, N-1, med, fim) > R[i])
                    minimo = med + 1;
                else
                    maximo = med;
            }
            melhor2 = minimo;
            if (melhor1 < melhor2)
                ans[i] = 0;
            else
                ans[i] = 1;
        }
        else
        {
            int melhor1, melhor2, minimo = fim, maximo = inicio;
            while (minimo != maximo)
            {
                int med = (minimo + maximo + 1)/2;
                if (minimizar(0, 0, N-1, med, inicio) < L[i])
                    minimo = med + 1;
                else
                    maximo = med;
            }
            melhor1 = minimo;
            minimo = fim, maximo = inicio;
            while (minimo != maximo)
            {
                int med = (minimo + maximo + 1)/2;
                if (maximizar(0, 0, N-1, fim, med) > R[i])
                    maximo = med - 1;
                else
                    minimo = med;
            }
            melhor2 = minimo;
            if (melhor2 < melhor1)
                ans[i] = 0;
            else
                ans[i] = 1;
        }
    }
    return ans;
}

Compilation message

werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:8:36: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define REP(i, a, b) for (ll i=a; i<b; i++)
......
   61 |     REP(i, 0, X.size())
      |         ~~~~~~~~~~~~~~              
werewolf.cpp:61:5: note: in expansion of macro 'REP'
   61 |     REP(i, 0, X.size())
      |     ^~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4053 ms 4940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4053 ms 4940 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4085 ms 27116 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4053 ms 4940 KB Time limit exceeded
2 Halted 0 ms 0 KB -