제출 #1041952

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1041952		vjudge1	Tropical Garden (IOI11_garden)	C++17	49 / 100	5094 ms	16456 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>

using namespace std;

struct Edge {
  int u, v;

  Edge() {}
  Edge(int u_, int v_) : u(u_), v(v_) {}
};

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
  vector<vector<int>> adj(N);
  for (int i = 0; i < M; ++i) {
    adj[R[i][0]].push_back(R[i][1]);
    adj[R[i][1]].push_back(R[i][0]);
  }

  set<pair<int,int>> nodes;

  for (int i = 0; i < N; ++i) {
    nodes.insert({-1, i});
    for (int v : adj[i]) nodes.insert({i, v});
  }

  map<pair<int,int>,int> idx;
  map<int,pair<int,int>> inv;
  int idx_ = 0;
  for (auto node : nodes) {
    idx[node] = idx_;
    inv[idx_] = node;
    ++idx_;
  }

  int siz = nodes.size();
  vector<int> succ(siz, -1);
  for (int i = 0; i < N; ++i) {
    succ[idx[{-1, i}]] = idx[{i, adj[i][0]}];
    for (int v : adj[i]) {
      if (v != adj[i][0])
        succ[idx[{v, i}]] = idx[{i, adj[i][0]}];
      else
        succ[idx[{v, i}]] = idx[{i, adj[i][1]}];
    }
  }

  for(int it = 0; it < Q; ++it) {
    int K = G[it];
    int cnt = 0;

    for (int i = 0; i < N; ++i) {
      int u = idx[{-1, i}];
      for (int it2 = 0; it2 < K; ++it2) u = succ[u];
      auto node = inv[u];
      if (node.second == P) ++cnt;
    }

    answer(cnt);
  }
}

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