結果
| 問題 | No.3090 Knapsack Function |
| ユーザー |
 misty1999
|
| 提出日時 | 2022-04-01 21:39:32 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,963 bytes |
| コンパイル時間 | 1,913 ms |
| コンパイル使用メモリ | 186,924 KB |
| 実行使用メモリ | 36,316 KB |
| 最終ジャッジ日時 | 2024-11-20 08:38:08 |
| 合計ジャッジ時間 | 23,983 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | AC | 7 ms
20,352 KB |
| testcase_03 | TLE | - |
| testcase_04 | WA | - |
| testcase_05 | TLE | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
| testcase_12 | WA | - |
| testcase_13 | WA | - |
| testcase_14 | WA | - |
| testcase_15 | WA | - |
| testcase_16 | TLE | - |
| testcase_17 | TLE | - |
| testcase_18 | TLE | - |
| testcase_19 | TLE | - |
| testcase_20 | TLE | - |
コンパイルメッセージ
main.cpp: In function 'void cl(T& ...)':
main.cpp:102:59: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
102 | template <class... T> void cl(T &... t) { (..., (t.clear())); }
| ^
main.cpp: In function 'void in(T& ...)':
main.cpp:103:58: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
103 | template <class... T> void in(T &... t) { (..., (cin >> t)); }
| ^
ソースコード
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#pragma comment(linker, "/stack:200000000")
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = n; i--;)
#define rrep2(i, n) for (ll i = n; i--;)
#define rrep3(i, b, a) for (ll i = b; i-- > (a);)
#define rrep4(i, b, a, c) \
for (ll i = (a) + ((b) - (a)-1) / (c) * (c); i >= (a); i -= c)
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define elif else if
ll beki(ll i) { return 1ll << i; }
#define all(v) v.begin(), v.end()
#define allm(x, y, M) for (auto [(x), (y)] : (M))
#define alls(i, S) for (auto(&i) : (S))
#define pb push_back
#define fi first
#define se second
#define escape(a) \
print(a); \
return;
const ll INF = (1LL << 61) - 1;
const ll MAX_N1 = 200010;
const ll MAX_N2 = 500010;
ll min(int x, ll y) { return min(ll(x), y); }
ll min(ll x, int y) { return min(x, ll(y)); }
ll max(int x, ll y) { return max(ll(x), y); }
ll max(ll x, int y) { return max(x, ll(y)); }
ld DIV(ll x, ll y) { return ld(x) / ld(y); }
template <class X> void print(X x) { cout << x << endl; }
template <class X> void printt(X x) { cout << x; }
void print(vl x) {
for (ll i : x) {
cout << i << " ";
}
cout << endl;
}
template <class X> vector<X> ruiseki(vector<X> &A) {
vector<X> P;
P.pb(0);
for (X i : A) {
P.pb(P.back() + i);
}
return P;
}
template <class X> vector<X> printpart(vector<X> &A, ll x, ll y) {
rep(i, x, y + 1) { cout << A[i] << " "; }
print("");
}
void print(vector<PP> x) {
for (PP i : x) {
cout << i.first << " " << i.second << endl;
}
cout << endl;
}
template <class X> void printr(X x) { cerr << x << endl; }
void printr(vl x) {
for (ll i : x) {
cerr << i << " ";
}
cerr << endl;
}
void printr(vector<PP> x) {
for (PP i : x) {
cerr << i.first << " " << i.second << endl;
}
cout << endl;
}
template <class X> int lbound(vector<X> &Y, X a) {
return lower_bound(all(Y), a) - Y.begin();
}
template <class X> int ubound(vector<X> &Y, X a) {
return upper_bound(all(Y), a) - Y.begin();
}
template <class X> X lbound2(vector<X> &Y, X a, int mode = 0) {
int x = lbound(Y, a) - mode;
if (x < 0 || x >= Y.size())
return INF;
return Y[x];
}
template <class X> X ubound2(vector<X> &Y, X a, int mode = 0) {
int x = ubound(Y, a) - mode;
if (x < 0 || x >= Y.size())
return INF;
return Y[x];
}
template <class... T> void cl(T &... t) { (..., (t.clear())); }
template <class... T> void in(T &... t) { (..., (cin >> t)); }
template <class... T> void put(vl &V, int n, int mode = 0) {
ll k;
if (mode == 0)
cl(V);
rep(i, n) {
cin >> k;
V.pb(k);
}
}
int max_index(vl &V) { return max_element(all(V)) - V.begin(); }
int min_index(vl &V) { return min_element(all(V)) - V.begin(); }
ll sum(vl &V) { return accumulate(all(V), 0ll); }
template <typename T> void UNIQUE(vector<T> &v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> T ADD(T a, T b) {
T res;
return __builtin_add_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
}
template <typename T> T MUL(T a, T b) {
T res;
return __builtin_mul_overflow(a, b, &res) ? numeric_limits<T>::max() : res;
};
template <typename T> T POW(T a, int n) {
T res = 1;
for (; n > 0; n >>= 1, a *= a)
if (n & 1)
res *= a;
return res;
}
template <class X> bool ma(X &a, X b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class X> bool mi(X &a, X b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void vset(vl &A, ll n, ll k) { A = vl(n, k); }
ll divup(ll x, ll y) { return (x + y - 1) / y; }
ll a,b,c,d,e,f, h, x, y, z, p, q, n, t, r, k, w, l, ans, m, u, v;
ll codeforces = 1;
// const ll mod = 1000000007;
const ll mod = 998244353;
vl g[MAX_N2];
vector<PP> VP, VP2;
string S,T,U;
vl A,B,C,D;
queue<ll> Q;
void solve() {
in(n);
map<ll,ll> M;
rep(i,n){
in(x,y);
ma(M[x],y);
}
if(M[1]==0){
print("No");
}
else{
print("Yes");
}
}
int main() {
cout << fixed << setprecision(15);
cin.tie(0);
ios::sync_with_stdio(false);
cin >> codeforces;
while (codeforces--) {
ans = 0;
solve();
}
}