Submission #730793

#	Time	Username	Problem	Language	Result	Execution time	Memory
730793		PoonYaPat	Werewolf (IOI18_werewolf)	C++14	15 / 100	286 ms	19668 KiB

werewolf

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

vector<int> adj[3001];
bool vis1[3001],vis2[3001];

vector<int> check_validity(int n, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
    for (int i=0; i<X.size(); ++i) {
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }
    vector<int> Ans;
    for (int i=0; i<S.size(); ++i) {
        queue<int> q;
        memset(vis1,0,sizeof(vis1));
        memset(vis2,0,sizeof(vis2));

        if (S[i]>=L[i]) q.push(S[i]);
        while (!q.empty()) {
            int node=q.front();
            q.pop();

            if (vis1[node]) continue;
            vis1[node]=true;

            for (auto s : adj[node]) {
                if (s>=L[i]) q.push(s);
            }
        }

        if (E[i]<=R[i]) q.push(E[i]);
        while (!q.empty()) {
            int node=q.front();
            q.pop();

            if (vis2[node]) continue;
            vis2[node]=true;

            for (auto s : adj[node]) {
                if (s<=R[i]) q.push(s);
            }
        }

        int ans=0;
        for (int i=0; i<n; ++i) if (vis1[i]==true && vis2[i]==true) ans=1;
        Ans.push_back(ans);
    }
    return Ans;
}

Compilation message (stderr)

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:9:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for (int i=0; i<X.size(); ++i) {
      |                   ~^~~~~~~~~
werewolf.cpp:14:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |     for (int i=0; i<S.size(); ++i) {
      |                   ~^~~~~~~~~

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