oj.uz

Submission #480270

# Submission time Handle Problem Language Result Execution time Memory
480270 2021-10-15T12:31:51 Z BERNARB01 Ili (COI17_ili) C++17
7 / 100
 3113 ms 1484 KB 
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  string v;
  cin >> v;
  vector<vector<int>> g(n + m);
  for (int i = 0; i < m; i++) {
    for (int itr = 0; itr < 2; itr++) {
      char c;
      int from;
      cin >> c >> from;
      --from;
      if (c == 'x') {
        from += m;
      }
      g[from].push_back(i);
    }
  }
  vector<vector<int>> sols;
  for (int i = 0; i < (1 << n); i++) {
    vector<int> que(n);
    vector<int> a(n + m, 0);
    vector<int> inDeg(n + m, 2);
    for (int j = 0; j < n; j++) {
      que[j] = j + m;
      a[j + m] = !!(i & (1 << j));
      inDeg[j + m] = 0;
    }
    for (int b = 0; b < (int) que.size(); b++) {
      int f = que[b];
      for (int u : g[f]) {
        inDeg[u] -= 1;
        a[u] |= a[f];
        if (inDeg[u] == 0) {
          que.push_back(u);
        }
      }
    }
    bool can = true;
    for (int j = 0; j < m; j++) {
      if (v[j] == '?') {
        continue;
      }
      if ((v[j] - '0') != a[j]) {
        can = false;
        break;
      }
    }
    if (can) {
      sols.emplace_back(a);
    }
  }
  vector<set<int>> se(m);
  for (const auto& a : sols) {
    for (int i = 0; i < m; i++) {
      se[i].insert(a[i]);
    }
  }
  for (int i = 0; i < m; i++) {
    if (se[i].size() == 1) {
      cout << *se[i].begin();
    } else {
      cout << '?';
    }
  }
  cout << '\n';
  return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1484 KB Output is correct
6 Correct 11 ms 592 KB Output is correct
7 Correct 26 ms 408 KB Output is correct

Subtask #2
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1484 KB Output is correct
6 Correct 11 ms 592 KB Output is correct
7 Correct 26 ms 408 KB Output is correct
8 Incorrect 3113 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 12 ms 1484 KB Output is correct
6 Correct 11 ms 592 KB Output is correct
7 Correct 26 ms 408 KB Output is correct
8 Incorrect 3113 ms 340 KB Output isn't correct
9 Halted 0 ms 0 KB -