Submission #599921

#	Time	Username	Problem	Language	Result	Execution time	Memory
599921		Hanksburger	늑대인간 (IOI18_werewolf)	C++17	15 / 100	4094 ms	32728 KiB

werewolf

#include "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[400005], ans;
bool ok[400005];
queue<int> q;
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]);
        adj[n+x[i]].push_back(n+y[i]);
        adj[n+y[i]].push_back(n+x[i]);
    }
    for (int i=0; i<n; i++)
        adj[i].push_back(n+i);
    for (int i=0; i<s.size(); i++)
    {
        for (int j=0; j<n*2; j++)
            ok[j]=0;
        ok[s[i]]=1;
        q.push(s[i]);
        while (!q.empty())
        {
            int u=q.front();
            q.pop();
            for (int v:adj[u])
            {
                if (!ok[v] && (v<n && v>=l[i] || v>=n && v<=n+r[i]))
                {
                    ok[v]=1;
                    q.push(v);
                }
            }
        }
        ans.push_back(ok[n+e[i]]);
    }
    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:18:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |     for (int i=0; i<s.size(); i++)
      |                   ~^~~~~~~~~
werewolf.cpp:30:36: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   30 |                 if (!ok[v] && (v<n && v>=l[i] || v>=n && v<=n+r[i]))

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