oj.uz

Submission #899107

# Submission time Handle Problem Language Result Execution time Memory
899107 2024-01-05T13:27:32 Z duckindog Logičari (COCI21_logicari) C++14
10 / 110
 71 ms 6156 KB 
// from duckindog wth depression
#include<bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;
int n;
vector<int> ad[N];
int d[N];

int32_t main() {
  cin.tie(0)->sync_with_stdio(0);

  if (fopen("duck.inp", "r")) {
    freopen("duck.inp", "r", stdin);
    freopen("duck.out", "w", stdout);
  }
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    int u, v; cin >> u >> v;
    ad[u].push_back(v);
    ad[v].push_back(u);
  }
  int answer = 1e9;
  for (int mask = 1; mask < (1 << n); ++mask) {
    for (int i = 1; i <= n; ++i) d[i] = (mask >> i - 1 & 1);
    bool good = 1;
    for (int i = 1; i <= n; ++i) {
      int cnt = 0;
      for (int v : ad[i]) cnt += d[v];
      if (cnt != 1) good = 0;
    }
    int cnt = 0;
    for (int i = 1; i <= n; ++i) cnt += d[i];
    if (good) answer = min(answer, cnt);
  }
  cout << (answer == 1e9 ? -1 : answer) << '\n';

}

Compilation message

Main.cpp: In function 'int32_t main()':
Main.cpp:26:52: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   26 |     for (int i = 1; i <= n; ++i) d[i] = (mask >> i - 1 & 1);
      |                                                  ~~^~~
Main.cpp:15:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |     freopen("duck.inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:16:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     freopen("duck.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Incorrect 20 ms 6156 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2908 KB Output is correct
2 Correct 56 ms 3000 KB Output is correct
3 Correct 56 ms 2904 KB Output is correct
4 Correct 71 ms 3000 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 27 ms 3020 KB Output is correct
7 Correct 1 ms 2904 KB Output is correct
8 Correct 12 ms 3024 KB Output is correct
9 Correct 55 ms 2908 KB Output is correct
10 Correct 58 ms 2904 KB Output is correct
11 Correct 8 ms 2904 KB Output is correct
12 Correct 54 ms 3000 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 2908 KB Output is correct
2 Correct 56 ms 3000 KB Output is correct
3 Correct 56 ms 2904 KB Output is correct
4 Correct 71 ms 3000 KB Output is correct
5 Correct 1 ms 2904 KB Output is correct
6 Correct 27 ms 3020 KB Output is correct
7 Correct 1 ms 2904 KB Output is correct
8 Correct 12 ms 3024 KB Output is correct
9 Correct 55 ms 2908 KB Output is correct
10 Correct 58 ms 2904 KB Output is correct
11 Correct 8 ms 2904 KB Output is correct
12 Correct 54 ms 3000 KB Output is correct
13 Incorrect 1 ms 2908 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2908 KB Output is correct
3 Correct 1 ms 2908 KB Output is correct
4 Correct 1 ms 2908 KB Output is correct
5 Incorrect 20 ms 6156 KB Output isn't correct
6 Halted 0 ms 0 KB -