제출 #398709

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398709		Pichon5	열대 식물원 (Tropical Garden) (IOI11_garden)	C++17	0 / 100	1 ms	332 KiB

garden

#include<bits/stdc++.h>
#include <iostream>
#include "garden.h"
#include "gardenlib.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;
void count_routes(int N, int M, int P, int R[][2], int Q, int g[])
{
    vi G[N+1];
    for(int i=0;i<M;i++){
        int a=R[i][0],b=R[i][1];
        if(G[a].size()<2){
            G[a].pb(b);
        }
        if(G[b].size()<2){
            G[b].pb(a);
        }
    }
    int k=g[0];
    int res=0;
    for(int i=1;i<2;i++){
        int curr=i;
        int p=-1;
        for(int l=0;l<k;l++){
            //cout<<"nodo  "<<curr<<"  "<<p<<endl;
            if(G[curr].size()==2){
                if(G[curr][0]!=p){
                    p=curr;
                    curr=G[curr][0];
                }else{
                    p=curr;
                    curr=G[curr][1];
                }
                continue;
            }
            if(G[curr].size()==1){
                p=curr;
                curr=G[curr][0];
            }
        }
        //cout<<"final   "<<curr<<"  "<<p<<endl;
        //cout<<i<<"   "<<curr<<endl;
        if(curr==P)res++;
    }
    answer(res);

}
/*
5 5 2
1 0
1 2
3 2
1 3
4 2
1
3 1
*/

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