oj.uz

Submission #704089

# Submission time Handle Problem Language Result Execution time Memory
704089 2023-03-01T14:27:28 Z vjudge1 Bank (IZhO14_bank) C++17
25 / 100
 1000 ms 340 KB 
// Problem: Elevator Rides

// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")

#include <bits/stdc++.h>
using namespace std ;

#define ff first
#define ss second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define ones(x) __builtin_popcount(x)
#define remove(v)  v.erase(unique(all(v)), v.end())
#define rep(i, a, b) for(int i = a; i <= b; i++)
#define per(i, a, b) for(int i = a; i >= b; i--)

#ifdef local
#include "C:\debug.h"
#else
#define dbg(x...) 42
#endif
#define int long long

const int N = 2e6 + 2 ;
const int MOD = 1e9 + 7 ;
const int P = 1007 ;

int n , m , a[21] , b[21] , pref[21] ;
bool dp[21] ;

int go(int i , int mask , int cur) {
    if(cur == pref[i]) {
        dp[i] = 1 ;
        i++ ;
    } 
    if(i > n) {
        return 1 ;
    }
    int ans = 0 ;
    rep(j , 0 , m - 1) {
        if(!(mask >> j & 1) && cur + b[j + 1] <= pref[i]) {
            ans |= go(i , (mask | (1 << j)) , cur + b[j + 1]) ;
        }
    }
    dp[i] = ans ;
    return dp[i] ;
}

void solve(){
    cin >> n >> m ;
    rep(i , 1 , n) cin >> a[i] ;
    rep(i , 1 , m) cin >> b[i] ;
    rep(i , 1 , n) pref[i] = pref[i - 1] + a[i] ;
    bool ok = go(1 , 0 , 0) ;
    if(dp[n]) {
        cout << "YES\n" ;
    }else{
        cout << "NO\n" ;
    }
}

signed main () {
	// ios::sync_with_stdio(false) ;
	// cin.tie(0) ;
	int test = 1 ;
	// cin >> test ; 
	for(int i = 1 ; i <= test ; i++) {
		solve() ;
	}
}

Compilation message

bank.cpp: In function 'void solve()':
bank.cpp:58:10: warning: unused variable 'ok' [-Wunused-variable]
   58 |     bool ok = go(1 , 0 , 0) ;
      |          ^~

Subtask #1
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Execution timed out 1081 ms 212 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 300 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 8 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 9 ms 340 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 1063 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 212 KB Output is correct
4 Execution timed out 1081 ms 212 KB Time limit exceeded
5 Halted 0 ms 0 KB -