Submission #7532314


Source Code Expand

Copy
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
//#define cerr if(false) cerr
#ifdef DEBUG
#define show(...) cerr << #__VA_ARGS__ << " = ", debug(__VA_ARGS__);
#else
#define show(...) 42
#endif
using namespace std;
using ll = long long;
using pii = pair<int, int>;
template <typename T, typename S>
ostream& operator<<(ostream& os, pair<T, S> a) {
    os << '(' << a.first << ',' << a.second << ')';
    return os;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
    for (auto x : v) os << x << ' ';
    return os;
}
void debug() {
    cerr << '\n';
}
template <typename H, typename... T>
void debug(H a, T... b) {
    cerr << a;
    if (sizeof...(b)) cerr << ", ";
    debug(b...);
}
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, k, q;
    cin >> n >> k >> q;
    vector<int>a(n);
    rep(i,q){
        int x;
        cin >> x;
        x--;
        a[x]++;
    }
    rep(i,n){
        if(k-q+a[i]>0){
            cout <<"Yes"<< "\n";
        }else{
            cout << "No" << "\n";
        }
    }
}

Submission Info

Submission Time
Task C - Attack Survival
User polyomino
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1507 Byte
Status AC
Exec Time 14 ms
Memory 1024 KB

Judge Result

Set Name Sample Subtask1
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 26
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt, sub1_21.txt, sub1_22.txt, sub1_23.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
sub1_01.txt AC 14 ms 1024 KB
sub1_02.txt AC 9 ms 1024 KB
sub1_03.txt AC 13 ms 896 KB
sub1_04.txt AC 9 ms 896 KB
sub1_05.txt AC 6 ms 896 KB
sub1_06.txt AC 12 ms 896 KB
sub1_07.txt AC 11 ms 896 KB
sub1_08.txt AC 8 ms 896 KB
sub1_09.txt AC 12 ms 896 KB
sub1_10.txt AC 11 ms 896 KB
sub1_11.txt AC 13 ms 896 KB
sub1_12.txt AC 14 ms 896 KB
sub1_13.txt AC 7 ms 896 KB
sub1_14.txt AC 9 ms 896 KB
sub1_15.txt AC 14 ms 896 KB
sub1_16.txt AC 14 ms 896 KB
sub1_17.txt AC 9 ms 384 KB
sub1_18.txt AC 7 ms 896 KB
sub1_19.txt AC 9 ms 384 KB
sub1_20.txt AC 7 ms 896 KB
sub1_21.txt AC 9 ms 384 KB
sub1_22.txt AC 11 ms 1024 KB
sub1_23.txt AC 1 ms 256 KB