Anime Shops

input/code.cpp: In function 'int main()':
input/code.cpp:56:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<City>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |   for (int i = 0; i < cities.size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~
input/code.cpp:60:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for (int j = 0; j < city.neighboring_cities.size(); j++) {
      |                     ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <iostream>
#include <vector>

using namespace std;

class City {
public:
  int id;
  bool has_shop;
  vector<int> neighboring_cities;
};

int main() {
  int n, m, k;
  cin >> n >> m >> k;

  vector<City> cities;

  // populate cities
  for (int i = 0; i < n; i++) {
    int id = i + 1;
    City city;
    city.id = id;
    city.has_shop = false; // default to false

    cities.push_back(city);
  }

  // mark the cities which have a shop
  for (int i = 0; i < k; i++) {
    int id;
    cin >> id;

    cities[id].has_shop = true;
  }

  // connect cities with roads
  for (int i = 0; i < m; i++) {
    int city_a, city_b;
    cin >> city_a >> city_b;

    // remember id of city is index +1 of cities
    City from_city = cities[city_a - 1];
    from_city.neighboring_cities.push_back(city_b);
    cities[city_a - 1] = from_city;

    // make road bidirectional
    City to_city = cities[city_b - 1];
    to_city.neighboring_cities.push_back(city_a);
    cities[city_b - 1] = to_city;
  }

  // print results
  for (int i = 0; i < cities.size(); i++) {
    City city = cities[i];

    int n_neighbours_with_shops = 0;
    for (int j = 0; j < city.neighboring_cities.size(); j++) {
      int neighbour_id = city.neighboring_cities[j];

      if (cities[neighbour_id].has_shop) {
        n_neighbours_with_shops++;
      }
    }

    if (n_neighbours_with_shops == 0) {
      n_neighbours_with_shops = -1;
    }

    cout << n_neighbours_with_shops << " ";
  }
  cout << endl;

  return 0;
}

Test 1

Group: 1, 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 3

Verdict: WRONG ANSWER

Test 3

Group: 1, 3

Verdict: WRONG ANSWER

Test 4

Group: 1, 3

Verdict: WRONG ANSWER

Test 5

Group: 3

Verdict: WRONG ANSWER

Test 6

Group: 3

Verdict: WRONG ANSWER

Test 7

Group: 3

Verdict: WRONG ANSWER

Test 8

Group: 3

Verdict: WRONG ANSWER

Test 9

Group: 2, 3

Verdict: WRONG ANSWER

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

Test 11

Group: 2, 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: WRONG ANSWER