Anime Shops

input/code.cpp: In function 'int main()':
input/code.cpp:19: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]
   19 | #define rep(a,b,c) for(ll a = b; a < c; a++)
      |                                    ^
input/code.cpp:98:17: note: in expansion of macro 'rep'
   98 |                 rep(j,0,edges[tmp].size()) {
      |                 ^~~

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

using namespace std;

const bool d = false;

typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;
typedef set<ll> sll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef map<ll,sll> mllsll;
typedef vector<mllsll> vm;

#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;
vll shops;

vvll edges;

vpll closest;

vm curr;
vm proc;

sll curr_marked;
sll proc_marked;

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); 
    }

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

    proc.resize(n,mllsll());
    curr.resize(n,mllsll());
    proc_marked.clear();
    curr_marked.clear();

    rep(i,0,k) {
        proc[shops[i]][i] = sll();
        proc_marked.insert(shops[i]);
    }

    if (d) {cout << "here" << endl;}

    ll dist = 0;

    while (proc_marked.size() > 0) {
        if (d) {cout << "new itr" << endl;}
        swap(curr,proc);
        swap(curr_marked,proc_marked);
        itr_rep(e,proc_marked,sll) {proc[*e].clear();}
        proc_marked.clear();
        if (d) {cout << "cleared" << endl;}

        itr_rep(elem,curr_marked,sll) {
            if (d) {cout << "new elem" << endl;}
            ll tmp = (*elem);
            itr_rep(e, curr[tmp], mllsll) { // *e: <ll, set<ll> > - <id, <previous> >
                if (closest[tmp].first == -1) {
                    closest[tmp].first = dist;
                    if (d) {cout << tmp << ": " << (*e).first << " " << dist << endl;}
                } else if (closest[tmp].second == -1) {
                    closest[tmp].second = dist;
                    if (d) {cout << tmp << ": " << (*e).first << " " << dist << endl;}
                } else {break;}
                if (d) {cout << "didnt break" << endl;}
                // propagate
                rep(j,0,edges[tmp].size()) {
                    if (closest[edges[tmp][j]].second != -1) {continue;}
                    if ((*e).second.count(edges[tmp][j]) == 0) { // Node not visited before
                        if (curr[edges[tmp][j]].count((*e).first) == 0) { // Id not in the node in this step
                            if (d) {cout << "inside: " << edges[tmp][j] << endl;}
                            // goto node
                            pair<mllsll::iterator, bool> temp = proc[edges[tmp][j]].insert(mp((*e).first,sll()));
                            (*(temp.first)).second.insert(tmp); // add tmp as a previous node
                            proc_marked.insert(edges[tmp][j]); // add new node to will visit queue
                        }
                    }
                    if (d) {cout << "end" << endl;}
                }
                if (d) {cout << "end2" << endl;}
            }
        }

        if (d) {
            cout << dist << ": ";
            rep(i,0,n) {cout << closest[i].first << " ";}
            cout << endl;
            rep(i,0,n) {cout << closest[i].second << " ";}
            cout << endl;
        }
        dist++;
    }

    if (d) {cout << "done" << endl;}

    vll ans;
    ans.resize(n,0);
    rep(i,0,n) {ans[i] = closest[i].first;}
    if (d) {
        rep(i,0,n) {cout << ans[i] << " ";}
        cout << endl;
    }
    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: TIME LIMIT EXCEEDED

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