oj.uz

답안 #588724

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588724 2022-07-04T00:33:24 Z nguyen31hoang08minh2003 Pizza (COCI21_pizza) C++14
50 / 50
 1 ms 340 KB 
/*
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|../\..|
|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|\/  \/|
|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|/    \|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|\    /|
|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|/\  /\|
|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|..\/..|
+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+------+
*/
#include <bits/stdc++.h>
#define fore(i, a, b) for (signed i = (a), i##_last = (b); i < i##_last; ++i)
#define fort(i, a, b) for (signed i = (a), i##_last = (b); i <= i##_last; ++i)
#define ford(i, a, b) for (signed i = (a), i##_last = (b); i >= i##_last; --i)
#define fi first
#define se second
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;

template<class A, class B> bool maxi(A &a, const B &b) {return (a < b) ? (a = b, true):false;};
template<class A, class B> bool mini(A &a, const B &b) {return (a > b) ? (a = b, true):false;};

typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;

#define maxN 105
#define maxM 105
#define maxA 105

int n, m, res, a[maxN], k[maxM];
bool vis[maxA];
vi b[maxM];

int main() {
    bool flag;
    #ifdef LOCAL
        freopen("input.INP", "r", stdin);
    #endif // LOCAL
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    cin >> n;
    fort(i, 1, n) {
        cin >> a[i];
        vis[a[i]] = true;
    }
    cin >> m;
    fort(i, 1, m) {
        cin >> k[i];
        b[i].resize(k[i]);
        flag = true;
        fore(j, 0, k[i]) {
            cin >> b[i][j];
            if (vis[b[i][j]])
                flag = false;
        }
        if (flag)
            ++res;
    }
    cout << res << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 320 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct