Contest Duration: - (local time) (100 minutes) Back to Home

Submission #7521047

Source Code Expand

Copy
```#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii=pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c),end(c)
#define rall(c) rbegin(c),rend(c)
#define fore(x,c) for(auto &&x:c)
#define rep(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define rrep(i, a, n) for(int i=(int)(n-1);i>=a;--i)
#define sz(c) ((int)c.size())
#define contains(c,x) (c.find(x)!=end(c))
#define inseg(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
before_main_function() {
cin.tie(nullptr); ios::sync_with_stdio(0);
cout << setprecision(15) << fixed;
// #define endl "\n"
}
} before_main_function;
//------------------8<------------------------------------8<--------------------

signed main() {
int N, K, Q;
cin >> N >> K >> Q;
vi A(Q);
cin >> A;

vi score(N, K);
rep(i, 0, Q) {
score[A[i] - 1]++;
}
rep(i, 0, N) {
score[i] -= Q;
if (score[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return (0^_^0);
}

```

#### Submission Info

Submission Time 2019-09-15 21:08:19+0900 C - Attack Survival algon C++14 (GCC 5.4.1) 300 2027 Byte AC 154 ms 2176 KB

#### Judge Result

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 154 ms 2176 KB
sub1_02.txt AC 150 ms 1792 KB
sub1_03.txt AC 153 ms 2048 KB
sub1_04.txt AC 149 ms 1664 KB
sub1_05.txt AC 146 ms 1408 KB
sub1_06.txt AC 149 ms 1920 KB
sub1_07.txt AC 152 ms 1920 KB
sub1_08.txt AC 146 ms 1536 KB
sub1_09.txt AC 149 ms 1920 KB
sub1_10.txt AC 150 ms 1792 KB
sub1_11.txt AC 150 ms 2048 KB
sub1_12.txt AC 152 ms 2176 KB
sub1_13.txt AC 146 ms 1280 KB
sub1_14.txt AC 149 ms 1664 KB
sub1_15.txt AC 152 ms 2176 KB
sub1_16.txt AC 152 ms 2176 KB
sub1_17.txt AC 23 ms 1152 KB
sub1_18.txt AC 145 ms 1408 KB
sub1_19.txt AC 23 ms 1152 KB
sub1_20.txt AC 145 ms 1408 KB
sub1_21.txt AC 23 ms 1152 KB
sub1_22.txt AC 153 ms 1920 KB
sub1_23.txt AC 3 ms 256 KB