Submission #823079

#	Time	Username	Problem	Language	Result	Execution time	Memory
823079		nemethm	열대 식물원 (Tropical Garden) (IOI11_garden)	C++17	49 / 100	5061 ms	4944 KiB

garden

#include "garden.h"
#include "gardenlib.h"

#include <bits/stdc++.h>

using namespace std;

vector<pair<int,int>> g[150100];
int p;

int simulate(int node, int k){
  int prev = -1;
  while(k--){
    int nxt = g[node][0].first;
    if(nxt == prev && g[node].size() > 1){
      nxt = g[node][1].first;
    }
    prev = node;
    node = nxt;
  }
  return p == node;
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
  p = P;
  for(int i = 0; i < M; ++i){
    g[R[i][0]].push_back({R[i][1], i});   //nem kéne minden él
    g[R[i][1]].push_back({R[i][0], i});
  }
  int ans = 0;
  for(int i = 0; i < N; ++i){
    ans += simulate(i, G[0]);
  }
  answer(ans);
}

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