CSES - Aalto Competitive Programming 2024 - wk8 - Mon - Results
Submission details
Task:Illuminati
Sender:Rasse
Submission time:2024-10-28 17:27:20 +0200
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.00 sdetails
#14ACCEPTED0.00 sdetails
#15ACCEPTED0.00 sdetails
#16ACCEPTED0.00 sdetails
#17ACCEPTED0.00 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.00 sdetails
#20ACCEPTED0.00 sdetails
#21ACCEPTED0.00 sdetails
#22ACCEPTED0.00 sdetails
#23ACCEPTED0.00 sdetails
#24ACCEPTED0.00 sdetails
#25ACCEPTED0.00 sdetails
#26ACCEPTED0.00 sdetails
#27ACCEPTED0.00 sdetails
#280.00 sdetails
#290.00 sdetails
#30ACCEPTED0.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#35ACCEPTED0.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.01 sdetails
#390.01 sdetails
#400.01 sdetails
#410.01 sdetails
#420.01 sdetails
#430.01 sdetails
#440.01 sdetails
#450.01 sdetails
#460.01 sdetails
#470.01 sdetails
#480.14 sdetails
#490.14 sdetails
#500.53 sdetails
#510.53 sdetails
#521.14 sdetails
#53--details

Compiler report

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...

Code

#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_set<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;
        
        if (visited[adj[node][i].first])
        {
            int nDepth = depths[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 << "Found2" << endl;
                COUNT++;
                //adj[adj[node][i].first][adj[node][i].second] = {-1, -1};
            }
            neededDepths.insert(nDepth+1);
            neededDepths.insert(nDepth-1);
        }
        else
        {
            dfs(visited, adj, adj[node][i].first, node, depth+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 details

Test 1

Verdict: ACCEPTED

input
1
0

correct output
0

user output
0

Test 2

Verdict: ACCEPTED

input
2
01
10

correct output
0

user output
0

Test 3

Verdict: ACCEPTED

input
2
01
10

correct output
0

user output
0

Test 4

Verdict: ACCEPTED

input
3
011
101
110

correct output
1

user output
1

Test 5

Verdict: ACCEPTED

input
3
010
101
010

correct output
0

user output
0

Test 6

Verdict: ACCEPTED

input
3
000
001
010

correct output
0

user output
0

Test 7

Verdict: ACCEPTED

input
3
011
100
100

correct output
0

user output
0

Test 8

Verdict: ACCEPTED

input
4
0111
1011
1101
1110

correct output
4

user output
4

Test 9

Verdict: ACCEPTED

input
4
0011
0010
1100
1000

correct output
0

user output
0

Test 10

Verdict: ACCEPTED

input
4
0000
0011
0101
0110

correct output
1

user output
1

Test 11

Verdict: ACCEPTED

input
4
0101
1010
0100
1000

correct output
0

user output
0

Test 12

Verdict: ACCEPTED

input
4
0111
1001
1001
1110

correct output
2

user output
2

Test 13

Verdict: ACCEPTED

input
4
0001
0010
0100
1000

correct output
0

user output
0

Test 14

Verdict: ACCEPTED

input
4
0110
1001
1000
0100

correct output
0

user output
0

Test 15

Verdict: ACCEPTED

input
4
0001
0000
0001
1010

correct output
0

user output
0

Test 16

Verdict: ACCEPTED

input
4
0101
1001
0000
1100

correct output
1

user output
1

Test 17

Verdict: ACCEPTED

input
4
0001
0000
0000
1000

correct output
0

user output
0

Test 18

Verdict: ACCEPTED

input
5
01111
10111
11010
11101
...

correct output
7

user output
7

Test 19

Verdict: ACCEPTED

input
5
00111
00000
10010
10100
...

correct output
1

user output
1

Test 20

Verdict: ACCEPTED

input
5
00001
00110
01000
01000
...

correct output
0

user output
0

Test 21

Verdict: ACCEPTED

input
5
01011
10001
00011
10100
...

correct output
1

user output
1

Test 22

Verdict: ACCEPTED

input
5
01110
10111
11011
11101
...

correct output
7

user output
7

Test 23

Verdict: ACCEPTED

input
5
00011
00001
00010
10100
...

correct output
0

user output
0

Test 24

Verdict: ACCEPTED

input
5
01100
10100
11000
00001
...

correct output
1

user output
1

Test 25

Verdict: ACCEPTED

input
5
00010
00011
00001
11000
...

correct output
0

user output
0

Test 26

Verdict: ACCEPTED

input
5
01010
10101
01010
10100
...

correct output
0

user output
0

Test 27

Verdict: ACCEPTED

input
5
00010
00000
00000
10000
...

correct output
0

user output
0

Test 28

Verdict:

input
10
0111111110
1011000101
1100001110
1100101100
...

correct output
26

user output
15

Test 29

Verdict:

input
10
0011100010
0000000010
1001110011
1010001001
...

correct output
11

user output
9

Test 30

Verdict: ACCEPTED

input
10
0000111000
0000001100
0000011111
0000001101
...

correct output
7

user output
7

Test 31

Verdict:

input
10
0101100111
1001000000
0000010000
1100100010
...

correct output
9

user output
6

Test 32

Verdict:

input
10
0111011111
1010010010
1101011001
1010101100
...

correct output
22

user output
15

Test 33

Verdict:

input
10
0001100110
0001010100
0001010111
1110000110
...

correct output
11

user output
10

Test 34

Verdict:

input
10
0110010000
1011011010
1100110110
0100101011
...

correct output
22

user output
16

Test 35

Verdict: ACCEPTED

input
10
0001001101
0001010000
0000011110
1100000101
...

correct output
13

user output
13

Test 36

Verdict:

input
10
0101010110
1000101001
0001011011
1010101110
...

correct output
8

user output
9

Test 37

Verdict:

input
10
0001000000
0000100000
0000000010
1000110111
...

correct output
19

user output
13

Test 38

Verdict:

input
100
011111111011000101000111010110...

correct output
20807

user output
2061

Test 39

Verdict:

input
100
001110001000000010111001100100...

correct output
21100

user output
2041

Test 40

Verdict:

input
100
000011100000001100001111100110...

correct output
18556

user output
1944

Test 41

Verdict:

input
100
010110011101000000001000010001...

correct output
20091

user output
2059

Test 42

Verdict:

input
100
011101111110010010101100110110...

correct output
21281

user output
2109

Test 43

Verdict:

input
100
000110011001010100101011100011...

correct output
20746

user output
2067

Test 44

Verdict:

input
100
011001000011011010011011010101...

correct output
21793

user output
2082

Test 45

Verdict:

input
100
000100110101010000001111000010...

correct output
19781

user output
2011

Test 46

Verdict:

input
100
010101011000101001101101110111...

correct output
20006

user output
1987

Test 47

Verdict:

input
100
000100000000100000000001011011...

correct output
19161

user output
2039

Test 48

Verdict:

input
1000
011111111011000101000111010110...

correct output
20823418

user output
212389

Test 49

Verdict:

input
1000
001110001000000010111001100100...

correct output
20848491

user output
215053

Test 50

Verdict:

input
2000
010001011010001100000111100111...

correct output
166808034

user output
856480

Test 51

Verdict:

input
2000
000010011000001011011110111110...

correct output
165842024

user output
857549

Test 52

Verdict:

input
2999
000110011001010001100011110110...

correct output
561389670

user output
1926074

Test 53

Verdict:

input
3000
011111111111111111111111111111...

correct output
4495501000

user output
(empty)