# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
90891 | 2018-12-25T06:18:06 Z | RAkhshon | 은행 (IZhO14_bank) | C++14 | 2 ms | 504 KB |
#include<bits/stdc++.h> #define ll long long #define ld long double #define st string #define fr first #define se second #define INF 1000000000 using namespace std; ll a[101101], dp[101101]; int main() { ll n, m; scanf("%lld %lld", &n, &m); ll s; scanf("%lld", &s); for(ll i = 1; i <= m; i ++){ scanf("%lld", &a[i]); } for(ll i = 1; i <= s; i ++){ dp[i]=INF; } sort(a+1,a+1+m); for(ll j = 1; j <= m; j ++){ for(ll i = 1; i <= s; i ++){ if(i >= a[j] && dp[i] == INF && dp[i-a[j]] != a[j] && dp[i-a[j]]!=INF){ dp[i]=a[j]; } } } if(dp[s] == INF){ printf("NO"); } else { printf("YES"); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 468 KB | Output is correct |
3 | Correct | 2 ms | 468 KB | Output is correct |
4 | Correct | 2 ms | 468 KB | Output is correct |
5 | Correct | 2 ms | 468 KB | Output is correct |
6 | Correct | 2 ms | 468 KB | Output is correct |
7 | Correct | 2 ms | 468 KB | Output is correct |
8 | Correct | 2 ms | 504 KB | Output is correct |
9 | Correct | 2 ms | 504 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Correct | 2 ms | 504 KB | Output is correct |
4 | Incorrect | 2 ms | 504 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 504 KB | Output is correct |
2 | Correct | 2 ms | 504 KB | Output is correct |
3 | Incorrect | 2 ms | 504 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 468 KB | Output is correct |
3 | Correct | 2 ms | 468 KB | Output is correct |
4 | Correct | 2 ms | 468 KB | Output is correct |
5 | Correct | 2 ms | 468 KB | Output is correct |
6 | Correct | 2 ms | 468 KB | Output is correct |
7 | Correct | 2 ms | 468 KB | Output is correct |
8 | Correct | 2 ms | 504 KB | Output is correct |
9 | Correct | 2 ms | 504 KB | Output is correct |
10 | Correct | 2 ms | 504 KB | Output is correct |
11 | Correct | 2 ms | 504 KB | Output is correct |
12 | Correct | 2 ms | 504 KB | Output is correct |
13 | Incorrect | 2 ms | 504 KB | Output isn't correct |
14 | Halted | 0 ms | 0 KB | - |