oj.uz

Submission #48570

# Submission time Handle Problem Language Result Execution time Memory
48570 2018-05-16T16:43:58 Z rkocharyan Bank (IZhO14_bank) C++14
19 / 100
 1000 ms 624 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <bitset>
#include <iomanip>
#include <memory>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cassert>
using namespace std;

#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define mp make_pair
#define add push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mem(a,b) memset(a, b, sizeof(a))
#pragma warning(disable:4996)
#pragma comment(linker, "/STACK:20000007")
#pragma GCC optimize("unroll-loops")

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair <int, int> pii;
typedef vector <int> lnum;

const int N = (int)1e6 + 100;
const int maxn = (int)1e3 + 100;
const int base = (int)1e9;
const int mod = (int)1e9 + 7;
const int inf = INT_MAX;
const long long ll_inf = LLONG_MAX;
const long double PI = acos((long double)-1.0);
const long double eps = 1e-8;

int n, m;
vector <int> A, M;

void rec(vector <int> &V) {
	if (V.size() == m) {
		vector <int> dp(n, 0);
		for (int i = 0; i < m; ++i) {
			if (V[i] == -1) continue;
			dp[V[i]] += M[i];
		}
		for (int i = 0; i < n; ++i) if (dp[i] != A[i]) return;
		cout << "YES\n";
		exit(false);
	}
	for (int i = -1; i < n; ++i) {
		V.add(i);
		rec(V);
		V.pop_back();
	}
}

void solve() {
	cin >> n >> m;
	A.resize(n), M.resize(m);
	for (int i = 0; i < n; ++i) cin >> A[i];
	for (int i = 0; i < m; ++i) cin >> M[i];
	vector <int> V;
	rec(V);
	cout << "NO\n";
}

int main() {
	//ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

	//#define Freopen
#ifdef Freopen
#ifndef _MSC_VER 
#define TASK ""
	freopen(TASK".in", "r", stdin);
	freopen(TASK".out", "w", stdout);
#endif
#endif

	int T = 1;
	//scanf("%d", &T);

	for (; T; --T) solve();

#ifdef DEBUG
	cerr << double(1.0 * clock() / CLOCKS_PER_SEC) << '\n';
#endif 

	return 0;
}

Compilation message

bank.cpp:31:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning(disable:4996)
 
bank.cpp:32:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/STACK:20000007")
 
bank.cpp: In function 'void rec(std::vector<int>&)':
bank.cpp:55:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (V.size() == m) {
      ~~~~~~~~~^~~~

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 79 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 81 ms 572 KB Output is correct

Subtask #2
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 592 KB Output is correct
2 Correct 18 ms 616 KB Output is correct
3 Correct 3 ms 616 KB Output is correct
4 Correct 437 ms 624 KB Output is correct
5 Execution timed out 1078 ms 624 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1074 ms 624 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 500 KB Output is correct
3 Correct 2 ms 500 KB Output is correct
4 Correct 2 ms 564 KB Output is correct
5 Correct 79 ms 564 KB Output is correct
6 Correct 2 ms 564 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 564 KB Output is correct
9 Correct 81 ms 572 KB Output is correct
10 Correct 130 ms 592 KB Output is correct
11 Correct 18 ms 616 KB Output is correct
12 Correct 3 ms 616 KB Output is correct
13 Correct 437 ms 624 KB Output is correct
14 Execution timed out 1078 ms 624 KB Time limit exceeded
15 Halted 0 ms 0 KB -