problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02909 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string weather[3] = {"Sunny", "Cloudy", "Rainy"};
string input;
cin >> input;
int i = 0;
while (i < 3) {
if (weather[i] == input) {
if (i == 2)
i = -1;
cout << weather[i + 1] << endl;
}
i++;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string weather[3] = {"Sunny", "Cloudy", "Rainy"};
string input;
cin >> input;
int i = 0;
while (i < 3) {
if (weather[i] == input) {
if (i == 2)
i = -1;
cout << weather[i + 1] << endl;
break;
}
i++;
}
}
| insert | 14 | 14 | 14 | 15 | TLE | |
p02909 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int main() {
vector<string> S = {"Sunny", "Cloudy", "Rainy", "Sunny"};
string s;
cin >> s;
rep(i, s.size()) {
if (s == S[i]) {
cout << s[i + 1];
}
}
} | #define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// void p(vector<int> A){rep(i,A.size()){cout << A[i] << " ";}cout << "\n";}
int main() {
vector<string> S = {"Sunny", "Cloudy", "Rainy", "Sunny"};
string s;
cin >> s;
rep(i, s.size()) {
if (s == S[i]) {
cout << S[i + 1];
exit(0);
}
}
}
| replace | 13 | 14 | 13 | 15 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = std::
cxx11::basic_string<char>; _Allocator = std::allocator<std::
cxx11::basic_string<char> >; reference = std::
cxx11::basic_string<char>&; size_type = long unsigned int]
Error: attempt to subscript container with out-of-bounds index 4, but
container only holds 4 elements.
Objects involved in the operation:
sequence "this" @ 0x7ffd357fc310 {
type = std::debug::vector<std::cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> >, std::allocator<std::cxx11::basic_string<char, std::char_traits<char>, std::allocator<char> > > >;
}
|
p02909 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(a) memset(a, 0, sizeof(a))
#define pb push_back
#define all(a) a.begin(), a.end()
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define rloop(i, n) for (int i = n - 1; i >= 0; i--)
#define rloops(i, s, n) for (int i = n - 1; i >= s; i--)
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
double tick() {
static clock_t oldt, newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
//---------------------------------------------------------------------------------------------
int main() {
fastio;
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
string ans[3];
ans[0] = "Sunny";
ans[1] = "Cloudy";
ans[2] = "Rainy";
string s;
cin >> s;
loop(i, 3) {
if (s == ans[i]) {
cout << ans[(i + 1) % 3] << endl;
break;
}
}
// cout<<"Execution time : "<<tick()<<"\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define init(a) memset(a, 0, sizeof(a))
#define pb push_back
#define all(a) a.begin(), a.end()
#define loop(i, n) for (int i = 0; i < n; i++)
#define loops(i, s, n) for (int i = s; i < n; i++)
#define rloop(i, n) for (int i = n - 1; i >= 0; i--)
#define rloops(i, s, n) for (int i = n - 1; i >= s; i--)
template <typename T> T gcd(T a, T b) { return (b ? __gcd(a, b) : a); }
template <typename T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
double tick() {
static clock_t oldt, newt = clock();
double diff = 1.0 * (newt - oldt) / CLOCKS_PER_SEC;
oldt = newt;
return diff;
}
//---------------------------------------------------------------------------------------------
int main() {
fastio;
// #ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// #endif
string ans[3];
ans[0] = "Sunny";
ans[1] = "Cloudy";
ans[2] = "Rainy";
string s;
cin >> s;
loop(i, 3) {
if (s == ans[i]) {
cout << ans[(i + 1) % 3] << endl;
break;
}
}
// cout<<"Execution time : "<<tick()<<"\n";
return 0;
} | replace | 37 | 40 | 37 | 40 | 0 | |
p02909 | C++ | Runtime Error | // VU TRUONG AN
#include <bits/stdc++.h>
#define FORX(i, x, y) for (int i = x; i <= y; ++i)
#define FORN(i, x, y) for (int i = x; i >= y; --i)
#define reset(x, y) memset(x, y, sizeof(x))
#define bp(i) (1 << i)
#define F first
#define S second
#define maxn 100001
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define bit(p, x) ((x >> p) & 1)
#define Task "ATC"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<db> vdb;
typedef vector<str> vstr;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdb;
const int base = 100003;
const long long MM = 1ll * MOD * MOD;
const int maxc = 2e9;
int n, a[maxn];
void Solve() {
string s;
cin >> s;
if (s == "Sunny")
cout << "Cloudy";
else if (s == "Cloudy")
cout << "Rainy";
else
cout << "Sunny";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen(Task ".inp", "r", stdin);
freopen(Task ".out", "w", stdout);
#endif
Solve();
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| // VU TRUONG AN
#include <bits/stdc++.h>
#define FORX(i, x, y) for (int i = x; i <= y; ++i)
#define FORN(i, x, y) for (int i = x; i >= y; --i)
#define reset(x, y) memset(x, y, sizeof(x))
#define bp(i) (1 << i)
#define F first
#define S second
#define maxn 100001
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define bit(p, x) ((x >> p) & 1)
#define Task "ATC"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<db> vdb;
typedef vector<str> vstr;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdb;
const int base = 100003;
const long long MM = 1ll * MOD * MOD;
const int maxc = 2e9;
int n, a[maxn];
void Solve() {
string s;
cin >> s;
if (s == "Sunny")
cout << "Cloudy";
else if (s == "Cloudy")
cout << "Rainy";
else
cout << "Sunny";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
Solve();
#ifdef LOCAL_DEFINE
cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
| replace | 55 | 59 | 55 | 56 | 0 | |
p02909 | Python | Runtime Error | import bisect
N, M = list(map(int, input().split(" ")))
As = list(map(int, input().split(" ")))
# osoi
As = sorted([-a for a in As])
while M:
hoge = -As.pop(0) // 2
M -= 1
while M and As and hoge < As[1]:
hoge = hoge // 2
M -= 1
bisect.insort(As, -hoge)
print(-sum(As))
| # coding: utf-8
# Your code here!
s = input()
l = ["Sunny", "Cloudy", "Rainy"] + ["Sunny", "Cloudy", "Rainy"]
print(l[l.index(s) + 1])
| replace | 0 | 14 | 0 | 5 | ValueError: invalid literal for int() with base 10: 'Sunny' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02909/Python/s541575492.py", line 2, in <module>
N, M = list(map(int, input().split(' ')))
ValueError: invalid literal for int() with base 10: 'Sunny'
|
p02909 | Python | Runtime Error | S = input().strip()
weather = ["Sunny", "Cloudy", "Rainy"]
idx = weather.index(S) + 1
if idx > len(weather):
print(weather[0])
else:
print(weather[idx])
| S = input().strip()
weather = ["Sunny", "Cloudy", "Rainy"]
idx = weather.index(S) + 1
if idx >= len(weather):
print(weather[0])
else:
print(weather[idx])
| replace | 6 | 7 | 6 | 7 | 0 | |
p02909 | Python | Runtime Error | import sys
S = sys.stdin.readline().rstrip()
WS = ["Sunny", "Cloudy", "Rainy"]
i = WS.index(S)
i += 1
if i == 2:
i = 0
print(WS[i])
| import sys
S = sys.stdin.readline().rstrip()
WS = ["Sunny", "Cloudy", "Rainy"]
i = WS.index(S)
i += 1
if i == 3:
i = 0
print(WS[i])
| replace | 8 | 9 | 8 | 9 | 0 | |
p02909 | Python | Runtime Error | s = input()
weather = ["Sunny", "Cloudy", "Rainy"]
print(weather[weather.index(s) + 1])
| s = input()
weather = ["Sunny", "Cloudy", "Rainy"]
print(weather[(weather.index(s) + 1) % 3])
| replace | 3 | 4 | 3 | 4 | 0 | |
p02909 | Python | Runtime Error | w = input()
weather = ["Sunny", "Cloudy", "Rainy"]
index = weather.index(w)
index += 1
if index == 2:
index = 0
print(weather[index])
| w = input()
weather = ["Sunny", "Cloudy", "Rainy"]
index = weather.index(w)
index += 1
if index == 3:
index = 0
print(weather[index])
| replace | 5 | 6 | 5 | 6 | 0 | |
p02909 | Python | Runtime Error | x = input()
list = ["Sunny", "Cloudy", "Rainy", "Sunny"]
for i in range(len(list)):
theday = list[i]
if x == theday:
answer = list[i + 1]
print(answer)
| x = input()
list = ["Sunny", "Cloudy", "Rainy", "Sunny"]
for i in range(len(list) - 1):
theday = list[i]
if x == theday:
answer = list[i + 1]
print(answer)
| replace | 3 | 4 | 3 | 4 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02909/Python/s756189092.py", line 7, in <module>
answer = list[i + 1]
IndexError: list index out of range
|
p02909 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define int long long int
#define ull unsigned long long
using namespace std;
const int MOD = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
string s;
cin >> s;
if (s == "Sunny") {
cout << "Cloudy" << endl;
} else if (s == "Cloudy") {
cout << "Rainy" << endl;
} else {
cout << "Sunny" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define clr(a) memset(a, 0, sizeof(a))
#define sz(x) x.size()
#define rep(n) for (ll i = 0; i < n; i++)
#define repc(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, x, y) for (int i = x; i < y; i++)
#define DEC(i, x, y) for (int i = x; i >= y; i--)
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define alla(a, n) a, a + n
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) (a * b) / gcd(a, b)
#define int long long int
#define ull unsigned long long
using namespace std;
const int MOD = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
if (s == "Sunny") {
cout << "Cloudy" << endl;
} else if (s == "Cloudy") {
cout << "Rainy" << endl;
} else {
cout << "Sunny" << endl;
}
return 0;
}
| delete | 26 | 29 | 26 | 26 | 0 | |
p02910 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char a[10];
scanf("%s", a);
int l = strlen(a);
int flag = 1;
for (int i = 0; i < l; i++) {
if (i % 2 == 0) {
if (a[i] == 'L') {
flag = 0;
break;
}
} else {
if (a[i] == 'R') {
flag = 0;
break;
}
}
}
if (flag == 0)
printf("No\n");
else
printf("Yes\n");
return 0;
}
| #include <algorithm>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
char a[1000];
scanf("%s", a);
int l = strlen(a);
int flag = 1;
for (int i = 0; i < l; i++) {
if (i % 2 == 0) {
if (a[i] == 'L') {
flag = 0;
break;
}
} else {
if (a[i] == 'R') {
flag = 0;
break;
}
}
}
if (flag == 0)
printf("No\n");
else
printf("Yes\n");
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02910 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define oo 2000000000
#define inf 1000000000000000LL
#define M 1000000007
typedef long long ll;
using namespace std;
const int N = 105001;
map<string, string> mp;
signed main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'L' && (i % 2 == 0) || s[i] == 'R' && (i & 1))
return puts("No");
}
puts("Yes");
return 0;
}
| #include <bits/stdc++.h>
#define F first
#define S second
#define all(a) a.begin(), a.end()
#define setDP(arr) memset(arr, -1, sizeof arr)
#define oo 2000000000
#define inf 1000000000000000LL
#define M 1000000007
typedef long long ll;
using namespace std;
const int N = 105001;
map<string, string> mp;
signed main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'L' && (i % 2 == 0) || s[i] == 'R' && (i & 1))
return puts("No"), 0;
}
puts("Yes");
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02910 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n;
cin >> s;
n = (int)s.length();
for (int i = 0; i < n; i + 2) {
if (s[i] == 'L') {
cout << "No" << endl;
return 0;
} else if (s[i + 1] == 'R') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int n;
cin >> s;
n = (int)s.length();
for (int i = 0; i < n; i += 2) {
if (s[i] == 'L') {
cout << "No" << endl;
return 0;
} else if (s[i + 1] == 'R') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02910 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.size(); i += 2) {
if (S.at(i) == 'L') {
flag = false;
}
if (S.at(i + 1) == 'R') {
flag = false;
}
}
if (flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
for (int i = 0; i < S.size(); i += 2) {
if (S.at(i) == 'L') {
flag = false;
}
}
for (int i = 0; i + 1 < S.size(); i += 2) {
if (S.at(i + 1) == 'R') {
flag = false;
}
}
if (flag == true) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
} | replace | 11 | 12 | 11 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 7) >= this->size() (which is 7)
|
p02910 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int i = 1;
while (1) {
if (i % 2 == 1) {
if (s[i - 1] != 'L') {
i++;
} else {
cout << "No" << endl;
break;
}
}
else {
if (s[i - 1] != 'R') {
i++;
} else {
cout << "No" << endl;
break;
}
}
if (i == s.length()) {
cout << "Yes" << endl;
break;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string s;
cin >> s;
int i = 1;
while (1) {
if (i % 2 == 1) {
if (s[i - 1] != 'L') {
i++;
} else {
cout << "No" << endl;
break;
}
}
else {
if (s[i - 1] != 'R') {
i++;
} else {
cout << "No" << endl;
break;
}
}
if (i - 1 == s.length()) {
cout << "Yes" << endl;
break;
}
}
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p02910 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
template <class T> inline vector<T> make_v(const T &initvalue, size_t sz) {
return vector<T>(sz, initvalue);
}
template <class T, class... Args>
inline auto make_v(const T &initvalue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initvalue, args...))>(
sz, make_v<T>(initvalue, args...));
}
constexpr int INF = 0x3f3f3f3f;
constexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
// }}} End
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
size_t N = s.length();
for (size_t i = 0; i < N; i *= 2) {
if (s[i] != 'R' && s[i] != 'U' && s[i] != 'D') {
return cout << "No"
<< "\n",
0;
}
}
for (size_t i = 1; i < N; i += 2) {
if (s[i] != 'L' && s[i] != 'U' && s[i] != 'D') {
return cout << "No"
<< "\n",
0;
}
}
cout << "Yes"
<< "\n";
return 0;
}
| #include "bits/stdc++.h"
#pragma GCC optimize("Ofast")
// Begin {{{
using namespace std;
#ifndef DEBUG
#define dump(...)
#endif
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
template <class T> inline vector<T> make_v(const T &initvalue, size_t sz) {
return vector<T>(sz, initvalue);
}
template <class T, class... Args>
inline auto make_v(const T &initvalue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initvalue, args...))>(
sz, make_v<T>(initvalue, args...));
}
constexpr int INF = 0x3f3f3f3f;
constexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;
// }}} End
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
string s;
cin >> s;
size_t N = s.length();
for (size_t i = 0; i < N; i += 2) {
if (s[i] != 'R' && s[i] != 'U' && s[i] != 'D') {
return cout << "No"
<< "\n",
0;
}
}
for (size_t i = 1; i < N; i += 2) {
if (s[i] != 'L' && s[i] != 'U' && s[i] != 'D') {
return cout << "No"
<< "\n",
0;
}
}
cout << "Yes"
<< "\n";
return 0;
}
| replace | 39 | 40 | 39 | 40 | TLE | |
p02910 | Python | Runtime Error | S = list(input())
flag = True
for i in range(0, int(len(S) / 2 + 1), 2):
if S[i] == "L":
flag = False
if S[i + 1] == "R":
flag = False
if flag:
print("Yes")
else:
print("No")
| S = list(input())
flag = True
for i in range(len(S)):
if i % 2 == 0:
if S[i] == "L":
flag = False
else:
if S[i] == "R":
flag = False
if flag:
print("Yes")
else:
print("No")
| replace | 2 | 7 | 2 | 9 | 0 | |
p02910 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (i % 0 == 0) // 偶数
{
if (s[i] == 'R' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
} else {
if (s[i] == 'L' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
} | #include "bits/stdc++.h"
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
const int MOD = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (i % 2 == 0) // 偶数
{
if (s[i] == 'R' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
} else {
if (s[i] == 'L' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
} | replace | 12 | 13 | 12 | 13 | -8 | |
p02910 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma GCC target("avx,avx2,tune=native")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define orz \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define inp \
freopen("input.txt", "r", stdin); \
freopen("out.txt", "w", stdout);
ll mod = 1e9 + 7;
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 2e5 + 5;
int a[N], v[N];
int main() {
io();
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2) {
if (s[i] == 'L' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
} else {
if (s[i] == 'R' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#pragma GCC target("avx,avx2,tune=native")
#pragma GCC optimization("unroll-loops")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define len(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define orz \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define inp \
freopen("input.txt", "r", stdin); \
freopen("out.txt", "w", stdout);
ll mod = 1e9 + 7;
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
const int N = 2e5 + 5;
int a[N], v[N];
int main() {
// io();
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (i % 2) {
if (s[i] == 'L' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
} else {
if (s[i] == 'R' || s[i] == 'U' || s[i] == 'D')
continue;
else {
cout << "No";
return 0;
}
}
}
cout << "Yes";
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p02910 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define ll long long
int main() {
std::string S;
cin >> S;
bool retbool = true;
ll i = 0;
while (retbool && i < S.size()) {
const char c = S[i];
if (i % 2 == 0 && c == 'L')
retbool = false;
else if (i % 2 == 1 && c == 'R')
retbool = false;
}
if (retbool)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <iostream>
using namespace std;
#define ll long long
int main() {
std::string S;
cin >> S;
bool retbool = true;
ll i = 0;
while (retbool && i < S.size()) {
const char c = S[i];
if (i % 2 == 0 && c == 'L')
retbool = false;
else if (i % 2 == 1 && c == 'R')
retbool = false;
i++;
}
if (retbool)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| insert | 15 | 15 | 15 | 16 | TLE | |
p02910 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int n;
bool f = false;
n = S.size();
int i = 1;
while (i <= n) {
if ((i % 2) == 1) {
if (S.at(i) == 'L') {
f = true;
break;
}
} else {
if (S.at(i) == 'R') {
f = true;
break;
}
}
i++;
}
if (f == true) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
string S;
cin >> S;
int n;
bool f = false;
n = S.size();
int i = 0;
while (i < n) {
if ((i % 2) == 0) {
if (S.at(i) == 'L') {
f = true;
break;
}
} else {
if (S.at(i) == 'R') {
f = true;
break;
}
}
i++;
}
if (f == true) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
return 0;
} | replace | 10 | 13 | 10 | 13 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(Q);
for (ll i = 0; i < Q; ++i) {
ll a;
cin >> a;
A[a - 1]++;
}
for (ll i = 0; i < N; ++i) {
if (K - Q + A[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using namespace std;
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(N, 0);
for (ll i = 0; i < Q; ++i) {
ll a;
cin >> a;
A[a - 1]++;
}
for (ll i = 0; i < N; ++i) {
if (K - Q + A[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N, K, Q;
scanf("%d %d %d", &N, &K, &Q);
vector<int> answerers(Q);
vector<int> state(N, K - Q);
rep(i, Q) {
scanf("%d", &answerers[i]);
rep(k, N) {
if (answerers.at(i) == k) {
/* increment answerer */
state[answerers.at(i) - 1] += 1;
}
}
}
rep(i, N) {
if (state[i] > 0)
printf("Yes\n");
else
printf("No\n");
}
} | #include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int N, K, Q;
scanf("%d %d %d", &N, &K, &Q);
vector<int> answerers(Q);
vector<int> state(N, K - Q);
rep(i, Q) {
scanf("%d", &answerers[i]);
state[answerers.at(i) - 1] += 1;
}
rep(i, N) {
if (state[i] > 0)
printf("Yes\n");
else
printf("No\n");
}
} | replace | 15 | 21 | 15 | 16 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[10005];
int main() {
int n, k, q, t;
cin >> n >> k >> q;
memset(a, 0, sizeof(a));
for (int i = 0; i < q; i++) {
cin >> t;
a[t]++;
}
for (int i = 1; i <= n; i++) {
if (q - a[i] >= k)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
int n, k, q, t;
cin >> n >> k >> q;
memset(a, 0, sizeof(a));
for (int i = 0; i < q; i++) {
cin >> t;
a[t]++;
}
for (int i = 1; i <= n; i++) {
if (q - a[i] >= k)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define m_p make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, q;
cin >> n >> k >> q;
vector<ll> a(q);
vector<bool> ok(q, false);
map<ll, ll> mp;
rep(i, q) {
cin >> a[i];
mp[a[i]]++;
}
if (k - q > 0) {
rep(i, n) { cout << "Yes" << endl; }
return 0;
}
rep(i, q) {
if (k - (q - mp[a[i]]) > 0)
ok[a[i] - 1] = true;
}
rep(i, n) {
if (ok[i])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60, MOD = 1e9 + 7;
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define m_p make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k, q;
cin >> n >> k >> q;
vector<ll> a(q);
vector<bool> ok(n, false);
map<ll, ll> mp;
rep(i, q) {
cin >> a[i];
mp[a[i]]++;
}
if (k - q > 0) {
rep(i, n) { cout << "Yes" << endl; }
return 0;
}
rep(i, q) {
if (k - (q - mp[a[i]]) > 0)
ok[a[i] - 1] = true;
}
rep(i, n) {
if (ok[i])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
#define SORT(c) sort((c).begin(), (c).end())
#define vi(m, a) vector<int> m(a)
#define vti(m, a, i) vector<vector<int>> m(a, vector<int>(i))
#define ALL(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define Fe(it, a) for (auto &it : a)
#define all(a) begin(a), end(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define WARU 1000000007
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> v(k);
map<int, int> mp;
rep(i, q) {
int tmp;
cin >> tmp;
tmp--;
mp[tmp]++;
}
rep(i, n) {
int res = k - q + mp[i];
if (res <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
}
| #include <algorithm>
#include <bitset>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
#define SORT(c) sort((c).begin(), (c).end())
#define vi(m, a) vector<int> m(a)
#define vti(m, a, i) vector<vector<int>> m(a, vector<int>(i))
#define ALL(it, a) for (auto it = a.begin(); it != a.end(); it++)
#define Fe(it, a) for (auto &it : a)
#define all(a) begin(a), end(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define WARU 1000000007
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int main() {
int n, k, q;
cin >> n >> k >> q;
map<int, int> mp;
rep(i, q) {
int tmp;
cin >> tmp;
tmp--;
mp[tmp]++;
}
rep(i, n) {
int res = k - q + mp[i];
if (res <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
}
| delete | 40 | 41 | 40 | 40 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> y(q);
rep(i, q) cin >> y.at(i);
rep(i, n) {
int x = 0;
for (int j : y)
if (j == i + 1)
x++;
if (0 < k + x - q)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> y(q);
rep(i, q) cin >> y.at(i);
vector<int> x(n, k - q);
rep(i, q) x.at(y.at(i) - 1)++;
for (int i : x) {
if (0 < i)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | replace | 9 | 15 | 9 | 13 | TLE | |
p02911 | Python | Time Limit Exceeded | N, K, Q = map(int, input().split(" "))
score = [K for player in range(N)]
answers = [int(input()) - 1 for q in range(Q)]
for answer in answers:
for i in range(N):
if i != answer:
score[i] = score[i] - 1
for result in score:
if result > 0:
print("Yes")
else:
print("No")
| N, K, Q = map(int, input().split(" "))
score = [K for player in range(N)]
answers = [int(input()) - 1 for q in range(Q)]
for answer in answers:
score[answer] = score[answer] + 1
score = [point - Q for point in score]
for result in score:
if result > 0:
print("Yes")
else:
print("No")
| replace | 5 | 8 | 5 | 8 | TLE | |
p02911 | Python | Time Limit Exceeded | import numpy as np
N, K, Q = map(int, input().split())
person = np.asarray([K] * N)
for i in range(Q):
ok_person = int(input()) - 1
person -= 1
person[ok_person] += 1
for i in range(N):
if person[i] > 0:
print("Yes")
else:
print("No")
| import numpy as np
N, K, Q = map(int, input().split())
person = np.asarray([K] * N)
ok_person = [int(input()) for i in range(Q)]
false_num = len(ok_person)
person -= false_num
# print(person)
for i in ok_person:
person[i - 1] += 1
# print(person)
# print(person)
for i in range(N):
if person[i] > 0:
print("Yes")
else:
print("No")
| replace | 5 | 9 | 5 | 14 | TLE | |
p02911 | Python | Runtime Error | n, k, q = map(int, input().split())
scores = [k - q] * n
for index in range(q):
winner = int(input())
scores[winner] += 1
for participant in range(n):
print("Yes") if scores[participant] > 0 else print("No")
| n, k, q = map(int, input().split())
scores = [k - q] * n
for index in range(q):
winner = int(input())
scores[winner - 1] += 1
for participant in range(n):
print("Yes") if scores[participant] > 0 else print("No")
| replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
scanf("%d %d %d", &n, &k, &q);
vector<int> a(q, k - q);
for (int i = 0; i < q; ++i) {
int x;
scanf("%d", &x);
x--;
a[x]++;
}
for (int i = 0; i < n; ++i) {
if (a[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
scanf("%d %d %d", &n, &k, &q);
vector<int> a(n, k - q);
for (int i = 0; i < q; ++i) {
int x;
scanf("%d", &x);
x--;
a[x]++;
}
for (int i = 0; i < n; ++i) {
if (a[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
int n, k, q;
std::cin >> n >> k >> q;
std::vector<int> score(n, k - q); // 各人の点数
std::vector<int> a(n); // 正解者
for (int i = 0; i < q; i++) {
std::cin >> a[i];
a[i]--;
}
for (int i = 0; i < q; i++) {
score[a[i]]++;
}
for (int i = 0; i < n; i++) {
std::cout << (score[i] <= 0 ? "No" : "Yes") << std::endl;
}
} | #include <bits/stdc++.h>
int main() {
int n, k, q;
std::cin >> n >> k >> q;
std::vector<int> score(n, k - q); // 各人の点数
std::vector<int> a(q); // 正解者
for (int i = 0; i < q; i++) {
std::cin >> a[i];
a[i]--;
}
for (int i = 0; i < q; i++) {
score[a[i]]++;
}
for (int i = 0; i < n; i++) {
std::cout << (score[i] <= 0 ? "No" : "Yes") << std::endl;
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | Python | Time Limit Exceeded | n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
for i in range(n):
print("Yes" if k + a.count(i + 1) - q > 0 else "No")
| n, k, q = map(int, input().split())
nList = [0] * n
for _ in range(q):
nList[int(input()) - 1] += 1
for j in range(n):
print("Yes" if k + nList[j] - q > 0 else "No")
| replace | 1 | 4 | 1 | 6 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define irep(i, n) for (int i = 0; i < (n); i++)
#define irepy(i, n) for (int i = 1; i <= (n); i++)
#define jrep(j, n) for (int j = 0; i < (n); j++)
#define jrepy(j, n) for (int j = 1; i <= (n); j++)
int main() {
long long n, k, q;
long long A[10010] = {};
long long p[10010] = {}; // 個人の点数
cin >> n >> k >> q; // n=匹数,k=初期点,q=ラウンド数
for (int i = 0; i < q; i++)
cin >> A[i];
if (k > q) { // 終わり
irep(i, n) { cout << "Yes" << endl; }
return 0;
}
irep(i, n) p[i] = k - q;
for (int i = 0; i < q; i++) {
p[A[i] - 1]++;
}
irep(i, n) {
if (p[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define irep(i, n) for (int i = 0; i < (n); i++)
#define irepy(i, n) for (int i = 1; i <= (n); i++)
#define jrep(j, n) for (int j = 0; i < (n); j++)
#define jrepy(j, n) for (int j = 1; i <= (n); j++)
int main() {
long long n, k, q;
long long A[100010] = {};
long long p[100010] = {}; // 個人の点数
cin >> n >> k >> q; // n=匹数,k=初期点,q=ラウンド数
for (int i = 0; i < q; i++)
cin >> A[i];
if (k > q) { // 終わり
irep(i, n) { cout << "Yes" << endl; }
return 0;
}
irep(i, n) p[i] = k - q;
for (int i = 0; i < q; i++) {
p[A[i] - 1]++;
}
irep(i, n) {
if (p[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| replace | 11 | 13 | 11 | 13 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N, K, Q;
cin >> N >> K >> Q;
int tmp;
vector<int> A;
int cnt[10000] = {0};
for (int i = 0; i < Q; i++) {
cin >> tmp;
A.emplace_back(tmp);
cnt[tmp - 1] += 1;
}
int pnt;
for (int i = 0; i < N; i++) {
pnt = K - Q + cnt[i];
if (pnt > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N, K, Q;
cin >> N >> K >> Q;
int tmp;
vector<int> A;
int cnt[100000] = {0};
for (int i = 0; i < Q; i++) {
cin >> tmp;
A.emplace_back(tmp);
cnt[tmp - 1] += 1;
}
int pnt;
for (int i = 0; i < N; i++) {
pnt = K - Q + cnt[i];
if (pnt > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void Main();
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
void Main() {
auto &fin = cin;
int64_t n, k, q;
fin >> n >> k >> q;
vector<int64_t> a(q);
for (int64_t i = 0; i < a.size(); ++i) {
fin >> a[i];
}
vector<int64_t> score(n, k - q);
for (int64_t i = 0; i < a.size(); ++i) {
score[a[i] + 1]++;
}
for (int64_t i = 0; i < score.size(); ++i) {
if (score[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
void Main();
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
void Main() {
auto &fin = cin;
int64_t n, k, q;
fin >> n >> k >> q;
vector<int64_t> a(q);
for (int64_t i = 0; i < a.size(); ++i) {
fin >> a[i];
}
vector<int64_t> score(n, k - q);
for (int64_t i = 0; i < a.size(); ++i) {
score[a[i] - 1]++;
}
for (int64_t i = 0; i < score.size(); ++i) {
if (score[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q, s;
cin >> n >> k >> q;
int a = k - q;
vector<int> vec(n, a);
for (int i = 0; i < q; i++) {
cin >> s;
vec.at(s) += 1;
}
for (int i = 0; i < n; i++) {
if (vec.at(i) > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q, s;
cin >> n >> k >> q;
int a = k - q;
vector<int> vec(n, a);
for (int i = 0; i < q; i++) {
cin >> s;
vec.at(s - 1)++;
}
for (int i = 0; i < n; i++) {
if (vec.at(i) > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int main() {
int N; // 参加者人数
int K; // 初期ポイント
int Q; // 問題数
int q; // 問題の正解者
cin >> N >> K >> Q;
int challenger[100000];
for (int i = 0; i < N; i++) {
challenger[i] = K - Q;
}
for (int i = 0; i < Q; i++) {
cin >> q;
for (int j = 0; j < N; j++) {
if (j == (q - 1)) {
challenger[j]++;
}
}
}
for (int i = 0; i < N; i++) {
if (challenger[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int N; // 参加者人数
int K; // 初期ポイント
int Q; // 問題数
int q; // 問題の正解者
cin >> N >> K >> Q;
int challenger[100000];
for (int i = 0; i < N; i++) {
challenger[i] = K - Q;
}
for (int i = 0; i < Q; i++) {
cin >> q;
challenger[q - 1]++;
}
for (int i = 0; i < N; i++) {
if (challenger[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | replace | 19 | 24 | 19 | 20 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll arr[q];
ll x;
for (int i = 0; i < n; i++) {
arr[i] = k;
}
for (int i = 0; i < q; i++) {
cin >> x;
arr[x - 1] += 1;
}
for (int i = 0; i < n; i++) {
if (arr[i] - q <= 0)
cout << "No"
<< "\n";
else
cout << "Yes"
<< "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll arr[n];
ll x;
for (int i = 0; i < n; i++) {
arr[i] = k;
}
for (int i = 0; i < q; i++) {
cin >> x;
arr[x - 1] += 1;
}
for (int i = 0; i < n; i++) {
if (arr[i] - q <= 0)
cout << "No"
<< "\n";
else
cout << "Yes"
<< "\n";
}
} | replace | 7 | 8 | 7 | 8 | TLE | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(10010, 0);
rep(i, 1, q) {
int x;
cin >> x;
++a[x];
}
rep(i, 1, n) {
if (k > q - a[i])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, e) for (int(i) = (s); (i) <= (e); ++(i))
#define all(x) x.begin(), x.end()
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(100100, 0);
rep(i, 1, q) {
int x;
cin >> x;
++a[x];
}
rep(i, 1, n) {
if (k > q - a[i])
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int n) {
vector<int> S;
rep(i, n) if (bit & (1 << i)) S.push_back(i);
return S;
}
int d[10000005];
int main() {
int n, k, q;
cin >> n >> k >> q;
rep(i, q) {
int a;
cin >> a;
a--;
d[a]++;
}
vector<int> v(q);
rep(i, n) { v[i] = max(k - (q - d[i]), 0); }
rep(i, n) {
if (v[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 1e9
#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); (i) <= (int)(b); i++)
#define VEC(type, c, n) \
std::vector<type> c(n); \
for (auto &i : c) \
std::cin >> i;
#define vec(type, n) vector<type>(n)
#define vvec(m, n) vector<vector<int>>(int(m), vector<int>(n))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<int, int>;
vector<int> bitSearch(int bit, int n) {
vector<int> S;
rep(i, n) if (bit & (1 << i)) S.push_back(i);
return S;
}
int d[10000005];
int main() {
int n, k, q;
cin >> n >> k >> q;
rep(i, q) {
int a;
cin >> a;
a--;
d[a]++;
}
vector<int> v(n);
rep(i, n) { v[i] = max(k - (q - d[i]), 0); }
rep(i, n) {
if (v[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p02911 | Python | Time Limit Exceeded | n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
# print(A)
for i in range(1, n + 1):
if k - q + (A.count(i)) > 0:
print("Yes")
else:
print("No")
| n, k, q = map(int, input().split())
Point = [k - q] * n
for _ in range(q):
Point[int(input()) - 1] += 1
for e in Point:
if e > 0:
print("Yes")
else:
print("No")
| replace | 1 | 5 | 1 | 7 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define LL long long
using namespace std;
const int N = 1e6 + 7;
const LL mod = 1e9 + 7;
const int B = sqrt(1e5);
LL n, k, q;
LL d[4 * N];
LL a[N];
void f(LL x, LL y) {
while (x < N) {
d[x] += y;
x += x & -x;
}
}
LL ff(LL x) {
LL cnt = 0;
while (x > 0) {
cnt += d[x];
x -= x & -x;
}
return cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen( "input.txt" , "r" , stdin );
// freopen( "output.txt" , "w" , stdout );
cin >> n >> k >> q;
for (int i = 1; i <= k; i++)
f(1, 1);
for (int i = 1; i <= q; i++) {
LL x;
cin >> x;
f(x + 1, -1);
f(1, -1);
f(x, 1);
}
for (int i = 1; i <= n; i++) {
LL x = ff(i);
if (x > 0)
cout << "Yes\n";
else
cout << "No\n";
}
}
| #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define fi first
#define se second
#define LL long long
using namespace std;
const int N = 1e6 + 7;
const LL mod = 1e9 + 7;
const int B = sqrt(1e5);
LL n, k, q;
LL d[4 * N];
LL a[N];
void f(LL x, LL y) {
while (x < N) {
d[x] += y;
x += x & -x;
}
}
LL ff(LL x) {
LL cnt = 0;
while (x > 0) {
cnt += d[x];
x -= x & -x;
}
return cnt;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen( "input.txt" , "r" , stdin );
// freopen( "output.txt" , "w" , stdout );
cin >> n >> k >> q;
f(1, k);
for (int i = 1; i <= q; i++) {
LL x;
cin >> x;
f(x + 1, -1);
f(1, -1);
f(x, 1);
}
for (int i = 1; i <= n; i++) {
LL x = ff(i);
if (x > 0)
cout << "Yes\n";
else
cout << "No\n";
}
}
| replace | 41 | 43 | 41 | 42 | TLE | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FILE
using namespace std;
int main() {
#ifdef FILEs
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // FILE
ios_base::sync_with_stdio(false);
int n, k, m;
cin >> n >> k >> m;
int cnt[10] = {};
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
cnt[a]++;
}
for (int i = 1; i <= n; i++) {
if (m - cnt[i] >= k)
cout << "No";
else
cout << "Yes";
cout << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FILE
using namespace std;
int main() {
#ifdef FILEs
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // FILE
ios_base::sync_with_stdio(false);
int n, k, m;
cin >> n >> k >> m;
int cnt[101111] = {};
for (int i = 1; i <= m; i++) {
int a;
cin >> a;
cnt[a]++;
}
for (int i = 1; i <= n; i++) {
if (m - cnt[i] >= k)
cout << "No";
else
cout << "Yes";
cout << endl;
}
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll a[n];
rep(i, q) {
cin >> a[i];
a[i]--;
}
ll cnt[n];
rep(i, n) cnt[i] = 0;
rep(i, q) { cnt[a[i]]++; }
rep(i, n) {
cnt[i] += k - q;
if (cnt[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll a[q];
rep(i, q) {
cin >> a[i];
a[i]--;
}
ll cnt[n];
rep(i, n) cnt[i] = 0;
rep(i, q) { cnt[a[i]]++; }
rep(i, n) {
cnt[i] += k - q;
if (cnt[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, q;
cin >> n;
cin >> k;
cin >> q;
const int MAX_MEMBER = 10000;
// 各自の正解数を加算
int correctCount[MAX_MEMBER] = {};
for (int i = 0; i < q; i++) {
int correcter;
cin >> correcter;
correctCount[correcter - 1] += 1;
}
// 減点の合計が持ち点を超えないか確認
for (int i = 0; i < n; i++) {
if (k > (q - correctCount[i]))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, q;
cin >> n;
cin >> k;
cin >> q;
const int MAX_MEMBER = 100000;
// 各自の正解数を加算
int correctCount[MAX_MEMBER] = {};
for (int i = 0; i < q; i++) {
int correcter;
cin >> correcter;
correctCount[correcter - 1] += 1;
}
// 減点の合計が持ち点を超えないか確認
for (int i = 0; i < n; i++) {
if (k > (q - correctCount[i]))
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
int Q;
cin >> N >> K >> Q;
int A[Q + 3];
ll ten[N + 3];
for (int i = 1; i < Q + 1; i++)
cin >> A[i];
for (int i = 1; i < N + 1; i++)
ten[i] = K;
for (int i = 1; i < Q + 1; i++) {
ten[A[i]]++;
for (int j = 1; j < N + 1; j++) {
ten[j]--;
}
}
for (int i = 1; i < N + 1; i++) {
if (ten[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
int N;
ll K;
int Q;
cin >> N >> K >> Q;
int A[Q + 3];
ll ten[N + 3];
for (int i = 1; i < Q + 1; i++)
cin >> A[i];
for (int i = 1; i < N + 1; i++)
ten[i] = K;
for (int i = 1; i < Q + 1; i++) {
ten[A[i]]++;
}
for (int j = 1; j < N + 1; j++) {
ten[j] = ten[j] - Q;
}
for (int i = 1; i < N + 1; i++) {
if (ten[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | replace | 22 | 25 | 22 | 25 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> vec(n, k - q);
for (int i = 0; i < q; i++) {
int a;
cin >> a;
for (int j = 0; j < n; j++) {
if (j == a - 1)
vec[j]++;
}
}
for (int i = 0; i < n; i++) {
if (vec[i] > 0)
out("Yes");
else
out("No");
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) (v).begin(), (v).end()
#define out(a) cout << (a) << endl
using namespace std;
using ll = long long;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> vec(n, k - q);
for (int i = 0; i < q; i++) {
int a;
cin >> a;
vec[a - 1]++;
}
for (int i = 0; i < n; i++) {
if (vec[i] > 0)
out("Yes");
else
out("No");
}
} | replace | 13 | 17 | 13 | 14 | TLE | |
p02911 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
ll res = 1;
x = x % N;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % N;
y = y >> 1;
x = (x * x) % N;
}
return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, k, q;
cin >> n >> k >> q;
vector<ll> arr(n, 0);
f(i, 0, q) {
ll temp;
cin >> temp;
arr[temp - 1] += 1;
}
ll sum = 0;
f(i, 0, n) { sum += arr[i]; }
f(i, 0, n) {
if (sum - arr[i] >= k)
cout << "No" << endl;
else
cout << "Yes" << endl;
;
}
return 0;
}
| // #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
// #pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
constexpr auto INF = 9223372036854775807;
typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned long int ul;
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i += 1)
#define rf(i, a, b) for (ll i = (ll)a; i >= (ll)b; i -= 1)
#define endl '\n'
#define N 1000000007 // prime modulo value
#define M 998244353
#define all(x) x.begin(), x.end()
using namespace std;
// From Geeksforgeeks
inline ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
// Power function took from geeksforgeeks
ll power(ll x, ll y) {
ll res = 1;
x = x % N;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % N;
y = y >> 1;
x = (x * x) % N;
}
return res;
}
double dist(ll x1, ll y1, ll x2, ll y2) {
double ans = sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
return ans;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
ll n, k, q;
cin >> n >> k >> q;
vector<ll> arr(n, 0);
f(i, 0, q) {
ll temp;
cin >> temp;
arr[temp - 1] += 1;
}
ll sum = 0;
f(i, 0, n) { sum += arr[i]; }
f(i, 0, n) {
if (sum - arr[i] >= k)
cout << "No" << endl;
else
cout << "Yes" << endl;
;
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <stdio.h>
int main(void) {
int N, K, Q, i, j;
int A[100000];
int B[100000];
scanf("%d %d %d/n", &N, &K, &Q);
for (i = 0; i <= Q - 1; i++) {
scanf("%d/n", &A[i]);
}
for (j = 0; j <= N - 1; j++) {
B[j] = 0;
for (i = 0; i <= Q - 1; i++) {
if (A[i] == j + 1) {
B[j]++;
}
}
}
for (j = 0; j <= N - 1; j++) {
if (B[j] >= Q - K + 1) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
} | #include <stdio.h>
int main(void) {
int N, K, Q, i, j;
int A[100000];
int B[100000];
scanf("%d %d %d/n", &N, &K, &Q);
for (i = 0; i <= Q - 1; i++) {
scanf("%d/n", &A[i]);
}
for (i = 0; i <= N - 1; i++) {
B[i] = 0;
}
for (i = 0; i <= Q - 1; i++) {
j = A[i] - 1;
B[j]++;
}
for (j = 0; j <= N - 1; j++) {
if (B[j] >= Q - K + 1) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
} | replace | 10 | 17 | 10 | 16 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define P pair<int, int>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define re(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007;
// 最大公約数
int gcd(int s, int b) {
if (b == 0)
return s;
return gcd(b, s % b);
}
signed main() {
int n, k, q;
cin >> n >> k >> q;
int a[q], b[n];
rep(i, q) { cin >> a[i]; }
rep(i, n) { b[i] = k; }
rep(i, q) {
rep(j, n) {
if (j + 1 == a[i]) {
continue;
} else {
b[j]--;
}
}
}
rep(i, n) {
if (b[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define P pair<int, int>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define re(i, k, n) for (int i = k; i < n; i++)
#define mod 1000000007;
// 最大公約数
int gcd(int s, int b) {
if (b == 0)
return s;
return gcd(b, s % b);
}
signed main() {
int n, k, q;
cin >> n >> k >> q;
int a[q], b[n];
rep(i, q) { cin >> a[i]; }
rep(i, n) { b[i] = k - q; }
rep(i, q) { b[a[i] - 1]++; }
rep(i, n) {
if (b[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
} | replace | 18 | 28 | 18 | 20 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(10001), d(10001);
vector<string> ans(n);
rep(i, q) {
cin >> a.at(i);
d.at(a.at(i) - 1)++;
}
rep(i, n) {
if ((k - q + d.at(i)) > 0) {
ans.at(i) = "Yes";
} else {
ans.at(i) = "No";
}
cout << ans.at(i) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main(void) {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(100001), d(100001);
vector<string> ans(n);
rep(i, q) {
cin >> a.at(i);
d.at(a.at(i) - 1)++;
}
rep(i, n) {
if ((k - q + d.at(i)) > 0) {
ans.at(i) = "Yes";
} else {
ans.at(i) = "No";
}
cout << ans.at(i) << endl;
}
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> ans(n);
set<int> uni(a.begin(), a.end());
for (auto itr = uni.begin(); itr != uni.end(); itr++) {
ans[*itr - 1] = count(a.begin(), a.end(), *itr);
}
rep(i, n) ans[i] += k - q;
rep(i, n) puts(ans[i] <= 0 ? "No" : "Yes");
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> ans(n);
rep(i, q) ans[a[i] - 1]++;
rep(i, n) ans[i] += k - q;
rep(i, n) puts(ans[i] <= 0 ? "No" : "Yes");
return 0;
} | replace | 11 | 15 | 11 | 12 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, i, j, k, l, n, q;
cin >> n >> k >> q;
int art[n];
for (i = 0; i < n; i++) {
art[i] = k;
}
for (i = 0; i < q; i++) {
cin >> c;
c = c - 1;
for (j = 0; j < n; j++) {
if (j == c)
continue;
art[j] = art[j] - 1;
}
}
for (i = 0; i < n; i++) {
if (art[i] <= 0)
cout << "No"
<< "\n";
else
cout << "Yes"
<< "\n";
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
ios_base::sync_with_stdio(0);
cin.tie(0);
int a, b, c, i, j, k, l, n, q;
cin >> n >> k >> q;
int art[n];
for (i = 0; i < n; i++) {
art[i] = k;
}
for (i = 0; i < q; i++) {
cin >> c;
c = c - 1;
art[c] += 1;
}
for (i = 0; i < n; i++) {
art[i] -= q;
}
for (i = 0; i < n; i++) {
if (art[i] <= 0)
cout << "No"
<< "\n";
else
cout << "Yes"
<< "\n";
}
} | replace | 18 | 24 | 18 | 22 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef string str;
int main() {
// definition
int N, K, Q, i, j;
cin >> N;
cin >> K;
cin >> Q;
vector<int> A(N);
vector<int> B(N);
// input
for (i = 0; i < Q; ++i) {
cin >> B[i];
}
for (i = 0; i < N; ++i) {
A[i] = K - Q;
}
// calc
for (i = 0; i < Q; ++i) {
A[B[i] - 1] = A[B[i] - 1] + 1;
}
// output answer
for (i = 0; i < N; ++i) {
if (A[i] <= 0) {
cout << "No" << '\n';
} else {
cout << "Yes" << '\n';
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef string str;
int main() {
// definition
int N, K, Q, i, j;
cin >> N >> K >> Q;
vector<int> A(N), B(Q);
// input
for (i = 0; i < Q; ++i) {
cin >> B[i];
}
for (i = 0; i < N; ++i) {
A[i] = K - Q;
}
// calc
for (i = 0; i < Q; ++i) {
A[B[i] - 1] = A[B[i] - 1] + 1;
}
// output answer
for (i = 0; i < N; ++i) {
if (A[i] <= 0) {
cout << "No" << '\n';
} else {
cout << "Yes" << '\n';
}
}
return 0;
} | replace | 6 | 11 | 6 | 8 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(n) for (int i = 0; i < n; i++)
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> vec(q);
for (int i = 0; i < n; i++)
vec[i] = k - q;
for (int i = 0; i < q; i++) {
int a;
cin >> a;
vec[a - 1]++;
}
for (int i = 0; i < n; i++) {
if (vec[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
#define rep(n) for (int i = 0; i < n; i++)
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> vec(n);
for (int i = 0; i < n; i++)
vec[i] = k - q;
for (int i = 0; i < q; i++) {
int a;
cin >> a;
vec[a - 1]++;
}
for (int i = 0; i < n; i++) {
if (vec[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
typedef vector<int> vi;
typedef pair<int, int> pi;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define DEBUGA(a) \
cout << #a << ": "; \
for (const auto &v : (a)) \
cout << v << endl
signed main() {
int N, K, Q;
cin >> N >> K >> Q;
vi A(Q, 0);
REP(i, Q) {
int a;
cin >> a;
A[--a]++;
}
REP(i, N) {
if (K - Q + A[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int long long
typedef vector<int> vi;
typedef pair<int, int> pi;
const ll INF = 1LL << 60;
const ll MOD = 1e9 + 7;
#define pb push_back
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, b, e) for (int i = (b); i <= (int)(e); i++)
#define DEBUG(x) cout << #x << ": " << (x) << endl
#define DEBUGA(a) \
cout << #a << ": "; \
for (const auto &v : (a)) \
cout << v << endl
signed main() {
int N, K, Q;
cin >> N >> K >> Q;
vi A(N, 0);
REP(i, Q) {
int a;
cin >> a;
A[--a]++;
}
REP(i, N) {
if (K - Q + A[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> h(n, k);
rep(i, q) { h[a[i]]++; }
rep(i, q) h[i]--;
rep(i, n) {
if (h[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> h(n, k - q);
rep(i, q) { h[a[i] - 1]++; }
rep(i, n) {
if (h[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
}
| replace | 10 | 13 | 10 | 12 | 0 | |
p02911 | C++ | Runtime Error | #include <stdio.h>
int main(void) {
int part, start, answer, i, j, member[10000] = {0}, right;
scanf("%d %d %d", &part, &start, &answer);
/* for (i = 0; i < part; i++) {
member[i] = start;
}*/
for (i = 0; i < answer; i++) {
scanf("%d", &right);
member[right - 1]++;
/*for (j = 0; j < part; j++) {
member[j]--;
}*/
}
for (i = 0; i < part; i++) {
member[i] += start - answer;
}
for (i = 0; i < part; i++) {
if (member[i] > 0)
puts("Yes");
else
puts("No");
}
return 0;
} | #include <stdio.h>
int main(void) {
int part, start, answer, i, j, member[100001] = {0}, right;
scanf("%d %d %d", &part, &start, &answer);
/* for (i = 0; i < part; i++) {
member[i] = start;
}*/
for (i = 0; i < answer; i++) {
scanf("%d", &right);
member[right - 1]++;
/*for (j = 0; j < part; j++) {
member[j]--;
}*/
}
for (i = 0; i < part; i++) {
member[i] += start - answer;
}
for (i = 0; i < part; i++) {
if (member[i] > 0)
puts("Yes");
else
puts("No");
}
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, i, j, k, q;
cin >> n >> k >> q;
int a[q], s[q + 1];
for (i = 1; i <= n; i++)
s[i] = k - q;
for (i = 0; i < q; i++) {
cin >> j;
s[j]++;
}
for (i = 1; i <= n; i++) {
if (s[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, i, j, k, q;
cin >> n >> k >> q;
int a[q], s[n + 1];
for (i = 1; i <= n; i++)
s[i] = k - q;
for (i = 0; i < q; i++) {
cin >> j;
s[j]++;
}
for (i = 1; i <= n; i++) {
if (s[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
int main() {
int n, k, q;
scan(n, k, q);
vi a(q);
scan(a);
vi point(n, 0);
rep(i, q) { point[a[i] - 1] += 1; }
int max_index = 0;
int max_point = 0;
rep(i, n) {
if (max_point < point[i]) {
max_index = i;
max_point = point[i];
}
}
assert(k - (q - max_point) > 0);
int offset = k - (q - max_point) - point[max_index];
rep(i, n) {
if (point[i] + offset <= 0) {
print("No");
} else {
print("Yes");
}
}
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
int main() {
int n, k, q;
scan(n, k, q);
vi a(q);
scan(a);
vi point(n, 0);
rep(i, q) { point[a[i] - 1] += 1; }
int max_index = 0;
int max_point = 0;
rep(i, n) {
if (max_point < point[i]) {
max_index = i;
max_point = point[i];
}
}
int offset = k - (q - max_point) - point[max_index];
rep(i, n) {
if (point[i] + offset <= 0) {
print("No");
} else {
print("Yes");
}
}
return 0;
}
| delete | 143 | 144 | 143 | 143 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int cnt[00000];
int main() {
int n, K, q;
cin >> n >> K >> q;
rep(i, q) {
int a;
scanf("%d", &a);
a--;
cnt[a]++;
}
rep(i, n) {
int d = q - cnt[i];
if (d >= K) {
puts("No");
} else
puts("Yes");
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int cnt[100000];
int main() {
int n, K, q;
cin >> n >> K >> q;
rep(i, q) {
int a;
scanf("%d", &a);
a--;
cnt[a]++;
}
rep(i, n) {
int d = q - cnt[i];
if (d >= K) {
puts("No");
} else
puts("Yes");
}
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
void Main() {
int n;
int k;
int q;
cin >> n;
cin >> k;
cin >> q;
vector<int> a(n);
vector<int> b(n);
vector<int> c(n);
REP(i, q)
cin >> a[i];
for (int i = 0; i < n; i++) {
b[i] = k - q;
c[i] = 0;
}
for (int i = 0; i < q; i++) {
c[a[i] - 1] += 1;
}
for (int j = 0; j < n; j++) {
b[j] = b[j] + c[j];
}
for (int i = 0; i < n; i++) {
if (b[i] <= 0) {
printf("No\n");
} else
printf("Yes\n");
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
void Main() {
int n;
int k;
int q;
cin >> n;
cin >> k;
cin >> q;
vector<int> a(q);
vector<int> b(n);
vector<int> c(n);
REP(i, q)
cin >> a[i];
for (int i = 0; i < n; i++) {
b[i] = k - q;
c[i] = 0;
}
for (int i = 0; i < q; i++) {
c[a[i] - 1] += 1;
}
for (int j = 0; j < n; j++) {
b[j] = b[j] + c[j];
}
for (int i = 0; i < n; i++) {
if (b[i] <= 0) {
printf("No\n");
} else
printf("Yes\n");
}
}
int main() {
std::cout << std::fixed << std::setprecision(15);
Main();
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02911 | C++ | Runtime Error | #include <stdio.h>
int main() {
int N, K, Q;
int i, a[10000], j, b;
scanf("%d %d %d", &N, &K, &Q);
for (i = 1; i <= N; i++) {
a[i] = 0;
}
for (j = 1; j <= Q; j++) {
scanf("%d", &b);
a[b] = a[b] + 1;
}
for (i = 1; i <= N; i++) {
if (K - Q + a[i] > 0) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
}
| #include <stdio.h>
int main() {
int N, K, Q;
int i, a[1000000], j, b;
scanf("%d %d %d", &N, &K, &Q);
for (i = 1; i <= N; i++) {
a[i] = 0;
}
for (j = 1; j <= Q; j++) {
scanf("%d", &b);
a[b] = a[b] + 1;
}
for (i = 1; i <= N; i++) {
if (K - Q + a[i] > 0) {
printf("Yes\n");
} else {
printf("No\n");
}
}
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n, k, q;
vector<int> a;
vector<int> p;
cin >> n >> k >> q;
a.resize(q);
rep(i, q) {
int x;
cin >> x;
a[x - 1] += 1;
}
rep(i, n) { p.push_back(k); }
rep(i, n) { p[i] -= (q - a[i]); }
rep(i, n) {
if (p[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n, k, q;
vector<int> a;
vector<int> p;
cin >> n >> k >> q;
a.resize(n);
rep(i, q) {
int x;
cin >> x;
a[x - 1] += 1;
}
rep(i, n) { p.push_back(k); }
rep(i, n) { p[i] -= (q - a[i]); }
rep(i, n) {
if (p[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
for (int i = 0; i < a.size(); i++) {
cin >> a.at(i);
}
vector<int> score(n, k - q);
for (int i = 0; i < a.size(); i++) {
score.at(a.at(i)) += 1;
}
for (int i = 0; i < score.size(); i++) {
if (score.at(i) <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
for (int i = 0; i < a.size(); i++) {
cin >> a.at(i);
}
vector<int> score(n, k - q);
for (int i = 0; i < a.size(); i++) {
score.at(a.at(i) - 1) += 1;
}
for (int i = 0; i < score.size(); i++) {
if (score.at(i) <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int d[10005];
int main() {
int a, b, c;
cin >> a >> b >> c;
memset(d, 0, sizeof(d));
for (int i = 1; i <= c; i++) {
int x;
cin >> x;
d[x]++;
}
for (int i = 1; i <= a; i++) {
if (b - c + d[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int d[100005];
int main() {
int a, b, c;
cin >> a >> b >> c;
memset(d, 0, sizeof(d));
for (int i = 1; i <= c; i++) {
int x;
cin >> x;
d[x]++;
}
for (int i = 1; i <= a; i++) {
if (b - c + d[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> B(N, 0);
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
}
int k;
for (int i = 0; i < Q; i++) {
k = A.at(i);
B.at(k)++;
}
for (int i = 0; i < N; i++) {
if (B.at(i) > Q - K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> B(N, 0);
for (int i = 0; i < Q; i++) {
cin >> A.at(i);
}
int k;
for (int i = 0; i < Q; i++) {
k = A.at(i) - 1;
B.at(k)++;
}
for (int i = 0; i < N; i++) {
if (B.at(i) > Q - K) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int N, K, Q, j;
int A[10010] = {0};
int main(void) {
cin >> N >> K >> Q;
for (int i = 0; i < Q; i++) {
cin >> j;
A[j - 1]++;
}
for (int i = 0; i < N; i++) {
if (Q - K < A[i]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int N, K, Q, j;
int A[100010] = {0};
int main(void) {
cin >> N >> K >> Q;
for (int i = 0; i < Q; i++) {
cin >> j;
A[j - 1]++;
}
for (int i = 0; i < N; i++) {
if (Q - K < A[i]) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | // https://atcoder.jp/contests/abc141/tasks/abc141_c
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
int sum[10];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K, Q;
cin >> N >> K >> Q;
vector<int> v(Q), score(N, K);
REP(i, Q) {
int t;
cin >> t;
sum[t - 1]++;
}
REP(i, N) {
if (K - Q + sum[i] > 0) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | // https://atcoder.jp/contests/abc141/tasks/abc141_c
#include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
using ll = long long;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define ALLR(obj) (obj).rbegin(), (obj).rend()
int sum[100001];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, K, Q;
cin >> N >> K >> Q;
vector<int> v(Q), score(N, K);
REP(i, Q) {
int t;
cin >> t;
sum[t - 1]++;
}
REP(i, N) {
if (K - Q + sum[i] > 0) {
cout << "Yes\n";
} else {
cout << "No\n";
}
}
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <vector>
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
using namespace std;
vector<int> v;
int main() {
int n, k, q, freq[9] = {}, x, y = 0, arr[100005] = {};
cin >> n >> k >> q;
memset(freq, 0, sizeof(freq));
for (int i = 0; i < q; i++) {
cin >> x;
freq[x]++;
y++;
}
for (int i = 1; i <= n; i++) {
if ((freq[i] + (k - y)) > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <bits/stdc++.h>
#include <vector>
#define fastIO \
cout << fixed << setprecision(0), ios::sync_with_stdio(false), \
cin.tie(nullptr), cout.tie(nullptr);
using namespace std;
vector<int> v;
int main() {
int n, k, q, freq[100005] = {}, x, y = 0, arr[100005] = {};
cin >> n >> k >> q;
memset(freq, 0, sizeof(freq));
for (int i = 0; i < q; i++) {
cin >> x;
freq[x]++;
y++;
}
for (int i = 1; i <= n; i++) {
if ((freq[i] + (k - y)) > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q), p(n, k);
for (int i = 0; i < q; i++)
cin >> a[i];
for (int i = 0; i < q; i++) {
for (int j = 0; j < n; j++) {
if (j == a[i] - 1)
continue;
else if (p[j] <= 0)
continue;
p[j]--;
}
}
for (int i = 0; i < n; i++) {
if (p[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q), p(n, k);
for (int i = 0; i < q; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
p[i] -= q;
for (int i = 0; i < q; i++)
p[a[i] - 1]++;
for (int i = 0; i < n; i++) {
if (p[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | replace | 10 | 19 | 10 | 14 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF INT_MAX
#define UINF UINT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
vector<int> ten(q, 0);
REP(i, q) {
cin >> a[i];
ten[a[i] - 1]++;
}
REP(i, n) {
if (q - ten[i] < k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define INF INT_MAX
#define UINF UINT_MAX
#define MOD 1000000007
#define REP(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef std::pair<int, int> pii;
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
vector<int> ten(n, 0);
REP(i, q) {
cin >> a[i];
ten[a[i] - 1]++;
}
REP(i, n) {
if (q - ten[i] < k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
// typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
// define
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int n, k, q;
cin >> n >> k >> q;
vi a(q), point(n);
rep(i, q) cin >> a[i];
rep(i, n) point.at(i) = k;
rep(j, q) {
rep(i, n) {
if (i + 1 == a.at(j))
point.at(i)++;
point.at(i)--;
}
}
rep(i, n) {
if (point.at(i) > 0) {
puts("Yes");
} else {
puts("No");
}
}
return 0;
} | #include <bits/stdc++.h>
#include <cstring>
using namespace std;
// typedef
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
// define
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
int main() {
int n, k, q;
cin >> n >> k >> q;
vi a(q), point(n);
rep(i, q) cin >> a[i];
rep(i, n) point.at(i) = k - q;
rep(i, q) point.at(a.at(i) - 1)++;
rep(i, n) {
if (point.at(i) > 0) {
puts("Yes");
} else {
puts("No");
}
}
return 0;
}
| replace | 16 | 24 | 16 | 19 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n), score(n);
rep(i, n) score[i] = k;
rep(i, q) {
cin >> a[i];
score[a[i] - 1]++;
}
rep(i, n) {
if (score[i] <= q)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q), score(n);
rep(i, n) score[i] = k;
rep(i, q) {
cin >> a[i];
score[a[i] - 1]++;
}
rep(i, n) {
if (score[i] <= q)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> answer_man(Q, 0);
rep(i, Q) {
int answer;
cin >> answer;
answer_man[answer - 1]++;
}
rep(i, N) { cout << (K - Q + answer_man[i] > 0 ? "Yes" : "No") << endl; }
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> answer_man(N, 0);
rep(i, Q) {
int answer;
cin >> answer;
answer_man[answer - 1]++;
}
rep(i, N) { cout << (K - Q + answer_man[i] > 0 ? "Yes" : "No") << endl; }
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
const int N = 3e5 + 5, MAX = 3e7, MOD = 1e9 + 7;
using namespace std;
int n, k, q;
string a;
int main() {
scanf("%d%d%d", &n, &k, &q);
for (int i = 0; i < q; i++) {
int x;
scanf("%d", &x);
x--;
a[x]++;
}
for (int i = 0; i < n; i++) {
if (a[i] + k > q)
printf("Yes\n");
else
printf("No\n");
}
}
| #include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
const int N = 3e5 + 5, MAX = 3e7, MOD = 1e9 + 7;
using namespace std;
int n, k, q;
int a[N];
int main() {
scanf("%d%d%d", &n, &k, &q);
for (int i = 0; i < q; i++) {
int x;
scanf("%d", &x);
x--;
a[x]++;
}
for (int i = 0; i < n; i++) {
if (a[i] + k > q)
printf("Yes\n");
else
printf("No\n");
}
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
vector<int> b(n, k - q);
for (int i = 0; i < q; i++) {
cin >> a[i];
}
for (int j = 0; j < q; j++) {
b[a[j] - 1]++;
}
for (int i = 0; i < n; i++) {
// cout << b[i] <<endl;
if (b[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
vector<int> b(n, k - q);
for (int i = 0; i < q; i++) {
cin >> a[i];
}
for (int j = 0; j < q; j++) {
b[a[j] - 1]++;
}
for (int i = 0; i < n; i++) {
// cout << b[i] <<endl;
if (b[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
int main() {
speed;
int n, k, q;
cin >> n >> k >> q;
vector<int> pep(q);
vector<int> apep(n);
fill(apep.begin(), apep.end(), k);
for (int i = 0; i < q; i++) {
cin >> pep[i];
}
for (int j = 0; j < q; j++) {
for (int i = 0; i < apep.size(); i++) {
apep[i]--;
}
}
for (int i = 0; i < pep.size(); i++) {
apep[pep[i] - 1]++;
}
for (int i = 0; i < n; i++) {
if (apep[i] <= 0) {
cout << "No\n";
} else {
cout << "Yes\n";
}
}
}
| #include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
using namespace std;
int main() {
speed;
int n, k, q;
cin >> n >> k >> q;
vector<int> pep(q);
vector<int> apep(n);
fill(apep.begin(), apep.end(), k);
for (int i = 0; i < q; i++) {
cin >> pep[i];
}
for (int i = 0; i < apep.size(); i++) {
apep[i] = k - q;
}
for (int i = 0; i < pep.size(); i++) {
apep[pep[i] - 1]++;
}
for (int i = 0; i < n; i++) {
if (apep[i] <= 0) {
cout << "No\n";
} else {
cout << "Yes\n";
}
}
}
| replace | 17 | 21 | 17 | 19 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> participant(N + 1, K - Q);
int A;
for (int i = 0; i < Q; i++) {
cin >> A;
for (int j = 1; j < participant.size(); j++) {
if (j == A)
participant[j] += 1;
}
}
for (int i = 1; i < participant.size(); i++) {
cout << (participant[i] > 0 ? "Yes" : "No") << endl;
}
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> participant(N + 1, K - Q);
int A;
for (int i = 0; i < Q; i++) {
cin >> A;
participant[A] += 1;
}
for (int i = 1; i < participant.size(); i++) {
cout << (participant[i] > 0 ? "Yes" : "No") << endl;
}
return 0;
}
| replace | 13 | 17 | 13 | 14 | TLE | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> P(N, K - Q);
for (int i = 0; i < N; i++) {
cin >> A[i];
P[A[i] - 1]++;
}
for (int i = 0; i < N; i++) {
if (P[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
vector<int> P(N, K - Q);
for (int i = 0; i < Q; i++) {
cin >> A[i];
P[A[i] - 1]++;
}
for (int i = 0; i < N; i++) {
if (P[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | replace | 11 | 12 | 11 | 12 | -6 | double free or corruption (out)
|
p02911 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k, q;
vector<int> p;
cin >> n >> k >> q;
p.resize(q);
for (int i = 0; i < n; ++i) {
p[i] = 0;
}
for (int i = 0; i < q; ++i) {
int ai;
cin >> ai;
++p[ai - 1];
}
for (int i = 0; i < n; ++i) {
cout << (k - q + p[i] > 0 ? "Yes" : "No") << endl;
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k, q;
vector<int> p;
cin >> n >> k >> q;
p.resize(n);
for (int i = 0; i < n; ++i) {
p[i] = 0;
}
for (int i = 0; i < q; ++i) {
int ai;
cin >> ai;
++p[ai - 1];
}
for (int i = 0; i < n; ++i) {
cout << (k - q + p[i] > 0 ? "Yes" : "No") << endl;
}
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
for (int i = 0; i < Q; i++) {
cin >> A[i];
}
vector<int> C(N);
for (int i = 0; i < N; i++) {
C[i] = K - Q + count(A.begin(), A.end(), i + 1);
}
for (int i = 0; i < N; i++) {
if (C[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
for (int i = 0; i < Q; i++) {
cin >> A[i];
}
vector<int> C(N);
for (int i = 0; i < N; i++) {
C[i] = K - Q;
}
for (int i = 0; i < Q; i++) {
C[A[i] - 1] += 1;
}
for (int i = 0; i < N; i++) {
if (C[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
} | replace | 12 | 13 | 12 | 16 | TLE | |
p02911 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, k, q;
cin >> n >> k >> q;
int a[q];
rep(i, q) {
cin >> a[i];
a[i]--;
}
int b[n];
rep(i, n) b[i] = k;
rep(i, q) {
rep(i, n) { b[i]--; }
b[a[i]]++;
}
rep(i, n) {
if (b[i] > 0)
cout << "Yes" << ln;
else
cout << "No" << ln;
}
return 0;
} | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
// constexpr long long MOD = 998244353LL;
template <class T, class U> inline bool chmax(T &a, U b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, U b) {
if (a > b) {
a = b;
return true;
}
return false;
}
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll n, k, q;
cin >> n >> k >> q;
int a[q];
rep(i, q) {
cin >> a[i];
a[i]--;
}
int b[n];
rep(i, n) b[i] = k - q;
rep(i, q) b[a[i]]++;
rep(i, n) {
if (b[i] > 0)
cout << "Yes" << ln;
else
cout << "No" << ln;
}
return 0;
} | replace | 41 | 46 | 41 | 43 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int k;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
rep(i, q) cin >> a[i];
vector<int> crt(n, 0);
rep(i, q) { crt[a[i] - 1]++; }
int ans = 0;
rep(i, n) {
if (k + crt[i] - q > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const int INF = 1001001001;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
int k;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) cin >> a[i];
vector<int> crt(n, 0);
rep(i, q) { crt[a[i] - 1]++; }
int ans = 0;
rep(i, n) {
if (k + crt[i] - q > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, Q;
long long int K;
cin >> N >> K >> Q;
int n[10005];
for (int i = 0; i < N; i++) {
n[i] = K;
}
for (int i = 0; i < N; i++) {
n[i] = n[i] - Q;
}
for (int i = 0; i < Q; i++) {
int t;
cin >> t;
n[t - 1]++;
}
for (int i = 0; i < N; i++) {
if (n[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
} | #include <iostream>
using namespace std;
int main() {
int N, Q;
long long int K;
cin >> N >> K >> Q;
int n[100005];
for (int i = 0; i < N; i++) {
n[i] = K;
}
for (int i = 0; i < N; i++) {
n[i] = n[i] - Q;
}
for (int i = 0; i < Q; i++) {
int t;
cin >> t;
n[t - 1]++;
}
for (int i = 0; i < N; i++) {
if (n[i] <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int b[100001];
int n, k, q;
void solve() {
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) {
b[i] = k - q;
}
for (int i = 0; i < q; i++) {
cin >> a[i];
}
for (int i = 0; i < q; i++) {
b[a[i]] += 1;
}
for (int i = 1; i <= n; i++) {
if (b[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
}
signed main() {
while (1)
solve();
} | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int b[100001];
int n, k, q;
void solve() {
cin >> n >> k >> q;
for (int i = 1; i <= n; i++) {
b[i] = k - q;
}
for (int i = 0; i < q; i++) {
cin >> a[i];
}
for (int i = 0; i < q; i++) {
b[a[i]] += 1;
}
for (int i = 1; i <= n; i++) {
if (b[i] <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
}
signed main() {
// while(1)
solve();
} | replace | 28 | 30 | 28 | 30 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < q; i++)
cin >> a[i], a[i]--;
vector<int> b(n, 0);
for (int i = 0; i < q; i++)
b[a[i]]++;
for (int i = 0; i < n; i++)
cout << (k - q + b[i] > 0 ? "Yes" : "No") << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
for (int i = 0; i < q; i++)
cin >> a[i], a[i]--;
vector<int> b(n, 0);
for (int i = 0; i < q; i++)
b[a[i]]++;
for (int i = 0; i < n; i++)
cout << (k - q + b[i] > 0 ? "Yes" : "No") << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) {
cin >> a[i];
a[i]--;
}
// 正解数
vector<int> ac(q, 0);
rep(i, q) { ac[a[i]]++; }
rep(i, n) { cout << ((k - (q - ac[i])) > 0 ? "Yes" : "No") << endl; }
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(q);
rep(i, q) {
cin >> a[i];
a[i]--;
}
// 正解数
vector<int> ac(n, 0);
rep(i, q) { ac[a[i]]++; }
rep(i, n) { cout << ((k - (q - ac[i])) > 0 ? "Yes" : "No") << endl; }
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(N);
rep(i, Q) {
cin >> A[i];
A[i]--;
}
vector<ll> point(N);
point.assign(N, K - Q);
rep(i, Q) { point[A[i]]++; }
rep(i, N) {
if (point[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(Q);
rep(i, Q) {
cin >> A[i];
A[i]--;
}
vector<ll> point(N);
point.assign(N, K - Q);
rep(i, Q) { point[A[i]]++; }
rep(i, N) {
if (point[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02911 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll cor[10500];
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll a[q];
for (int i = 0; i < q; i++) {
int x;
cin >> x;
cor[x - 1] += 1;
}
for (int i = 0; i < n; i++) {
if (k - q + cor[i] <= 0) {
cout << "No";
} else
cout << "Yes";
cout << '\n';
}
} | #include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll cor[105000];
int main() {
ll n, k, q;
cin >> n >> k >> q;
ll a[q];
for (int i = 0; i < q; i++) {
int x;
cin >> x;
cor[x - 1] += 1;
}
for (int i = 0; i < n; i++) {
if (k - q + cor[i] <= 0) {
cout << "No";
} else
cout << "Yes";
cout << '\n';
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
rep(i, Q) cin >> A[i];
vector<int> score(N);
rep(i, N) score[i] = K;
rep(i, Q) rep(j, N) {
if (j != A[i] - 1)
--score[j];
}
rep(i, N) {
if (score[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(Q);
rep(i, Q) cin >> A[i];
vector<int> score(N);
rep(i, N) score[i] = K - Q; // 初期値を工夫するのがこの問題のポイント
rep(i, Q)++ score[A[i] - 1];
rep(i, N) {
if (score[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| replace | 12 | 17 | 12 | 14 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
int dp[100];
// 最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return 1;
return gcd(y, x % y);
}
// 最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
// フィボナッチ数列
// 配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
// 階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
// 累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
// 桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n, k, q;
cin >> n >> k >> q;
int N[10005];
rep(i, n) { N[i] = q; }
rep(i, q) {
int a;
cin >> a;
N[a - 1]--;
}
rep(i, n) {
if (N[i] < k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
/*
*/
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;
int dp[100];
// 最大公約数
int gcd(int x, int y) {
if (x % y == 0)
return 1;
return gcd(y, x % y);
}
// 最小公倍数
int lcm(int x, int y) { return x * y / gcd(x, y); }
// フィボナッチ数列
// 配列dpを-1で初期化する
int fib(int n) {
if (n == 0 || n == 1)
return dp[n] = 1;
if (dp[n] != -1)
return dp[n];
return dp[n] = fib(n - 1) + fib(n - 2);
}
// 階乗計算(factorial)
int fact(int n) {
if (n = 1)
return 1;
return n * fact(n - 1);
}
// 累乗計算(Exponentiation)
// x**y
ll expo(int x, int y) {
ll ans = 1;
rep(i, y) { ans *= x; }
return ans;
}
// 桁数
int keta(ll x) {
if (x == 0)
return 1;
int res = 0;
while (x) {
x /= 10;
res++;
}
return res;
}
int main() {
int n, k, q;
cin >> n >> k >> q;
int N[100005];
rep(i, n) { N[i] = q; }
rep(i, q) {
int a;
cin >> a;
N[a - 1]--;
}
rep(i, n) {
if (N[i] < k)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
/*
*/
| replace | 53 | 54 | 53 | 54 | 0 | |
p02911 | C++ | Runtime Error | /*
* Author : Sadi
* Thu 09/07/2020
* 21:53:16.66
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
template <class A, class B>
ostream &operator<<(ostream &output, const pair<A, B> &p) {
output << "(" << p.first << ", " << p.second << ")";
return output;
}
template <class A> ostream &operator<<(ostream &output, const vector<A> &a) {
output << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
output << ", ";
}
output << *it;
}
output << "]";
return output;
}
using lld = long long;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
// const int inf = 1e9;
// const int mod = 1e9 + 7;
// const double PI = acos(-1.0);
// const int mx = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n, k, q;
cin >> n >> k >> q;
vector<int> v(q);
unordered_map<int, int> umap;
for (int i = 1; i <= q; ++i) {
cin >> v[i];
umap[v[i]]++;
}
for (int i = 1; i <= n; ++i) {
int not_answered = q - umap[i];
if (k - not_answered <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
return 0;
}
| /*
* Author : Sadi
* Thu 09/07/2020
* 21:53:16.66
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define watch(x) \
; \
cout << "\n" << #x << " is: " << x << "\n";
#define all(a) (a).begin(), (a).end()
#define fi first
#define se second
template <class A, class B>
ostream &operator<<(ostream &output, const pair<A, B> &p) {
output << "(" << p.first << ", " << p.second << ")";
return output;
}
template <class A> ostream &operator<<(ostream &output, const vector<A> &a) {
output << "[";
for (auto it = a.begin(); it != a.end(); ++it) {
if (it != a.begin()) {
output << ", ";
}
output << *it;
}
output << "]";
return output;
}
using lld = long long;
using pii = pair<int, int>;
using pll = pair<lld, lld>;
// const int inf = 1e9;
// const int mod = 1e9 + 7;
// const double PI = acos(-1.0);
// const int mx = 1e5 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
int n, k, q;
cin >> n >> k >> q;
vector<int> v(q + 1);
unordered_map<int, int> umap;
for (int i = 1; i <= q; ++i) {
cin >> v[i];
umap[v[i]]++;
}
for (int i = 1; i <= n; ++i) {
int not_answered = q - umap[i];
if (k - not_answered <= 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
return 0;
}
| replace | 70 | 71 | 70 | 71 | 0 | |
p02911 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, point, times;
cin >> n >> point >> times;
vector<int> member(n, point - times);
int crct;
for (int i = 0; i < times; i++) {
cin >> crct;
for (int j = 0; j < n; j++) {
if (j == (crct - 1)) {
member.at(j)++;
}
}
}
for (int i = 0; i < n; i++) {
if (member.at(i) <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, point, times;
cin >> n >> point >> times;
vector<int> member(n, point - times);
int crct;
for (int i = 0; i < times; i++) {
cin >> crct;
member.at(crct - 1)++;
}
for (int i = 0; i < n; i++) {
if (member.at(i) <= 0)
cout << "No" << endl;
else
cout << "Yes" << endl;
}
return 0;
} | replace | 11 | 16 | 11 | 12 | TLE | |
p02911 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
int A[100001];
rep(i, Q) { cin >> A[i]; }
int B[100001];
rep(i, N) { B[i] = K; }
rep(i, Q) {
rep(j, N) {
if (j != A[i] - 1)
B[j]--;
}
}
rep(i, N) {
if (B[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
int A[100001];
rep(i, Q) { cin >> A[i]; }
int B[100001];
rep(i, N) { B[i] = K; }
int M = max(N, Q);
rep(i, M) {
B[i] -= Q;
B[A[i] - 1]++;
}
rep(i, N) {
if (B[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
}
| replace | 17 | 22 | 17 | 22 | TLE | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q, tmp;
cin >> N >> K >> Q;
vector<int> a(Q, 0);
vector<int> m(N, K);
for (int i = 0; i < Q; i++) {
cin >> tmp;
tmp--;
a[tmp]++;
}
for (int i = 0; i < N; i++) {
tmp = Q - a[i];
m[i] -= tmp;
}
for (int i = 0; i < N; i++) {
cout << (m[i] > 0 ? "Yes" : "No") << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q, tmp;
cin >> N >> K >> Q;
vector<int> a(N, 0);
vector<int> m(N, K);
for (int i = 0; i < Q; i++) {
cin >> tmp;
tmp--;
a[tmp]++;
}
for (int i = 0; i < N; i++) {
tmp = Q - a[i];
m[i] -= tmp;
}
for (int i = 0; i < N; i++) {
cout << (m[i] > 0 ? "Yes" : "No") << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02911 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long N, K, Q;
cin >> N >> K >> Q;
vector<long> A(N);
for (long i = 0; i < Q; i++) {
cin >> A[i];
}
vector<long> score(N);
for (long i = 0; i < N; i++) {
score[i] = 0;
}
for (long i = 0; i < Q; i++) {
score[A[i] - 1]++;
}
for (long i = 0; i < N; i++) {
if (K - Q + score[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
long N, K, Q;
cin >> N >> K >> Q;
vector<long> A(Q);
for (long i = 0; i < Q; i++) {
cin >> A[i];
}
vector<long> score(N);
for (long i = 0; i < N; i++) {
score[i] = 0;
}
for (long i = 0; i < Q; i++) {
score[A[i] - 1]++;
}
for (long i = 0; i < N; i++) {
if (K - Q + score[i] > 0) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02911 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)-1); i > 0; i--)
#define ALL(x) (X).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using lint = long long;
using p = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> point(N, K - Q);
vector<int> a(N);
rep(i, Q) {
cin >> a[i];
a[i]--;
}
rep(i, Q) { point.at(a[i])++; }
rep(i, N) {
if (point[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i < (int)(n); i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)-1); i > 0; i--)
#define ALL(x) (X).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using namespace std;
using lint = long long;
using p = pair<int, int>;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> point(N, K - Q);
vector<int> a(Q);
rep(i, Q) {
cin >> a[i];
a[i]--;
}
rep(i, Q) { point.at(a[i])++; }
rep(i, N) {
if (point[i] > 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.