fork download
copy 
  1. // ~~ icebear ~~
  2. #include <bits/stdc++.h>
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6. typedef pair<int, int> ii;
  7. typedef pair<int, ii> iii;
  8.  
  9. template<class T>
  10.     bool minimize(T &a, const T &b) {
  11.         if (a > b) return a = b, true;
  12.         return false;
  13.     }
  14.  
  15. template<class T>
  16.     bool maximize(T &a, const T &b) {
  17.         if (a < b) return a = b, true;
  18.         return false;
  19.     }
  20.  
  21. #define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
  22. #define FORR(i,a,b) for(int i=(a); i>=(b); --i)
  23. #define REP(i, n) for(int i=0; i<(n); ++i)
  24. #define RED(i, n) for(int i=(n)-1; i>=0; --i)
  25. #define MASK(i) (1LL << (i))
  26. #define BIT(S, i) (((S) >> (i)) & 1)
  27. #define mp make_pair
  28. #define pb push_back
  29. #define fi first
  30. #define se second
  31. #define all(x) x.begin(), x.end()
  32. #define task "triple"
  33.  
  34. const int MOD = 1e9 + 7;
  35. const int inf = 1e9 + 27092008;
  36. const ll INF = 1e18 + 27092008;
  37. const int N = 300 + 5;
  38. int numNode, numEdge;
  39. bool haveEdge[N][N], have[N];
  40.  
  41. void init(void) {
  42.     cin >> numNode >> numEdge;
  43.     FOR(i, 1, numNode) FOR(j, 1, numNode) haveEdge[i][j] = false;
  44.     FOR(i, 1, numNode) have[i] = false;
  45.     while(numEdge--) {
  46.         int u, v;
  47.         cin >> u >> v;
  48.         haveEdge[u][v] = haveEdge[v][u] = true;
  49.     }
  50. }
  51.  
  52. void process(void) {
  53.     bool ok = false;
  54.     FOR(i, 1, numNode) FOR(j, 1, numNode) FOR(k, 1, numNode) if (i != j && i != k && j != k) {
  55.         have[i] |= (!haveEdge[i][j] && !haveEdge[i][k] && !haveEdge[j][k]);
  56.         ok |= have[i];
  57.     }
  58.  
  59.     int ans = inf;
  60.     FOR(i, 1, numNode) FOR(j, 1, numNode) FOR(k, 1, numNode) if (haveEdge[i][j] && haveEdge[i][k] && haveEdge[j][k]) {
  61.         if (have[i]) ans = 5;
  62.         if (ok) minimize(ans, 6);
  63.     }
  64.     cout << (ans == inf ? -1 : ans) << '\n';
  65. }
  66.  
  67. int main() {
  68.     ios_base::sync_with_stdio(0);
  69.     cin.tie(0); cout.tie(0);
  70.     if (fopen(task".inp", "r")) {
  71.         freopen(task".inp", "r", stdin);
  72.         freopen(task".out", "w", stdout);
  73.     }
  74.     int tc = 1;
  75.     cin >> tc;
  76.     while(tc--) {
  77.         init();
  78.         process();
  79.     }
  80.     return 0;
  81. }
  82.  
Success #stdin #stdout 0.01s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-1
https://ideone.com/zPSqSb
language:
C++14 (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!