Illuminati

input/code.cpp: In function 'void task4()':
input/code.cpp:25:15: warning: unused variable 'm' [-Wunused-variable]
   25 |     const int m = n;
      |               ^
input/code.cpp: In function 'll swaps(std::vector<long long int>&)':
input/code.cpp:64:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(int i = 0; i < arr.size(); i++){
      |                    ~~^~~~~~~~~~~~
input/code.cpp:69:21: 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]
   69 |     for(ll i = 0; i < arr.size(); i++) {
      |                   ~~^~~~~~~~~~~~

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>
#include <climits>
#include <map>
#include <set>
#include <bitset>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;




void task4()
{

    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n;
    cin >> n;
    const int m = n;
    vector<bitset<3000>> adj(n);
    for(ll i = 0; i < n; i++){
        string s;
        cin >> s;

        for(ll j = 0; j < n; j++){
            if(s[j] == '1'){
                adj[i][j] = 1,
                adj[j][i] = 1;
            }
        }
    }

    ll res = 0;

    for (int i = 0; i < n;i++){
        for (int j = 0; j < n;j++){
            if(adj[i][j] == 1 && i != j){
                bitset<3000> andMatrix = adj[i] & adj[j];
                res += andMatrix.count();
            }
        }
    }


   cout << res / 6 << endl;

   
    
}


ll swaps(vector<ll> &arr) {
    
    vector<ll> nums(arr.begin(), arr.end());
    sort(nums.begin(), nums.end());
    
  	unordered_map<ll, ll> pos; 
    for(int i = 0; i < arr.size(); i++){
        pos[arr[i]] = i;
    }
        
  	ll numChanges = 0;
    for(ll i = 0; i < arr.size(); i++) {
        if(nums[i] != arr[i]) {
            ll ind = pos[nums[i]];
            swap(arr[i], arr[ind]);

            pos[arr[i]] = i; 
            pos[arr[ind]] = ind;
            
            numChanges++; 
        }
    }
    return numChanges; 
}


void task3(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll n;
    cin >> n;
    vector<ll> arr(n);
    for(ll i = 0; i < n; i++){
        cin >> arr[i];
    }
    
    cout << swaps(arr) << endl;

}

int main() {
    task4();

}

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: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: TIME LIMIT EXCEEDED