Illuminati

input/code.cpp: In function 'void dfs(std::vector<bool>&, std::vector<std::vector<std::pair<long long int, long long int> > >&, long long int, long long int, long long int)':
input/code.cpp:29:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for (int i = 0; i < adj[node].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'void solve()':
input/code.cpp:71:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   71 |         for (int j = i+1; j < s.size(); j++)
      |                           ~~^~~~~~~~~~
input/code.cpp:93:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<bool>::size_type' {aka 'long unsign...

#include <iostream>
#include <vector>
#include <array>
#include <string>
#include <algorithm>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <climits>
#include <cmath>
#include <functional>
#include <type_traits>
#include <bitset>
 
#define int long long
using namespace std;

int COUNT = 0;

vector<int> depths;

void dfs(vector<bool>& visited, vector<vector<pair<int, int>>>& adj, int node, int parent, int depth)
{
    //cout << "-- Node: " << node << endl;
    visited[node] = true;
    depths[node] = depth;
    unordered_map<int, int> neededDepths;
    for (int i = 0; i < adj[node].size(); i++)
    {
        if (adj[node][i].first == -1)
            continue;
        
        //cout << "Line " << adj[node][i].first << " " << adj[node][i].second << endl;
        
        int nDepth = depths[adj[node][i].first];
        if (visited[adj[node][i].first])
        {
            //if (depth == nDepth + 2)
            //{
            //    cout << "Found" << endl;
            //    COUNT++;
            //    adj[adj[node][i].first][adj[node][i].second] = {-1, -1};
            //}
            if (neededDepths.find(nDepth) != neededDepths.end())
            {
                //cout << "Found "  << neededDepths[nDepth] << endl;
                //adj[adj[node][i].first][adj[node][i].second] = {-1, -1};
                COUNT += neededDepths[nDepth];
            }
        }
        else
        {
            dfs(visited, adj, adj[node][i].first, node, depth+1);
        }
        neededDepths[nDepth+1]++;
        neededDepths[nDepth-1]++;
    }
}

void solve() {
    int n;
    cin >> n;

    vector<vector<pair<int, int>>> adj(n, vector<pair<int, int>>());

    for (int i = 0; i < n; i++)
    {
        string s;
        cin >> s;
        for (int j = i+1; j < s.size(); j++)
            if (s[j] == '1')
            {
                adj[i].push_back({j, adj[j].size()});
                adj[j].push_back({i, adj[i].size()-1});
            }
    }


/*
    unordered_set<int> neighbors(n);
    for (int i = 0; i < n; i++)
    {
        neighbors.clear();
        for (int j = 0; j < adj[i].size(); j++)
            neighbors.insert(adj[i][j]);
        
    }
*/
    
    vector<bool> vis(n);
    depths.resize(n, 0);
    for (int i = 0; i < vis.size(); i++)
    {
        if (!vis[i])
            dfs(vis, adj, i, -1, 0);
    }

    cout << COUNT;

}
 
 
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
 
    int t = 1;
 
    //cin >> t;
 
    for (int i = 0; i < t; i++)
        solve();
 
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: WRONG ANSWER

Test 35

Verdict: ACCEPTED

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: WRONG ANSWER

Test 45

Verdict: WRONG ANSWER

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: WRONG ANSWER

Test 48

Verdict: WRONG ANSWER

Test 49

Verdict: WRONG ANSWER

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: TIME LIMIT EXCEEDED