Anime Shops

input/code.cpp: In function 'int main()':
input/code.cpp:16:36: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 | #define rep(a,b,c) for(ll a = b; a < c; a++)
      |                                    ^
input/code.cpp:82:13: note: in expansion of macro 'rep'
   82 |             rep(i,0,edges[node].size()) {
      |             ^~~

#include <iostream>
#include <vector>
#include <set>
#include <map>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef set<ll> sll;
typedef set<pll> spll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;

#define rep(a,b,c) for(ll a = b; a < c; a++)
#define rrep(a,b,c) for(ll a = c-1; a >=  b; a--)
#define itr_rep(a,b,_type) for(_type::iterator a = b.begin(); a != b.end(); a++)
#define pb push_back
#define mp make_pair
#define sz size
#define all(a) a.begin(),a.end()

ll n;
ll m;
ll k;

vpll closest;
vpll vis;

vvll edges;
vll shops;

spll curr;
spll proc;

int main() {
    cin >> n;
    cin >> m;
    cin >> k;
    shops.resize(k,0);
    rep(i,0,k) {cin >> shops[i];}
    rep(i,0,k) {shops[i]--;} // 1-indexing
    edges.resize(n,vll());
    rep(i,0,m) {
        ll a;
        ll b;
        cin >> a;
        cin >> b;
        a--;
        b--;
        edges[a].pb(b);
        edges[b].pb(a); 
    }

    ll dist = 0;

    closest.resize(n,mp(-1,-1));
    vis.resize(n,mp(-1,-1));

    curr.clear();
    proc.clear();
    rep(i,0,k) {proc.insert(mp(shops[i], shops[i]));}

    while (proc.size() > 0) {
        swap(proc,curr);
        proc.clear();

        itr_rep(item, curr, spll) {
            ll node = (*item).first;
            ll id = (*item).second;
            if ((id == vis[node].first) || (id == vis[node].second)) {continue;}
            // probably shouldn't happen here I think. Probably happends when we do stuff or smth
            if (closest[node].first == -1) {
                closest[node].first = dist;
                vis[node].first = id;
            } else if (closest[node].second == -1) {
                closest[node].second = dist;
                vis[node].second = id;
            } else {continue;} // Not inserted or smth
            // Propagate
            rep(i,0,edges[node].size()) {
                if (closest[edges[node][i]].second != -1) {continue;}
                if (id == vis[edges[node][i]].first) {continue;}
                if (id == vis[edges[node][i]].second) {continue;}
                proc.insert(mp(edges[node][i],id));
            }
        }
        dist++;
    }

    vll ans;
    ans.resize(n,0);
    rep(i,0,n) {ans[i] = closest[i].first;}
    rep(i,0,k) {ans[shops[i]] = closest[shops[i]].second;}
    rep(i,0,n) {cout << ans[i] << " ";}
    cout << endl;
    return 0;
}

Test 1

Group: 1, 3

Verdict: ACCEPTED

Test 2

Group: 1, 3

Verdict: ACCEPTED

Test 3

Group: 1, 3

Verdict: ACCEPTED

Test 4

Group: 1, 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 2, 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED