nktrio
unknown
plain_text
a year ago
1.1 kB
5
Indexable
#include <iostream> #include <string> #include <bitset> int n; using namespace std; int main() { std::cin >> n; int a[1005][1005]; bitset<1005> b[1005]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { std::cin >> a[i][j]; if (a[i][j] == 1) { b[i].set(j); } } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (a[i][j] == 0) { continue; } bitset<1005> tmp = b[i] ^ b[j]; tmp.set(i,0); tmp.set(j,0); if (tmp.count() == 0) { continue; } for (int k = 1; k <= n; k++) { if (b[j][k] == 1 && b[k][i] == 1) { std::cout << i << ' ' << j << ' ' << k << endl; return 0; } } } } std::cout << -1 << " " << -1 << " " << -1; return 0; }
Editor is loading...
Leave a Comment