제출 #381184

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381184		Pichon5	늑대인간 (IOI18_werewolf)	C++17	7 / 100	4059 ms	29292 KiB

werewolf

#include "werewolf.h"
#include<bits/stdc++.h>
#define lcm(a,b) (a/__gcd(a,b))*b
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll long long int
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define F first
#define S second
#define mp make_pair
using namespace std;
vector<vi>G;
vector<pair<int,int> >color;//1 es que se vuelve wolf
vector<bool>vis;
void dfs1(int nodo, int L){
    vis[nodo]=true;
    for(auto it : G[nodo]){
        if(vis[it]==false && it>=L){
            dfs1(it,L);
        }
    }
}
void dfs2(int nodo,int R){
    vis[nodo]=true;
    for(auto it : G[nodo]){
        if(vis[it]==false && it<=R){
            dfs2(it,R);
        }
    }
}
vi check_validity(int N,vi X,vi Y,vi S,vi E,vi L,vi R) {
    //N number of cities
    //X ^ Y roads
    //S ^ E start and end
    //avoid 0,1...L-1  in human form
    //avoid R+1,R+2...N-1 in wolf form
    int Q = S.size();
    vi res;
    int n=N;
    G.assign(n+1,vi());
    for(int i=0;i<X.size();i++){
        G[X[i]].pb(Y[i]);
        G[Y[i]].pb(X[i]);
    }
    for(int i=0;i<Q;i++){
        int a=S[i],b=E[i];
        int ok=0;
        for(int l=L[i];l<=R[i];l++){
            vis.assign(n+1,false);
            dfs1(l,L[i]);
            if(!vis[a])continue;
            vis.assign(n+1,false);
            dfs2(l,R[i]);
            if(vis[b]){
                ok=1;
                break;
            }
        }
        res.pb(ok);
    }
    return res;
}
/*
6 6 3
5 1
1 2
1 3
3 4
3 0
5 2
4 2 1 2
4 2 2 2
5 4 3 4
*/

컴파일 시 표준 에러 (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:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i=0;i<X.size();i++){
      |                 ~^~~~~~~~~

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