Submission #295521

#	Time	Username	Problem	Language	Result	Execution time	Memory
295521		zoooma13	Werewolf (IOI18_werewolf)	C++14	0 / 100	409 ms	33620 KiB

werewolf

#include <bits/stdc++.h>
#include "werewolf.h"
using namespace std;

vector <vector <int>> adj;
vector <int> a ,pos;
int gt(int u ,int p=-1){
    a.push_back(u);
    if(adj[u].size() == 1 && ~p)
        return u;
    if(adj[u][0] != p)
        return gt(adj[u][0] ,u);
    return gt(adj[u][1] ,u);
}

int getlastzero(int l ,int r ,int q){
    for(int i=r; i>=l; i--) if(a[i] < q)
        return i;
    return -1;
}
int getfirsttwo(int l ,int r ,int q){
    for(int i=l; i<=r; i--) if(a[i] > q)
        return i;
    return -1;
}

vector<int> check_validity(int N, vector<int> X, vector<int> Y,vector<int> S, vector<int> E,vector<int> L, vector<int> R) {
    assert(X.size() == N-1);
    adj.resize(N);
    for(int i=0; i<X.size(); i++){
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }
    int lf = gt(0); a.clear(); gt(lf);

    pos.resize(N);
    for(int i=0; i<N; i++)
        pos[a[i]] = i;
    ///bld

    vector <int> ret(R.size());
    for(int q = 0; q < R.size(); q++){
        int l = pos[S[q]] ,r = pos[E[q]];
        int zero = L[q] ,two = R[q];
        if(r < l) continue;

        int last0 = getlastzero(l ,r ,zero);
        int first2 = getfirsttwo(l ,r ,two);
        if(last0 == -1 && first2 == -1)
            ret[q] = 1;
        else if(last0 == -1)
            ret[q] = first2 != l;
        else if(first2 == -1)
            ret[q] = 1;
        else
            ret[q] = (first2 >= last0+2);
    }

    reverse(a.begin() ,a.end());
    for(int i=0; i<N; i++)
        pos[a[i]] = i;
    ///bld

    for(int q = 0; q < R.size(); q++){
        int l = pos[S[q]] ,r = pos[E[q]];
        int zero = L[q] ,two = R[q];
        if(r < l) continue;

        int last0 = getlastzero(l ,r ,zero);
        int first2 = getfirsttwo(l ,r ,two);
        if(last0 == -1 && first2 == -1)
            ret[q] = 1;
        else if(last0 == -1)
            ret[q] = first2 != l;
        else if(first2 == -1)
            ret[q] = 1;
        else
            ret[q] = (first2 >= last0+2);
    }

    return ret;
}

/**

*/

Compilation message (stderr)

In file included from /usr/include/c++/9/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
                 from werewolf.cpp:1:
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:28:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |     assert(X.size() == N-1);
      |            ~~~~~~~~~^~~~~~
werewolf.cpp:30:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0; i<X.size(); i++){
      |                  ~^~~~~~~~~
werewolf.cpp:42:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int q = 0; q < R.size(); q++){
      |                    ~~^~~~~~~~~~
werewolf.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int q = 0; q < R.size(); q++){
      |                    ~~^~~~~~~~~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 8
• Subtask 3: 0 / 34
• Subtask 4: 0 / 51