oj.uz

답안 #786955

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
786955 2023-07-18T15:28:47 Z ChiroTruong 은행 (IZhO14_bank) C++14
100 / 100
 87 ms 8524 KB 
#include <set>
#include <vector>
#include <utility>
#include <cstring>
#include <iostream>
#include <stdlib.h>
#include <limits.h>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

using namespace std;
template<typename... Args>
void print(Args&&... args){
(cout << ... << args);}
template<typename... Args>
void scan(Args&... args){
((cin >> args), ...);}
typedef long long ll;

#define X first
#define Y second
#define lenarr 1'000'000
#define inf 1'000'000'007
#define REP(x, a, b) for ( int x = a; x < b; ++x )
#define RED(x, a, b) for ( int x = a; x > b; --x )
#define FOR(x, a, b) for ( int x = a; x <= b; ++x )
#define FOD(x, a, b) for ( int x = a; x >= b; --x )
#define swap(x, y) { string _temp = x; x = y; y = _temp; }

int const MAXN = (1 << 20) + 1;
int n, m, i, j, k, Target[21], Value[21];
pair<int, int> DP[MAXN];

int main(void){
    //freopen("INP.INP", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    scan(n, m);
    FOR(i, 1, n)
        scan(Target[i]);
    FOR(i, 1, m)
        scan(Value[i]);
    REP(i, 1, 1 << m)
        DP[i] = {0, 0};
    DP[0] = {1, 0};
    REP(i, 1, 1 << m){
        FOR(j, 1, m)
            if (i&(1<<(m-j))){ // Check bit i th 
                int before = i&~(1<<(m-j));
                if ( DP[before].X ){
                    pair<int, int> temp = DP[before];
                    temp.Y += Value[j];
                    if ( temp.Y == Target[temp.X] )
                        DP[i].X = temp.X + 1, DP[i].Y = 0;
                    else
                        if ( temp.Y < Target[temp.X] )
                            DP[i] = temp;        
                }
            }
        if ( DP[i].X == n + 1 ){
            print("YES"); return 0;
        }
    } print("NO");
    return 0;
}

Compilation message

bank.cpp: In function 'void print(Args&& ...)':
bank.cpp:15:17: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17'
   15 | (cout << ... << args);}
      |                 ^~~~
bank.cpp: In function 'void scan(Args& ...)':
bank.cpp:18:17: warning: fold-expressions only available with '-std=c++17' or '-std=gnu++17'
   18 | ((cin >> args), ...);}
      |                 ^~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 56 ms 8412 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 53 ms 8404 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 56 ms 8412 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 4 ms 8404 KB Output is correct
9 Correct 53 ms 8404 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 2 ms 460 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 78 ms 8404 KB Output is correct
32 Correct 77 ms 8524 KB Output is correct
33 Correct 64 ms 8500 KB Output is correct
34 Correct 56 ms 8504 KB Output is correct
35 Correct 56 ms 8404 KB Output is correct
36 Correct 56 ms 8404 KB Output is correct
37 Correct 63 ms 8504 KB Output is correct
38 Correct 56 ms 8500 KB Output is correct
39 Correct 4 ms 8404 KB Output is correct
40 Correct 60 ms 8404 KB Output is correct
41 Correct 56 ms 8404 KB Output is correct
42 Correct 87 ms 8500 KB Output is correct
43 Correct 58 ms 8404 KB Output is correct
44 Correct 56 ms 8504 KB Output is correct
45 Correct 5 ms 8404 KB Output is correct
46 Correct 75 ms 8504 KB Output is correct
47 Correct 65 ms 8504 KB Output is correct
48 Correct 4 ms 8404 KB Output is correct
49 Correct 57 ms 8500 KB Output is correct
50 Correct 62 ms 8404 KB Output is correct
51 Correct 57 ms 8500 KB Output is correct
52 Correct 57 ms 8404 KB Output is correct
53 Correct 71 ms 8508 KB Output is correct
54 Correct 71 ms 8404 KB Output is correct
55 Correct 62 ms 8504 KB Output is correct
56 Correct 70 ms 8404 KB Output is correct
57 Correct 60 ms 8508 KB Output is correct
58 Correct 60 ms 8504 KB Output is correct