제출 #592664

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
592664		Khizri	Tropical Garden (IOI11_garden)	C++17	0 / 100	4 ms	4948 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
const int mxn=2e5+5;
int n,m,k,x,ans;
vector<int>vt[mxn];
void dfs(int u,int cnt,int par,vector<int>&v,vector<int>&p){
    if(p[u]==-1){
        p[u]=par;
    }
    if(cnt==k&&u==x){
        ans++;
        return;
    }
    else if(cnt==k){
        return;
    }
    if(v[u]+1>vt[u].size()){
        dfs(p[u],cnt+1,u,v,p);
        return;
    }
    v[u]++;
    dfs(vt[u][v[u]-1],cnt+1,u,v,p);
    return;
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    n=N,m=M,k=G[0],x=P;
    for(int i=0;i<m;i++){
        vt[R[i][0]].pb(R[i][1]);
        vt[R[i][1]].pb(R[i][0]);
    }
    for(int i=1;i<=n;i++){
        vector<int>v(n+5);
        vector<int>p(n+5,-1);
        dfs(i-1,0,i,v,p);
    }
    answer(ans);
}
/*
6 6 0
1 2
0 1
0 3
3 4
4 5
1 5
1 3
2
*/

컴파일 시 표준 에러 (stderr) 메시지

garden.cpp: In function 'void dfs(int, int, int, std::vector<int>&, std::vector<int>&)':
garden.cpp:32:14: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     if(v[u]+1>vt[u].size()){

• Subtask 1: 0 / 49
• Subtask 2: 0 / 20
• Subtask 3: 0 / 31