oj.uz

Submission #542506

# Submission time Handle Problem Language Result Execution time Memory
542506 2022-03-26T19:38:14 Z Olympia Geppetto (COCI15_geppetto) C++17
80 / 80
 15 ms 332 KB 
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <queue>
#include <limits.h>
using namespace std;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int N, M; cin >> N >> M;
    vector<pair<int,int>> vec;
    for (int i = 0; i < M; i++) {
        int x, y;
        cin >> x >> y;
        x--, y--;
        vec.emplace_back(x, y);
    }
    int c = 0;
    for (int i = 0; i < (1 << N); i++) {
        bool fine = true;
        for (auto& p: vec) {
            if ((i & (1 << p.first)) && (i & (1 << p.second))) {
                fine = false;
                break;
            }
        }
        c += fine;
    }
    cout << c;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 15 ms 332 KB Output is correct
4 Correct 11 ms 212 KB Output is correct
5 Correct 11 ms 324 KB Output is correct
6 Correct 15 ms 212 KB Output is correct
7 Correct 13 ms 212 KB Output is correct
8 Correct 13 ms 212 KB Output is correct
9 Correct 9 ms 324 KB Output is correct
10 Correct 4 ms 212 KB Output is correct