제출 #90896

#제출 시각아이디문제언어결과실행 시간메모리
90896inom은행 (IZhO14_bank)C++14
25 / 100
1081 ms716 KiB
#include<bits/stdc++.h> #include<ext/pb_ds/tree_policy.hpp> #include<ext/pb_ds/assoc_container.hpp> #define fi first #define se second #define new new228 #define pb push_back #define rank rank228 #define int long long #define sz(c) (int)(c).size() #define all(c) (c).begin(), (c).end() #define rall(c) (c).rbegin(), (c).rend() using namespace std; using namespace __gnu_pbds; #pragma GCC optimize("Ofast") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native") #pragma GCC optimize("fast-math") #pragma warning(disable : 4996) typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set; // st.oreder_of_key(); const int N = 100100; const int INF = 1e15; const int MAXN = 4 * N; const int MOD = 998244353; int TN = 1; int n, m, x; int a[N], b[N]; void rec(int cur, int pos) { if (cur == x) { printf("YES\n"); exit(false); } if (cur > x) { return; } if (pos > m) { return; } rec(cur + b[pos], pos + 1); rec(cur, pos + 1); } void subtask1() { cin >> x; for (int i = 1; i <= m; i++) { cin >> b[i]; } rec(0, 1); printf("NO\n"); exit(false); } void get() { int sum = 0, j = 1; for (int i = 1; i <= m; i++) { sum += b[i]; if (sum == a[j]) { j++; sum = 0; if (j == n + 1) { cout << "YES\n"; exit(false); } } else if (sum > a[j]) { return; } } return; } void subtask2() { for (int i = 1; i <= n; i++) { cin >> a[i]; } for (int i = 1; i <= m; i++) { cin >> b[i]; } sort(b + 1, b + 1 + m); get(); while (next_permutation(b + 1, b + 1 + m)) { get(); } cout << "NO\n"; exit(false); } signed main() { // in; out; // cin >> TN; cin >> n >> m; /*if (n == 1) { subtask1(); }*/ subtask2(); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

bank.cpp:23:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable : 4996)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...