oj.uz

Submission #204974

# Submission time Handle Problem Language Result Execution time Memory
204974 2020-02-27T15:25:39 Z Haunted_Cpp Norela (info1cup18_norela) C++17
20 / 100
 800 ms 504 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <bitset>
using namespace std;
 
#define FOR(i, a, b) for (int i = a; i < (int) b; i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = a; i >= (int) b; i--)
#define R0F(i, a) ROF(i, a, 0)
#define GO(i, a) for (auto i : a)
 
#define f first
#define s second
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
 
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vpii> vvpii;
typedef long long i64;
typedef vector<i64> vi64;
 
const int dr[] = {+1, -1, +0, +0, +1, -1, +1, -1};
const int dc[] = {+0, +0, +1, -1, +1, -1, -1, +1};
const int ms[] = {+31, +29, +31, 30, +31, +30, +31, +31, +30, +31, +30, +31};

void setIO(string nome) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen ((nome + ".in").c_str(), "r", stdin);
  freopen ((nome + ".out").c_str(), "w", stdout);
}

void Update (int &mask, int cur) {
  F0R (i, 30) {
    int A = ((mask >> i) & 1);
    int B = ((cur >> i) & 1);
    if (A && !B) {
      return;
    }
    if (B && !A) {
      mask = cur;
      return;
    }
  }
}

int main () {
  ios_base::sync_with_stdio(0); 
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  vvi q (m);
  F0R (i, m) {
    int foo;
    cin >> foo;
    F0R (j, foo) {
      int bar;
      cin >> bar;
      q[i].eb(bar);
    }
  }
  int ans = -1;
  bitset<505> Get;
  F0R (mask, 1 << m) {
    Get.reset();
    F0R (i, m) {
      if ((mask >> i) & 1) {
        GO (to, q[i]) {
          Get.flip(to);
        }
      }
    }
    if ( (int) Get.count() == n) {
      if (ans == -1 || __builtin_popcount(mask) < __builtin_popcount(ans)) ans = mask;
      else if (__builtin_popcount(mask) == __builtin_popcount(ans)) Update (ans, mask);
    }
  }
  cout << __builtin_popcount(ans) << '\n';
  F0R (i, m) {
    if ((ans >> i) & 1) cout << i + 1 << ' ';
  }
  cout << '\n';
  return 0;
}

Compilation message

norela.cpp: In function 'void setIO(std::__cxx11::string)':
norela.cpp:39:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".in").c_str(), "r", stdin);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
norela.cpp:40:11: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen ((nome + ".out").c_str(), "w", stdout);
   ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 376 KB Output is correct
2 Correct 181 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 137 ms 504 KB Output is correct
5 Correct 142 ms 376 KB Output is correct
6 Correct 138 ms 376 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 376 KB Output is correct
2 Correct 181 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 137 ms 504 KB Output is correct
5 Correct 142 ms 376 KB Output is correct
6 Correct 138 ms 376 KB Output is correct
7 Execution timed out 958 ms 504 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 376 KB Output is correct
2 Correct 181 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 137 ms 504 KB Output is correct
5 Correct 142 ms 376 KB Output is correct
6 Correct 138 ms 376 KB Output is correct
7 Execution timed out 958 ms 504 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 140 ms 376 KB Output is correct
2 Correct 181 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 137 ms 504 KB Output is correct
5 Correct 142 ms 376 KB Output is correct
6 Correct 138 ms 376 KB Output is correct
7 Execution timed out 958 ms 504 KB Time limit exceeded
8 Halted 0 ms 0 KB -